论文信息 - A Clonal Selection Algorithm for Open Vehicle Routing Problem

A Clonal Selection Algorithm for Open Vehicle Routing Problem

In this paper, a Clonal Selection Algorithm for the Open Vehicle Routing Problem (OVRP)is presented, in which a new definition of antibodies' affinity and algorithm of keeping antibodies' diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the Clonal Selection Algorithm is efficient.

Lijun Pan | L. Pan

[1] D Sariklis,et al. A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[2] Leandro Nunes de Castro,et al. The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .

[3] Zhuo Fu,et al. The school bus routing problem: a case study , 2002, J. Oper. Res. Soc..

[4] José Brandão,et al. A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[5] Richard W. Eglese,et al. A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[6] Fernando José Von Zuben,et al. Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[7] Mike Wright,et al. Train Plan Model for British Rail Freight Services Through the Channel Tunnel , 1994 .

[8] Vincenzo Cutello,et al. The Clonal Selection Principle for In Silico and In Vitro Computing , 2005 .

[9] Richard W. Eglese,et al. Erratum: A new tabu search heuristic for the open vehicle routing problem , 2006, J. Oper. Res. Soc..

[10] Nicos Christofides,et al. The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[11] Nie Jing. A Genetic Algorithm for the Capacitated Open Vehicle Routing Problem , 2008 .