상세정보
학술지
Robust Vehicle Routing Problem with Deadlines and Travel Time/Demand Uncertainty
- 저자
- 이충목, 이경식, 박성수
- 발행일
- 201209
- 출처
- Journal of the Operational Research Society, v.63 no.9, pp.1294-1306
- ISSN
- 0160-5682
- 출판사
- Operational Research Society
- 협약과제
- 11MC1400, SMART Post 구축 기술 개발, 박종흥
- 초록
- In this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved. © 2012 Operational Research Society Ltd. All rights reserved.
- KSP 제안 키워드
- Adjustable parameters, Dantzig-Wolfe decomposition, Data uncertainty, Decomposition approach, Travel time, Uncertainty set, Vehicle Routing Problem, Vehicle capacity, column generation, computational experiments, demand uncertainty