시간제약이 있는 차량경로문제에 대한 Hybrid 탐색
Hybrid Search for Vehicle Routing Problem with Time Windows
0
조회
0
다운로드
1
인용
0
참고문헌
초록
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.
참고문헌 (10)
- "Simulated Annealing Metaheuristics for the VRPTW", 63, pp.3~27 (1996)
- "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", pp.568~581 (1964)
- "A Parallel Cutting Plane Algorithm for the Vehicle Routing Problem with Time Windows" (1999), Rice University
- "Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows", pp.376~383 (2002)
- "Two Evolutionary Metaheuristics for the Vehicle Routing Problems with Time Windows", 37, pp.297~318 (1999)
- "ILOG Dispatcher manual" (2001)
- "ILOG Solver manual" (2001)
- "2-pathcuts for the Vehicle Routing Problem with Time Windows", 33, pp.101~116 (1999)
- "Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints", pp.254~265 (1987)
- "Guided Local Search for Combinatorial Optimisation Problems" (1997)