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

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

A Study on the Walking Time to Drop off Parcels on the Design of VRP Heuristic for Parcel Delivery Services

택배배송 VRP 해법 설계를 위한 도보전달소요시간에 대한 연구

  • Park, Sung-Mee (Department of Industrial and Management Systems Engineering, Dong-A University) ;
  • Moon, Gee-Ju (Department of Industrial and Management Systems Engineering, Dong-A University)
  • 박성미 (동아대학교 산업경영공학과) ;
  • 문기주 (동아대학교 산업경영공학과)
  • Received : 2012.06.01
  • Accepted : 2012.06.13
  • Published : 2012.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Parcel delivery services are a bit different from general vehicle routing problems since the services require a deliver's walking time to give the parcel to the customer. This time takes more than 1/4 of total delivery time, but it is ignored for the convenience of algorithm design in general. The walking time is too big to be ignored if we need to estimate necessary delivery time precisely as much as possible, or to design a heuristic with varying vehicle moving speeds in metropolitan area. For these reasons, the walking times are surveyed and analyzed to use on the design of VRP heuristic for parcel delivery services in this research.

Keywords

References

  1. 문기주, 허지희; "패널티와 밀집형태의 배송지점을 활용한 효율적 차량경로 탐색 알고리즘의 개발", 한국 시뮬레이션학회지, 16(3) : 1-9, 2007.
  2. 신재영, 하태영; "집배송 담당지역의 차량배정 문제", 한국경영과학회/대한산업공학회 춘계공동학술대회 발표논문집, 관동대학교, 양양, 219-222, 2001.
  3. Baldacci, R. and Mingozzi, A.; "Lower bounds and an exact method for the capacitated vehicle routing problem," IEEE, 1-4244-0451-7, 2006.
  4. Bell, W. J., Dalberto, L. M., Fisher, M. L., Greenfield, A. J., Jaikumar, R., Kedia, P., Mack, R. G., and Prutzman, P. J.; "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, 13(6) : 4-23, 1983. https://doi.org/10.1287/inte.13.6.4
  5. Dantzig, G. B. and Ramser, J. H.; "The truck dispatching problem," Management Science, 6(1) : 80-91, 1959. https://doi.org/10.1287/mnsc.6.1.80
  6. Gendreau, M., Guertin, F., Potvin, J., and Seguin R.; "Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries," Transportation Research Part C, 14 : 157-174, 2006. https://doi.org/10.1016/j.trc.2006.03.002
  7. Hil, V. and Benton, W. C.; "Modeling Intra-City Time- Dependent Travel Speeds for Vehicle Scheduling Problems," Journal of Operational Research Society, 43 : 343-351, 1992. https://doi.org/10.1057/jors.1992.49
  8. Magalhaes J. M. and Sousa J. P.; "Dynamic VRP in pharmaceutical distribution a case study," CEJOR, 14 : 177-192, 2006. https://doi.org/10.1007/s10100-006-0167-4
  9. Malandraki, C. and Daskin, M. S.; "Time Dependent Vehicle Routing Problems : Formulations, Properties and Heuristic Algorithms," Transportation Science, 26(3) : 185-200, 1992. https://doi.org/10.1287/trsc.26.3.185
  10. Sun, L. and Hu, X.; "Knowledge representation for the Model of capacitated vehicle routing problems," Proceedings of the 6th World Congress on Intelligent Control and Automation, Dalian, China, 2508-2511, 2005.