Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구

• 영문명: Optimization of Multi-Vehicle Delivery using Sweep Algorithm and Common Area Double Reassignment
• 발행기관: 한국산업경영시스템학회
• 저자명: 박성미(Sungmee Park) 문기주(Geeju Moon)
• 간행물 정보: 『산업경영시스템학회지』제37권 제1호, 133~140쪽, 전체 7쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2014.03.31

영문 초록

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

1. 서론

2. 문제의 정의

3. 해법의 설계

4. 제안해법의 평가

5. 결론

References

키워드

Vehicle Routing Problem Multi-Vehicle Sweep Algorithm Common Area