Discrete Particle Swarm Optimization with Path-Relinking for Solving the Open Vehicle Routing Problem with Time Windows
暂无分享,去创建一个
Vincent F. Yu | A. A. N. Perwira Redi | Meilinda F. N. Maghfiroh | V. Yu | A. P. Redi | M. Maghfiroh
[1] D Sariklis,et al. A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..
[2] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[3] Russell C. Eberhart,et al. Swarm intelligence for permutation optimization: a case study of n-queens problem , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).
[4] George Ioannou,et al. A greedy look-ahead heuristic for the vehicle routing problem with time windows , 2001, J. Oper. Res. Soc..
[5] Panagiotis P. Repoussis,et al. A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..
[6] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.
[7] Panagiotis P. Repoussis,et al. The open vehicle routing problem with time windows , 2007, J. Oper. Res. Soc..