An adaptive selection evolutionary algorithm for the Capacitated Vehicle Routing Problem

2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009

Volumn , Issue , 2009, Pages

  Gwozdz, Pawel ^a   Szlachcic, Ewa ^b  

^a Global Delivery Center Wroclaw   (Poland)

^b WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Adaptive selection procedure; Capacitated Vehicle Routing Problem; Evolutionary approach

Indexed keywords

ADAPTIVE SELECTION; BENCHMARK TEST PROBLEM; CAPACITATED VEHICLE ROUTING PROBLEM; CROSSOVER OPERATOR; EVOLUTIONARY APPROACH; FEASIBLE SOLUTION; METAHEURISTIC; NUMERICAL RESULTS; SELECTION PROCESS;

ADAPTIVE ALGORITHMS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; ROUTING ALGORITHMS; VEHICLES;

PROBLEM SOLVING;

EID: 70450078735     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LINDI.2009.5258573     Document Type: Conference Paper

References (14)

1. P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, and D. Naddef, "Separating capacity constraints in the CVRP using Tabu Search", European Journal. of Operational Research, vol. 106, pp. 546-557, 1998.
2. P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, D. Naddef, and G. Rinaldi, "Computational results with a branch and cut code for the capacitated vehicle routing problem", Research Report 949-M, Université Joseph Fourier, Grenoble, France, 1995.
3. N. Christofides and S. Eilon, "An algorithm for the vehicle dispatching problem', Operational Research Q, vol. 20, pp. 309, 1969.
4. N. Christofides, A. Mingozzi, and P. Toth, "Exact algorithms for solving the vehicle routing problem based on spanning trees and shortest path relaxations", Mathematical Programming, vol. 20, pp. 255-282, 1981.
5. M. Gendreau, G. Laporte, and J-Y Potvin, "Metaheuristics for the vehicle routing problem", Les Cahiers de GERAD, vol. G -98-52, pp. 1-25, 1998.
6. B. L. Golden, G. Laporte and E. D. Taillard, "An adaptive memory heuristic for a class of vehicle routing problems with minmax objective", Technical Report CRT-95-74, Canada, Nov. 1995.
7. P. Gwozdz, Complex transportation system design using heuristic techniques, M. SC. Eng. Thesis (in Polish), Wroclaw University of Technology, 2007, unpublished.
8. G. Laporte, Y. Nobert, and M. Desrochers, "Optimal routing with capacity and distance restrictions", Operations Research, vol. 33, pp. 1050-1073, 1985.
9. J. Lysgaard, A. N. Netchford, and W. Eglese, "A new Branch-And-Cut Algorithm for the Capacitated Vehicle Routing Problem", Mathematical Programming, vol. 100, pp. 423-445, 2004.
10. F. B. Pereira, J. Tavares, P. Machado, and E. Costa, "GVR: A new genetic representation for the vehicle routing problem", In: Proceedings of the 13th. Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2002), pp. 95-102, 2002.
11. T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter; "On the capacitated vehicle routing problem", In: Mathematical Programming, vol. 94, pp. 343-359, 2003.
12. A. E. Rizzoli, F. Oliverio, R. Montemanni and L. M. Gambardella," Ant colony optimisation for vehicle routing problem: from theory to applications", Technical Report TR-15-04, IDSIA, Switzerland, 2004.
13. E. D. Taillard, "Parallel iterative search methods for vehicle routing problems", Networks, vol. 23, pp. 661-673, 1993.
14. Toth P., and Vigo D., "Models, relaxations and exact approaches for the capacitated vehicle routing problem", In: Discrete Applied Mathematics 123, pp. 487-512, 2002.