A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem

Journal of the Operational Research Society

Volumn 56, Issue 8, 2005, Pages 954-961

  Altinel, I K ^a   Oncan T ^b  

^a BOGAZICI UNIVERSITY   (Turkey)

^b GALATASARAY UNIVERSITY   (Turkey)

Author keywords

Heuristics; Vehicle routing problem

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; OPERATIONS RESEARCH;

CAPACITATED VEHICLE ROUTING PROBLEMS (CVRP); CLARKE-WRIGHT (CW) SAVINGS METHOD; COMPUTATIONAL COSTS; METAHEURISTICS; REAL-LIFE DISTRIBUTION PROBLEMS;

VEHICLES;

EID: 22744457875     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601916     Document Type: Article

References (24)

1. Toth P and Vigo D (eds) (2001). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM publishing: Philadelphia, PA.
2. Lenstra J and Rinnooy Kan A (1981). Complexity of vehicle routing and scheduling problems. Networks 11: 221-227.
3. Toth P and Vigo D (1998). Exact solution of the vehicle routing problem. In: Crainic TG and Laporte G (eds). Fleet Management and Logistics. Kluwer, Boston, pp 1-31.
4. Laporte G, Gendreau M, Potvin J and Semet F (2000). Classical and modem heuristics for the vehicle routing problem. Int Trans Opns Res 7: 285-300.
5. Laporte G and Semet F (2001). Classical heuristics for the vehicle routing problem. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM Publishing, Philadelphia, PA, pp 109-128.
6. Gendreau M, Laporte G and Potvin J (2001). Metaheuristics for the capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM Publishing, Philadelphia, PA, pp 129-154.
7. Cordeau J-F et al (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
8. Vigo D (1996). A heuristic algorithm for the asymmetric capacitated vehicle routing problem. Eur J Opl Res 89: 108-126.
9. Salhi S and Nagy G (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Opl Res Soc 50: 1034-1042.
10. Wade AC and Salhi S (2002). An investigation into a new class of vehicle routing problem with backhauls. Omega 30: 479-487.
11. 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.
12. Gaskell TJ (1967). Bases for vehicle fleet scheduling. Opl Res Quart 18: 281-295.
13. Yellow P (1970). A computational modification to the savings method of vehicle scheduling. Opl Res Quart 21: 281-283.
14. Paessens H (1988). The savings algorithm for the vehicle routing problem. Eur J Opl Res 34: 336-344.
15. Golden BL, Magnanti TL and Nguyen HQ (1977). Implementing vehicle routing algorithms. Networks 7: 340-349.
16. Nelson MD, Nygard KE, Griffin JH and Shreve WE (1988). Implementation techniques for the vehicle routing problem. Comp Opns Res 12: 273-283.
17. Daskin MS (2002). Private communication.
18. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons: New York.
19. Altinel İK and Öncan T (2003). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem, FBE-IE-02/2003-02. Institute for Graduate Studies in Science and Engineering, Boǧaziçi University, Bebek, İstanbul, Türkiye.
20. Or İ (1976). Trawling salesman-type combinational problems and their relation to the logistics of regional blood banking. PhD dissertation, Northwestern University, Evanston, IL.
21. Lin S (1965). Computer solutions of the traveling salesman problem. Bell System Comput J 44: 2245-2269.
22. Christofides N and Eilon S (1969). An algorithm for the vehicle dispatching problem. Opl Res Qhart 20: 309-318.
23. Augerat P et al (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR 949-M Université Joseph Fourier, Grenoble.
24. Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.