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

초록

Vehicle routing problem with Time Windows is determined each vehicle route in order to minize the transportation costs. All delivery points in geography have various time restriction in comparison with the basic vehicle routing problem. Vehicle 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 that optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a Tabu Search in order to minize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark probrems.