Tuning a parametric Clarke-Wright heuristic via a genetic algorithm

Journal of the Operational Research Society

Volumn 59, Issue 11, 2008, Pages 1568-1572

  Battarra, M ^a   Golden, B ^b   Vigo, D ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Genetic algorithms; Heuristics; Vehicle routing

Indexed keywords

GENETIC ALGORITHMS; VEHICLE ROUTING;

COMPUTATIONAL REQUIREMENTS; COMPUTATIONAL TESTING; COMPUTATIONAL TIME; EFFECTIVE APPROACHES; FAST LOCAL SEARCHES; HEURISTIC OPTIMIZATION; HEURISTICS; PARAMETER SETTING;

PARAMETER ESTIMATION;

EID: 53349152155     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602488     Document Type: Article

References (14)

1. Altinel IK and Öncan T (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J Opl Res Soc 56: 954-961.
2. Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D and Rinaldi G (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical report RR 949-M, University Joseph Fourier, Grenoble, France.
3. Chandran B, Golden B and Wasil E (2003). A computational study of three demon algorithm variants for solving the travelling salesman problem. In: Barghava HK and Ye N (eds). Computational Modelling and Problem Solving in the Networked World: Interfaces in Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, Kluwer Academic Publisher: Boston: MA, pp 155-175.
4. Christofides N and Eilon S (1969). An algorithm for the vehicle routing dispatching problem. Opl Res Quart 20: 309-318.
5. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, pp 315-338.
6. Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
7. Gaskell TJ (1967). Bases for vehicle fleet scheduling. Opl Res Quart 18: 281-295.
8. Golden B, Pepper J and Vossen T (1998). Using genetic algorithms for setting parameter values in heuristic search. In: Dagli C, Akay M, Buczak A, Ersoy O and Fernandez B (eds). Intelligent Engineering System through Artificial Neural Networks, Vol. 8. ASME Press: New York, pp 239-245.
9. Holland H (1992). Adaptation in Natural and Artificial Systems. MIT Press: Ann Arbor, MI.
10. Michalewicz Z (1996). Genetic Algorithms + Data Structures = Evolution Programs, Third, revised and extended edn. Springer-Verlag Berlin Heidelberg New York Publishing: Berlin.
11. Paessens H (1988). The savings algorithm for the vehicle routing problem. Eur J Opl Res 34: 336-344.
12. Pepper J, Golden B and Wasil E (2002). Solving the travel salesman problem with annealing-based heuristics: A computational study. IEEE Trans Syst Man Cybernet A 32(1): 72-77.
13. Toth P and Vigo D (2001). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM Publishing: Philadelphia, PA.
14. Yellow P (1970). A computational modification to the savings method of vehicle scheduling. Ops Res Quart 21: 281-283.