Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구
Optimization of Multi-Vehicle Delivery using Sweep Algorithm and Common Area Double Reassignment
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.
Abstract
An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.
참고문헌 (15)
- Ahn, B.H., "Vehicle-routing with time windows and time-varying congestion", The Journal of the Operational Research Society, 42(5), pp.393~400 (1991)
- Baker, B.M., "A genetic algorithm for the vehicle routing problem", Computers and Operations Research, 30(5), pp.787~800 (2003)
- Barreto, S., "Using clustering analysis in a capacitated location-routing problem", European Journal of Operational Research, 179(3), pp.968~977 (2007)
- Cordeau, J.-F., "A tabu search heuristic for periodic and multi-depot vehicle routing problems", Networks, 30(2), pp.105~119 (1997)
- Gillett, B., "A heuristic algorithm for the vehicle-dispatch problem", Operations research, 22(2), pp.340~349 (1974)
- Hill, A.V., "Modelling intra-city timedependent travel speeds for vehicle scheduling problems", The journal of the Operational Research Society, 43(4), pp.343~351 (1992)
- Ichoua, S., "Vehicle dispatching with time-dependent travel times", European Journal of Operational Research, 144, pp.379~396 (2003)
- 2004 Traffic Congestion Cost Analysis, "Jo, H.S.", KOTI, 137~144 (2006)
- Kang, B. G., "Strategy direction to build a strong country in global logistics", Monthly KOTI Magazine on Transport, 176, pp.2~3 (2012)
- Kuo, Y., "Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds", Computers and Industrial Engineering, 57, pp.1385~1392 (2009)
- Malandraki, C., "Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms", Transportation Science, 26(3), pp.185~200 (1992)
- Malandraki, C., "A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem", European Journal of Operational Research, 90, pp.45~55 (1996)
- 문기주, "시간종속VRP의 효율적 해법 설계를 위한 차량통행속도의 분석과 재구성", 산업경영시스템학회지, 35(1), pp.140~147 (2012), 한국산업경영시스템학회
- 문기주, "4개 시간구간에 의한 가변속도 차량경로해법", 산업경영시스템학회지, 35(4), pp.171~178 (2012), 한국산업경영시스템학회[DOI]
- 박성미, "왕복비대칭 차량이동속도 하에서의 복수차량 배송경로 최적화", 산업경영시스템학회지, 36(4), pp.138~145 (2013), 한국산업경영시스템학회