한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
- /
- Pages.52-58
- /
- 2005
클러스터링을 이용한 주기적 차량운행경로 문제 해법
A Clustering Based Approach for Periodic Vehicle Routing Problems
- Kim, Byeong-In ;
- Kim, Seong-Bae (Institute of Information Technology, Inc) ;
- Sahoo, Surya (Institute of Information Technology, Inc)
- 발행 : 2005.05.13
초록
In this paper, we address a real-world periodic vehicle routing problem with time windows (PVRPTW). In addition to the general requirements of single-day vehicle routing problem, each stop has required number of visits within a cycle period in PVRPTW. Thus, we need to determine optimized days of visit for each stop with consideration of the cycle-period days together. The problem also requires consistent vehicle assignment to the stops. We developed a clustering based 3-phase approach for this problem: 1) stop-route assignment, 2) stop-day assignment, and 3) stop sequencing within a single-day route. Using the approach, we could reduce the number of routes and improve the routing efficiency for several real-world problems.
키워드