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

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

DOI QR Code

Parcel Locker Locations and Dynamic Vehicle Routing Problem with Traffic Congestion

교통 체증을 고려한 물품 보관함 위치 및 동적 차량 경로 문제

  • Chaehyun Kim (Industrial and Management Engineering, Hanbat National University) ;
  • Gitae Kim (Industrial and Management Engineering, Hanbat National University)
  • 김채현 (국립한밭대학교 산업경영공학과) ;
  • 김기태 (국립한밭대학교 산업경영공학과)
  • Received : 2024.06.07
  • Accepted : 2024.06.14
  • Published : 2024.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Due to the complexity of urban area, the city vehicle routing problem has been a difficult problem. The problem has involved factors such as parking availability, road conditions, and traffic congestion, all of which increase transportation costs and delivery times. To resolve this problem, one effective solution can be the use of parcel lockers located near customer sites, where products are stored for customers to pick up. When a vehicle delivers products to a designated parcel locker, customers in the vicinity must pick up their products from that locker. Recently, identifying optimal locations for these parcel lockers has become an important research issue. This paper addresses the parcel locker location problem within the context of urban traffic congestion. By considering dynamic environmental factors, we propose a Markov decision process model to tackle the city vehicle routing problem. To ensure more real situations, we have used optimal paths for distances between two nodes. Numerical results demonstrate the viability of our model and solution strategy.

Keywords

References

  1. Arfananda, M. G., Nasution, S. M., and Setianingsih, C., Selection of Bandung City Travel Route Using the Floyd-Warshall Algorithm, International Journal of Integrated Engineering, 2020, Vol. 12, No. 7, pp. 90-97.
  2. Bertsekas, D. P., Rollout Algorithms for Discrete Optimization: A Survey, in Handbook of Combinatorial Optimization, 2010.
  3. Boysen, N., Fedtke, S., and Schwerdfeger, S., Last-mile delivery concepts: A survey from an operational research perspective, IEEE Transactions on Intelligent Transportation Systems, 2016, Vol. 17, No.8.
  4. Braekers, K., Ramaekers, K., and Nieuwenhuyse, I. V., The vehicle routing problem: State of the art classification and review, Computers & Industrial Engineering, 2016, Vol. 99, pp. 300-313.
  5. Chen, H. K., Hsueh, C. F., and Chang, M. S., The real-time time-dependent vehicle routing problem, Transportation Research Part E, 2006, Vol. 42, pp. 383-408.
  6. Cimen, M. and Soysal, M., Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm, Transportation Research Part D, 2017, Vol. 54, No. 1, pp. 82-98.
  7. Esuabana, Micah, I., Ikpang, Nkereuwem, I., and Okon, Jackson, E., Shortest Transportation Route Network in Nigeria Using Floyd-Warshall's Algorithm, Mathematical Theory and Modeling, 2015, Vol. 5, No. 8.
  8. Florio, A. M., Hartl, R. F., and Minner, S., Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, European Journal of Operational Research, 2020, Vol. 285, No. 1, pp. 172-182.
  9. Kim, G., Ong, Y. S., Cheong, T., and Tan, P. S., Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion, IEEE Transactions on Intelligent Transportation Systems, 2016, Vol. 17, No.8.
  10. Kim, G., Optimization for Vehicle Routing Problem with Locations of Parcel Lockers, Journal of Korean Society of Industrial and Systems Engineering, 2022, Vol. 45, No. 4, pp. 134-141.
  11. Kim, S., Lewis, M. E., and White, C. C., Optimal Vehicle Routing With Real-Time Traffic Information, IEEE Transactions on Intelligent Transportation Systems, 2005, Vol. 6, No. 2.
  12. Magzhan, K. and Jani, H. M., A Review And Evaluations Of Shortest Path Algorithms, International Journal of Scientific & Technology Research, 2013, Vol. 2, No. 6.
  13. Novoa, C., and Storer, R., An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, European Journal of Operational Research, 2009, Vol. 196, pp. 509-515.
  14. Pillac, V., Gendreau, M., Gueret, C., and Medaglia, A. L., A review of dynamic vehicle routing problems, European Journal of Operational Research, 2013, Vol. 225, No. 1, pp. 1-11.
  15. Risald, Mirino, A. E., and Suyoto, Best Routes Selection Using Dijkstra and Floyd-Warshall Algorithm, International Conference on Information & Communicati-on Technology and System, 2017.
  16. Sakharov, V., Chernyi, S., Saburov, S., and Chertkov, A., Automatization Search for the Shortest Routes in the Transport Network Using the Floyd-warshall Algorithm, Transportation Research Procedia, 2021, Vol. 54, pp. 1-11.
  17. Wu, Y., and Qiu, X., GRASP-based request allocation and MDP-based vehicle routing in home pick-up service with service continuity consideration, Intelligent Transport Systems, 2023, Vol. 18, No. 2.
  18. Zang, X., Jiang, L., Liang, C., and Fang, X., Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows, Transportation Research Part E, 2023, Vol. 177, 103228.
  19. Zhang, J., and Woensel, T. V., Dynamic Vehicle Routing with random requests: A literature review, International Journal of Production Economics, 2023, Vol. 256, 108751.
  20. Zhang, W., Xu, M., and Wang, S., Joint location and pricing optimization of self-service in urban logistics considering customers' choice behavior, Transportation Research Part E, 2023, Vol. 174, 103128.
  21. Zhou, L., Wang, X., Ni, L., and Lin, Y., Location-Routing Problem with Simultaneous Home Delivery and Customer's Pickup for City Distribution of Online Shopping Purchases, Sustainability, 2016, Vol. 8, 828.
  22. Zhu, L., Rousseau, L. M., Rei, W., and Li, B., Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands, Computer & Operations Research, 2014, Vol. 50, No. 1, pp. 1-13.