Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Hybrid Search for Vehicle Routing Problem With Time Windows

시간제약이 있는 차량경로문제에 대한 Hybrid 탐색

  • Lee, Hwa-Ki (Department of Industrial Engineering, Inha University) ;
  • Lee, Hong-Hee (Department of Industrial Engineering, Inha University) ;
  • Lee, Sung-Woo (Department of Industrial Engineering, Inha University) ;
  • Lee, Seung-Woo (Intelligence & Precision Machine Department, KIMM)
  • 이화기 (인하대학교 산업공학과) ;
  • 이홍희 (인하대학교 산업공학과) ;
  • 이성우 (인하대학교 산업공학과) ;
  • 이승우 (한국기계연구원 지능형정밀기계연구부)
  • Published : 2006.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows 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.

Keywords

References

  1. Chiang, W. C. and Russell,R. A.; 'Simulated Annealing Metaheuristics for the VRPTW,' Annals of Operations Research, 63 : 3-27, 1996 https://doi.org/10.1007/BF02601637
  2. Clarke, G. and Wright, J. W.; 'Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,' Operations Research, 2(4) 568-581, 1964
  3. Cook, W. and Rich, J. K.; 'A Parallel Cutting Plane Algorithm for the Vehicle Routing Problem with Time Windows,' Technical Report, Computational and Applied Mathematics, Rice University,Huston, TX, 1999
  4. Czech, Z. and Czamas, P.; 'Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows,' 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing,Canary IslandsSpain, pp. 376-383, 2002
  5. Glover, F.; 'Tabu Search : A Tutorial,' Interfaces, 20(4) : 74-94, 1990 https://doi.org/10.1287/inte.20.4.74
  6. Hornberger, J. and Gehring, H.; 'Two Evolutionary Metaheuristics for the Vehicle Routing Problems with Time Windows,' INFOR, 37 : 297-318, 1999
  7. ILOG; 'ILOG Dispatcher manual,' ILOG, 2001
  8. ILOG; 'ILOG Solver manual,' ILOG, 2001
  9. Kohl, N.J., Desrosiers, J., Madsen, O., Solomon, M., and Soumis, F.; '2-pathcuts for the Vehicle Routing Problem with Time Windows,' Transportation Science,33 : 101-116, 1999 https://doi.org/10.1287/trsc.33.1.101
  10. Solomon, M.; 'Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints,' Operations Research, 35(2) : 254-265, 1987 https://doi.org/10.1287/opre.35.2.254
  11. Voudouris, C.; 'Guided Local Search for Combinatorial Optimisation Problems,' Ph.d Dissertation, Department of Computer Science, University of Essex, Colchester, United Kingdom, 1997
  12. http://neo.lcc.uma.es/radi-aeb/WebVRP/