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

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

DOI QR Code

Pick Up and Delivery Vehicle Routing Problem Under Time Window Using Single Hub

단일 허브를 이용한 시간 제약이 존재하는 수거 및 배달 차량 경로 문제

  • Kim, Jiyong (Department of Systems Engineering, Korea Air Force Academy)
  • 김지용 (공군사관학교 시스템공학과)
  • Received : 2019.07.16
  • Accepted : 2019.11.13
  • Published : 2019.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

Keywords

References

  1. Cetiner, S., Sepil, C., and Sural, H., Hubbing and routing in postal delivery systems, Annals of Operations Research, 2010, Vol. 181, No. 1, pp. 109-124. https://doi.org/10.1007/s10479-010-0705-2
  2. Dantzig, G.B. and Rasmer, J.H., The Truck Dispatching Problem, Management Science, 1959, Vol. 6, No. 1, pp. 80-91. https://doi.org/10.1287/mnsc.6.1.80
  3. Ebery, J., Solving large single allocation p-hub problems with two or three hubs, European Journal of Operational Research, 2001, Vol. 128, No. 2, pp. 447-458. https://doi.org/10.1016/S0377-2217(99)00370-7
  4. Google map, http://maps.google.com.
  5. Hwang, I.T. and Kim, H.S., New Mathematical Model for Travel Route Recommendation Service, Journal of Society of Korea Industrial and Systems Engineering, 2017, Vol. 40, No. 3, pp. 99-106. https://doi.org/10.11627/jkise.2017.40.3.099
  6. Jin, J.M. and Kim, H.S., Designing the Operational Concepts for a Futuristic Unmanned Aerial Vehicle Delivery System, Journal of Korean Production & Operations Management Society, 2017, Vol. 28, No. 4, pp. 417-431.
  7. Kang, C.S. and Lee, J.S., A Heuristic for Fleet Size and Mix Vehicle Routing Problem with Time Deadline, Journal of Society of Korea Industrial and Systems Engineering, 2005, Vol. 28, No. 2, pp. 8-17.
  8. Kartal, Z., Hasgul, S., and Ernst, A.T., Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery, Transportation Research Part E, 2017, Vol. 108, pp. 141-159. https://doi.org/10.1016/j.tre.2017.10.004
  9. Koc, C., Bektas, T., Jabali, O., and Laporte, G., Thirty years of heterogeneous vehicle routing, European Journal of Operational Research, 2016, Vol. 249, No. 1, pp. 1-21. https://doi.org/10.1016/j.ejor.2015.07.020
  10. Moon, G.J. and Park, S.M., A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone, Journal of Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 171-178. https://doi.org/10.11627/jkise.2012.35.4.171
  11. Nagy, G. and Salhi, S., The Many-to-Many Location-Routing Problem, TOP, 1998, Vol. 6, No. 2, pp. 261-275. https://doi.org/10.1007/BF02564791
  12. Sohn, J.H. and Park, S.S., A linear program for the twohub location problem, European Journal of Operational Research, 1997, Vol. 100, No. 3, pp. 617-622. https://doi.org/10.1016/S0377-2217(96)00233-0
  13. Wasner, M. and Zapfel, G., An integrated multi- depot hub-location vehicle routing model for network planning of parcel service, International Journal of Production Economics, 2004, Vol. 90, No. 3, pp. 403-419. https://doi.org/10.1016/j.ijpe.2003.12.002

Cited by

  1. 이형 부품 표면실장기에 대한 겐트리 경로 문제의 최적 알고리즘 vol.43, pp.4, 2019, https://doi.org/10.11627/jkise.2020.43.4.067