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

• 영문명: Hybrid Search for Vehicle Routing Problem with Time Windows
• 발행기관: 한국산업경영시스템학회
• 저자명: 이화기(Hwa-Ki Lee) 이홍희(Hong-Hee Lee) 이성우(Sung-Woo Lee) 이승우(Seung-Woo Lee)
• 간행물 정보: 『산업경영시스템학회지』제29권 제3호, 62~69쪽, 전체 8쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2006.09.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