Journal of the Korea Safety Management & Science (대한안전경영과학회지)

Korea Safety Management & Science (대한안전경영과학회)
권호 표지

Study on the Guided Tabu Search for the Vehicle Routing Problem

차량경로 문제에 대한 Guided Tabu 검색

  • Lee, Seung-Woo (Intelligent Manufacturing Systems Research Division, KIMM) ;
  • Lee, Hwa-Ki (Department of Industrial Engineeing, INHA University)
  • 이승우 (한국기계연구원 지능형생산시스템연구본부) ;
  • 이화기 (인하대학교 산업공학과)
  • Published : 2008.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

The vehicle routing problem determines each vehicle routes to find the transportation costs, subject to meeting the customer demands of all delivery points in geography. Vehicle routing problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems. And computational experiments on these instances show that the proposed heuristic yields better results than the simple tabu search does.

Keywords

References

  1. 김여근, 윤복식, 이상복, '메타 휴리스틱', 영지문화사, (1997)
  2. Bodin, L. D., B. Golden, A. Assad, and M. Ball, 'The State of the Art in the Routing and Scheduling of Vehicle and Crews', Computers and Operations Research, 10(2), (1983) :79-116
  3. Christofides, N., A. Mingozzi and P. Toth, 'The Vehicle Routing Problem in Combinatorial Optimization', John Wiley, New York, (1989) :315-338
  4. Clarke, G., and J. W. Wright, 'Scheduling of Vehicles from a Central Depot to a Number of Delivery Points', Operations Research, 2(4), (1964) :568-581
  5. Dantzig, G. B. and J. H. Ramser, 'The Truck Dispatching Problem', Management Science, 6(1), (1959) :80-91 https://doi.org/10.1287/mnsc.6.1.80
  6. Fisher, M. L. and R. Jaikumar, 'A Generalized Assignment Heuristic for Vehicle Routing', Networks, 11, (1981) :109-124 https://doi.org/10.1002/net.3230110205
  7. Glover, F., 'Tabu Search : A Tutorial', Interfaces, 20(4), (1990) :74-94 https://doi.org/10.1287/inte.20.4.74
  8. Glover, F., 'Tabu Search-Part I', ORSA Journal on Computing, 1(3), (1989) :190-206 https://doi.org/10.1287/ijoc.1.3.190
  9. Glover, F., 'Tabu Search-Part II', ORSA Journal on Computing, 2(1), (1990) :4-32 https://doi.org/10.1287/ijoc.2.1.4
  10. Hansen, P., and B. Jaumard, 'Algorithms for the Maximum Satisfiability Problem', Computation, 44, (1990) :279-303
  11. ILOG, ILOG Solver manual, ILOG, (2001)
  12. ILOG, 'ILOG Solver White Paper', ILOG, (2001)
  13. Voudouris, C., 'Guided Local Search for Combinatorial Optimisation Problems', Ph.D Dissertation, Department of Computer Science, University of Essex, Colchester, United Kingdom, (1997)
  14. http://branchandcut.org/VRP/data/