왕복비대칭 차량이동속도 하에서의 복수차량 배송경로 최적화
Optimization of Delivery Route for Multi-Vehicle under Time Various and Unsymmetrical Forward and Backward Vehicle Moving Speed
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forwardand backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solvingstrategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completiontimes. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of commonarea needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number ofvehicles.
Abstract
A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forwardand backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solvingstrategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completiontimes. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of commonarea needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number ofvehicles.
참고문헌 (15)
- Barreto, S., "Using clustering analysis in a capacitated locationrouting problem", European Journal of Operational Research, 179(3), pp.968~977 (2007)
- Donati, A.V., "Time dependent vehicle routing problem with a multi ant colony system", European Journal of Operational Research, 185(3), pp.1174~1191 (2008)
- Gillett, B., "A heuristic algorithm for the vehicle-dispatch problem", Operations Research, 22(2), pp.340~349 (1974)
- Haghani, A., "A dynamic vehicle routing problem with time-dependent travel times", Computers and operations research, 32(11), pp.2959~2986 (2005)
- Imran, A., "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem", European Journal of Operational Research, 197(2), pp.509~518 (2009)
- Kuo, Y., "Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem", Computers and Industrial Engineering, 59(1), pp.157~165 (2010)
- Malandraki, C., "Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms", Transportation Science, 26(3), pp.185~200 (1992)
- Mingyao, Q., "Vehicle routing problem with time windows based on spatiotemporal distance", Journal of Transportation Systems Engineering and Information Technology, 11(1), pp.85~89 (2011)
- 문기주, "시간종속VRP의 효율적 해법 설계를 위한 차량통행속도의 분석과 재구성", 산업경영시스템학회지, 35(1), pp.140~147 (2012), 한국산업경영시스템학회
- 문기주, "4개 시간구간에 의한 가변속도 차량경로해법", 산업경영시스템학회지, 35(4), pp.171~178 (2012), 한국산업경영시스템학회[DOI]
- Park, S., "An efficient delivery assignment for multi-vehicle under unsymmetry-time-various vehicle moving speeds", Autumn Conference of the Korean Operations Research and Management Science Society, pp.795~799 (2013)
- Ren, C., "Research on VRP Optimizing Based on Hierarchy clustering and IGA under Common Distribution", Computational Intelligence and Security, 2006 International Conference on, 1, pp.143~146 (2006)
- Suthikarnnarunai, N., "A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem", Proceedings of the International Multi-Conference of Engineers and Computer Scientists 2008, 2, pp.19~21 (2008)
- Venkatesan, S.R., "Optimization of Capacitated Vehicle Routing Problem Using PSO", International Journal of Engineering Science and Technoloty, 3(10), pp.7469~7477 (2011)
- Zhishuo, L., "Sweep based Multiple Ant Colonies Algorithm for Capacitated Vehicle Routing Problem, e-Business Engineering, 2005", IEEE International Conference on, pp.387~394 (2005)