论文信息 - Solving the Problem of Dynamic Routes by Particle Swarm - 字舞流文

Solving the Problem of Dynamic Routes by Particle Swarm

Laetitia Jourdan | Mostefa Redouane Khouahjia | El Ghazali Talbi | L. Jourdan | El-Ghazali Talbi

[1] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[2] Roberto Montemanni,et al. Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[3] Nicos Christofides,et al. The period routing problem , 1984, Networks.

[4] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[6] R. Dupas,et al. A hybrid GA approach for solving the Dynamic Vehicle Routing Problem with Time Windows , 2006, 2006 2nd International Conference on Information & Communication Technologies.

[7] Roberto Musmanno,et al. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[8] Maurice Clerc,et al. The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[9] Michel Gendreau,et al. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[10] Allan Larsen,et al. The Dynamic Vehicle Routing Problem , 2000 .

[11] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.

[12] Beatrice M. Ombuki-Berman,et al. Dynamic vehicle routing using genetic algorithms , 2007, Applied Intelligence.