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

• 영문명: Hybrid Search for Vehicle Routing Problem with Time Windows
• 발행기관: 한국산업경영시스템학회
• 저자명: 김판조(Pan-Jo Kim) 이화기(Hwa-Ki Lee) 이홍희(Hong-Hee Lee)
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2005년 추계학술대회 논문집, 124~128쪽, 전체 5쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.10.01

영문 초록

  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. 이론적 고찰
3. 차량 경로 배정을 위한 탐색 알고리듬
4. 실험 및 분석
5. 결론
참고 문헌

키워드

Vechicle Routing Problem with Time Windows Tabu Search Guided Local Search