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.

1. 서 론
 2. 이론적 고찰
  2.1 타부 탐색(Tabu Search)
  2.2 안내 지역 탐색(Guided Local Search)
 3. 차량 경로 배정을 위한 탐색 알고리듬
 4. 실험 및 분석
  4.1 실험 결과
  4.2 결과 분석
 5. 결론
 참고 문헌

• 김판조(인하대학교 산업공학과) | Pan-Jo Kim
• 이화기(인하대학교 산업공학과) | Hwa-Ki Lee
• 이홍희(인하대학교 산업공학과) | Hong-Hee Lee