Browse > Article

Hybrid Search for Vehicle Routing Problem With Time Windows  

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)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.29, no.3, 2006 , pp. 62-69 More about this Journal
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
Vechicle routing problem with time windows; Tabu search; Guided local search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 Glover, F.; 'Tabu Search : A Tutorial,' Interfaces, 20(4) : 74-94, 1990   DOI
3 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   DOI   ScienceOn
4 Voudouris, C.; 'Guided Local Search for Combinatorial Optimisation Problems,' Ph.d Dissertation, Department of Computer Science, University of Essex, Colchester, United Kingdom, 1997
5 ILOG; 'ILOG Dispatcher manual,' ILOG, 2001
6 Chiang, W. C. and Russell,R. A.; 'Simulated Annealing Metaheuristics for the VRPTW,' Annals of Operations Research, 63 : 3-27, 1996   DOI
7 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
8 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
9 ILOG; 'ILOG Solver manual,' ILOG, 2001
10 http://neo.lcc.uma.es/radi-aeb/WebVRP/
11 Solomon, M.; 'Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints,' Operations Research, 35(2) : 254-265, 1987   DOI   ScienceOn
12 Hornberger, J. and Gehring, H.; 'Two Evolutionary Metaheuristics for the Vehicle Routing Problems with Time Windows,' INFOR, 37 : 297-318, 1999