A centroid-based heuristic algorithm for the capacitated vehicle routing problem

Computing and Informatics

Volumn 30, Issue 4, 2011, Pages 721-732

  Shin, Kwangcheol ^a   Han, Sangyong ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Chung Ang University   (South Korea)

Author keywords

Cluster first route second; Heuristics; Vehicle routing problem

Indexed keywords

HEURISTIC ALGORITHMS; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; CLUSTER CONSTRUCTION; CLUSTER-FIRST ROUTE-SECOND; HEURISTICS; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL TIME COMPLEXITY; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

CLUSTERING ALGORITHMS;

EID: 80053969345     PISSN: 13359150     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. LYSGAARD, J.-LETCHFORD, A.N.-EGLESE, R. W.: A New Branch-And-Cut Al-gorithm for the Capacitated Vehicle Routing Problem. Math Program, Vol. 100, 2004, pp. 423-445.
2. FUKASAWA, R.-LYSGAARD, J.-DE ARAGAO, M.P.-REIS, M.-UCHOA, E.- WERNECK, R. F.: Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math Program, Vol. 106, 2006, pp. 491-511.
3. CLARKE, G.-WRIGHT, J.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Opns. Res., Vol. 12, 1964, pp. 568-581.
4. YELLOW, P.: A Computational Modification to the Savings Method of Vehicle Scheduling. Op. Res. Quart., Vol. 21, 1970, pp. 281-283.
5. PAESSENS, H.: The Savings Algorithm for the Vehicle Routing Problem. Eur. J. Opl. Res., Vol. 34, 1988, pp. 336-344.
6. MOLE, R. H.-JAMESON, S. R.: A Sequential Route-Building Algorithm Employing a Generalized Saving Criterion. Op. Res. Quart., Vol. 27, 1976, pp. 503-511.
7. CHRISTOFIDES, N.-MINGOZZI, A.-TOTH, P.: The Vehicle Routing Problem. In: N. Christofides, A. Mingozzi, P. Toth and C. Sandi (Eds.): Combinatorial Optimiza-tion. John Wiley & Sons, New York, NY 1979.
8. GILLET, B. E.-MILLER, L. R.: A Heuristic Algorithm for the Vehicle Dispatch Problem. Opns. Res., Vol. 22, 1974, pp. 340-349.
9. WREN, A.-HOLLIDAY, A.: Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points. Op. Res. Quart., Vol. 23, 1972, pp. 333-344.
10. FISHER, M. L.-JAIKUMAR, R.: A Generalized Assignment Heuristic for Vehicle Routing. Networks, Vol. 11, 1981, pp. 109-214.
11. BRAMEL, J. B.-SIMCHI-LEVI, D.: A Location Based Heuristic for General Routing Problems. Opns. Res., Vol. 43, 1995, pp. 649-660.
12. LIN, S.: Computer Solutions of the Traveling Salesman Problem. Bell. Syst. Tech. J., Vol. 44, 1965, pp. 2245-2269.
13. LIN, S.-KERNIGHAN, B.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Opns. Res., Vol. 21, 1973, pp. 498-516.
14. OR, I.: Traveling Salesman-Type Combinatorial Optimization Problems and Their Relation to the Logistics of Regional Blood Banking. Ph. D. thesis, Northwestern University, 1976.
15. BULLNHEIMER, B.-HARTL, R. F.-STRAUSS, C: Applying the Ant System to the Vehicle Routing Problem. In: S. Voβ, S. Martello, I. H. Osman and C. Roucairol (Eds).: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Opti-mization, Kluwer, Boston, MA, 1998.
16. BULLNHEIMER, B.-HARTL, R. F.-STRAUSS, C: An Improved Ant System Algo-rithm for the Vehicle Routing Problem. Ann. Op. Res., Vol. 89, 1999, pp. 319-328.
17. BAKER, B. M.-AYECHEW, M. A.: A Genetic Algorithm for the Vehicle Routing Problem. Comput. Opns. Res., Vol. 30, 2003, pp. 787-800.
18. GLOVER, F.: Future Paths for Integer Programming and Links to Artificial Intelli-gence. Comput. Op. Res., Vol. 13, 1986, pp. 533-549.
19. AUGERAT, P.: Approche Polyedrale du Probleme de Tournees de Vehicules. Ph.D. thesis, Institut National Polytechnique de Grenoble-Inpg, 1995. Available on: http://www.branchandcut.org/VRP/data/.
20. HELSGAUN, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Eur. J. Opl. Res., Vol. 126, 2000, pp. 106-130