왕복비대칭 가변이동속도에서의 효율적 배송차량경로 탐색해법 연구

• 영문명: An Efficient Vehicle Routing Heuristic for Various and Unsymmetric Forward and Backward Vehicle Moving Speed
• 발행기관: 한국산업경영시스템학회
• 저자명: 문기주(Geeju Moon) 박성미(Sungmee Park)
• 간행물 정보: 『산업경영시스템학회지』제36권 제3호, 71~78쪽, 전체 8쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2013.09.30

영문 초록

An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

목차

Abstract

1. 서론

2. 문제의 정의 및 수리모형

3. 왕복비대칭가변속도 VRP 해법

4. 실험 및 결과

5. 결론

Reference

키워드

Vehicle Routing Problem Traveling Salesman Problem Combinatorial Optimization