Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem

차량경로 문제에 관한 보로노이 다이어그램 기반 타부서치 알고리듬

  • Kwon, Yong-Ju (PIC center, Nexerve Co., Ltd.) ;
  • Kim, Jun-Gyu (Department of Industrial Engineering, Hanyang University) ;
  • Seo, Jeongyeon (Department of Industrial Engineering, Hanyang University) ;
  • Lee, Dong-Ho (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Deok-Soo (Department of Industrial Engineering, Hanyang University)
  • Published : 2007.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.

Keywords

References

  1. Barbarosoglu, G. and Ozgur, D. (1999), A tabu search algorithm for the vehicle routing problem, Computers and Operations Research, 26, 255-270 https://doi.org/10.1016/S0305-0548(98)00047-1
  2. Clarke, G. and Wright, J. W. (1964), Scheduling of vehicles from a central depot to a number delivery points, Operations Research, 12, 568-581 https://doi.org/10.1287/opre.12.4.568
  3. Christofides, N., Mingozzi, A., and Toth, P. (1979), The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C., editors, Combinatorial Optimization, Chichester: Wiley, 315-338
  4. Cordeau, J.-F. and Laporte, G. (2002), Tabu search heuristics for the vehicle routing problem, Technical Report, GERAD, Ecole des Hautes Etudes Comrnerciales, Montreal, Canada
  5. Dantzig, G. B. and Ramser, J. H. (1959), The truck dispatching problem, Management Science, 6, 80-91 https://doi.org/10.1287/mnsc.6.1.80
  6. Gendreau, M., Hertz, A., and Laporte, G. (1992), New insertion and post-optimization procedures for the traveling salesman problem, Operations Research, 40, 1086-1094 https://doi.org/10.1287/opre.40.6.1086
  7. Gendreau, M., Hertz, A., and Laporte, G. (1994), A tabu search heuristic for the vehicle routing problem, Management Science, 40, 1276-1290 https://doi.org/10.1287/mnsc.40.10.1276
  8. Gillett, B. and Miller, L. (1974), A heuristic algorithm for the vehicle dispatch problem, Operations Research, 22, 340-349 https://doi.org/10.1287/opre.22.2.340
  9. Glover, F. (1989), Tabu Search: Part I, ORSA Journal of Computing, 1, 190-206 https://doi.org/10.1287/ijoc.1.3.190
  10. Glover, F. (1990), Tabu Search: Part II, ORSA Journal of Computing, 2, 4-32 https://doi.org/10.1287/ijoc.2.1.4
  11. Glover, F. and Laguna, M. (1993), Tabu search. In: Reeves, C., editor, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 70-150
  12. Golden, B. L., Wasil, E. A., Kelly, J. P., and Chao, I.-M. (1998), The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, T. G., Laporte, G., editors, Fleet Management and Logistics, Boston: Kluwer, 33-56
  13. Kim, D.-S., Kim, D.-U and Sugihara, K. (2001a), Voronoi diagram of a circle set from voronoi diagram of a point set: I. Topology, Computer Aided Geometric Design, 18, 541-562 https://doi.org/10.1016/S0167-8396(01)00050-4
  14. Kim, D.-S., Kim, D.-U and Sugihara, K (2001b), Voronoi diagram of a circle set from voronoi diagram of a point set: II. Geometry, Computer Aided Geometric Design, 18, 563-585 https://doi.org/10.1016/S0167-8396(01)00051-6
  15. Laporte, G. (1992), The vehicle routing problem: an overview of exact and approximation algorithms, European Journal of Operational Research, 59, 345-358 https://doi.org/10.1016/0377-2217(92)90192-C
  16. Laporte, G., Gendreau, M., Potvin, J.-Y., and Semet, F. (2000), Classical and modern heuristics for the vehicle routing problem, International Transactions in Operations Research, 7, 285-300 https://doi.org/10.1111/j.1475-3995.2000.tb00200.x
  17. Lee, S.-H. and Lee, J. M. (2005), Study on the Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction, Journal of the Korean Institute of Industrial Engineers, 31, 228-239
  18. Lenstra, J. and Rinnooy Kan, A. (1981), Complexity of vehicle routing and scheduling problems, Networks, 11, 221-228 https://doi.org/10.1002/net.3230110211
  19. Lin, S. and Kernighan, B. W. (1973), An effective heuristic algorithm for the traveling salesman problem, Operations Research, 21, 503-511
  20. Oh, S. C., Yee, S. T., and Kim, T. Y, (2006), Agent-based Shipment Algorithm for Capacitated Vehicle Routing Problem with Load Balancing, Journal of the Korean Institute of Industrial Engineers, 32, 200-209
  21. Okabe, A., Boots, B., and Sugihara, K. (1992), Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, John Wiley & Sons
  22. Osman, I. H. (1993), Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Annals of Operations Research, 41, 421-452 https://doi.org/10.1007/BF02023004
  23. Osman, I. H. and Christofides, N. (1989), Simulated annealing and descent algorithms for capacitated clustering problems, presented as EURO-XI, Beograd, Yugoslavia
  24. Rochat, Y. and Taillard, E. (1995), Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, 1, 147-167 https://doi.org/10.1007/BF02430370
  25. Seong, J. and Moon, I. K. (2006), Vehicle Routing Problem with Time Windows considering Outsourcing Vehicles, Journal of the Korean Institute of Industrial Engineers, 32, 91-97
  26. Tarantilis, C. D. and Kiranoudis, C. T. (2002), Boneroute: an adaptive memory-based method for effective fleet management, Annals of Operations Research, 115, 227-241 https://doi.org/10.1023/A:1021157406318
  27. Toth, P. and Vigo, D. (2003), The granular tabu search and its application to the vehicle routing problem, INFORMS Journal on Computing, 15, 333-348 https://doi.org/10.1287/ijoc.15.4.333.24890