Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Optimization of Delivery Route for Multi-Vehicle under Time Various and Unsymmetrical Forward and Backward Vehicle Moving Speed

왕복비대칭 차량이동속도 하에서의 복수차량 배송경로 최적화

  • Park, Sungmee (Department of Industrial and Management Systems Engineering, Dong-A University) ;
  • Moon, Geeju (Department of Industrial and Management Systems Engineering, Dong-A University)
  • 박성미 (동아대학교 산업경영공학과) ;
  • 문기주 (동아대학교 산업경영공학과)
  • Received : 2013.11.24
  • Accepted : 2013.12.24
  • Published : 2013.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

Keywords

References

  1. Barreto, S., Ferreira, C., Paixao, J., and Santos, B.S., Using clustering analysis in a capacitated locationrouting problem. European Journal of Operational Research, 2007, Vol. 179, No. 3, p 968-977. https://doi.org/10.1016/j.ejor.2005.06.074
  2. Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E., and Gambardella, L.M., Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 2008, Vol. 185, No. 3, p 1174-1191. https://doi.org/10.1016/j.ejor.2006.06.047
  3. Gillett, B. and Miller, L., A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 1974, Vol. 22, No. 2, p 340-349. https://doi.org/10.1287/opre.22.2.340
  4. Haghani, A. and Jung, S., A dynamic vehicle routing problem with time-dependent travel times. Computers and operations research, 2005, Vol. 32, No. 11, p 2959- 2986. https://doi.org/10.1016/j.cor.2004.04.013
  5. Imran, A., Salhi, S., and Wassan, N.A., A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 2009, Vol. 197, No. 2, p 509-518. https://doi.org/10.1016/j.ejor.2008.07.022
  6. Kuo, Y., Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers and Industrial Engineering, 2010, Vol. 59, No. 1, p 157-165. https://doi.org/10.1016/j.cie.2010.03.012
  7. Malandraki, C. and Daskin, M.S., Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science, 1992, Vol. 26, No. 3, p 185-200. https://doi.org/10.1287/trsc.26.3.185
  8. Mingyao, Q., Guoziang, D., You, Z., and Lixin, M., Vehicle routing problem with time windows based on spatiotemporal distance. Journal of Transportation Systems Engineering and Information Technology, 2011, Vol. 11, No. 1, p 85-89.
  9. Moon, G. and Park, S., Analysis and Reconstruction of Vehicle Speeds to Design an Efficient Time Dependent VRP Heuristic. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 1, p 140-147.
  10. Moon, G. and Park, S., A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35. No. 4, p 171-178.
  11. Park, S. and Moon, G., 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, 2013, p 795-799.
  12. Ren, C. and Xiaobo, W., Research on VRP Optimizing Based on Hierarchy clustering and IGA under Common Distribution. Computational Intelligence and Security, 2006 International Conference on., 2006, Vol. 1, p. 143-146.
  13. Suthikarnnarunai, N., A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem. Proceedings of the International Multi-Conference of Engineers and Computer Scientists 2008(IMECS 2008) Hong Kong, 2008, Vol. 2, p 19-21.
  14. Venkatesan, S.R., Logendran, D., and Chandrmohan, D., Optimization of Capacitated Vehicle Routing Problem Using PSO. International Journal of Engineering Science and Technoloty(IJEST), 2011, Vol. 3, No. 10, p 7469-7477
  15. Zhishuo, L. and Yueting, C., Sweep based Multiple Ant Colonies Algorithm for Capacitated Vehicle Routing Problem, e-Business Engineering, 2005. (ICEBE'05) IEEE International Conference on, 2005, p 387-394.

Cited by

  1. Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구 vol.37, pp.1, 2013, https://doi.org/10.11627/jkise.2014.37.1.133