왕복비대칭 가변이동속도에서의 효율적 배송차량경로 탐색해법 연구
An Efficient Vehicle Routing Heuristic for Various and Unsymmetric Forward and Backward Vehicle Moving Speed
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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
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++.
참고문헌 (13)
- Donati, A.V., "Time dependent vehicle routing problem with a multi ant colony system", European Journal of Operational Research, 185, pp.1174~1191 (2008)
- Haghani, A., "A dynamic vehicle routing problem with time-dependent travel times", Computers and Operations Research, 32, pp.2959~2986 (2005)
- Hill, A.V., "Modeling Intra-City Time- Dependent Travel Speeds for Vehicle Scheduling Problems", Journal of Operational Research Society, 43(4), pp.343~351 (1992)
- Ichoua, S., "Vehicle dispatching with time-dependent travel times", European Journal of Operational Research, 144(2), pp.379~396 (2003)
- Jabali, O., "Time-dependent vehicle routing subject to time delay perturbations", IIE Transactions, 41, pp.1049~1066 (2009)
- Jung, S., "Genetic algorithm for the time dependent vehicle routing problem", Transportation Research Record, 1771, pp.164~171 (2001)
- Kenyon, A.S., "Stochastic vehicle routing with random travel times", Transportation Science, 37(1), pp.69~82 (2003)
- 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]
- 박성미, "시간단위 차량통행 속도정보의 활용을 위한 구역분할 방법의 연구", 산업경영시스템학회지, 33(4), pp.201~208 (2010), 한국산업경영시스템학회