교통 체증을 고려한 물품 보관함 위치 및 동적 차량 경로 문제
Parcel Locker Locations and Dynamic Vehicle Routing Problem with Traffic Congestion
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (22)
- Arfananda, M. G., "Selection of Bandung City Travel Route Using the Floyd-Warshall Algorithm", International Journal of Integrated Engineering, 12(7), pp.90~97 (2020)
- Bertsekas, D. P., "Handbook of Combinatorial Optimization" (2010)
- Boysen, N., "Last-mile delivery concepts: A survey from an operational research perspective", IEEE Transactions on Intelligent Transportation Systems, 17(8) (2016)
- Braekers, K., "The vehicle routing problem : State of the art classification and review", Computers & Industrial Engineering, 99, pp.300~313 (2016)
- Chen, H. K., "The real-time time-dependent vehicle routing problem", Transportation Research Part E, 42, pp.383~408 (2006)
- Cimen, M., "Time-dependent green vehicle routing problem with stochastic vehicle speeds : An approximate dynamic programming algorithm", Transportation Research Part D, 54(1), pp.82~98 (2017)
- Esuabana, Micah, I., "Shortest Transportation Route Network in Nigeria Using Floyd-Warshall’s Algorithm", Mathematical Theory and Modeling, 5(8) (2015)
- Florio, A. M., "Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands", European Journal of Operational Research, 285(1), pp.172~182 (2020)
- Kim, G., "Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion", IEEE Transactions on Intelligent Transportation Systems, 17(8) (2016)
- Kim, G., "Optimization for Vehicle Routing Problem with Locations of Parcel Lockers", Journal of Korean Society of Industrial and Systems Engineering, 45(4), pp.134~141 (2022)
- Kim, S., "Optimal Vehicle Routing With Real-Time Traffic Information", IEEE Transactions on Intelligent Transportation Systems, 6(2) (2005)
- Magzhan, K., "A Review And Evaluations Of Shortest Path Algorithms", International Journal of Scientific & Technology Research, 2(6) (2013)
- Novoa, C., "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands", European Journal of Operational Research, 196, pp.509~515 (2009)
- Pillac, V., "A review of dynamic vehicle routing problems", European Journal of Operational Research, 225(1), pp.1~11 (2013)
- Risald, "Best Routes Selection Using Dijkstra and Floyd-Warshall Algorithm", International Conference on Information & Communicati-on Technology and System (2017)
- Sakharov, V., "Automatization Search for the Shortest Routes in the Transport Network Using the Floyd-warshall Algorithm", Transportation Research Procedia, 54, pp.1~11 (2021)
- Wu, Y., "GRASP-based request allocation and MDP-based vehicle routing in home pick-up service with service continuity consideration", Intelligent Transport Systems, 18(2) (2023)
- Zang, X., "Coordinated home and locker deliveries : An exact approach for the urban delivery problem with conflicting time windows", Transportation Research Part E, 177, pp.103228~ (2023)
- Zhang, J., "Dynamic Vehicle Routing with random requests : A literature review", International Journal of Production Economics, 256, pp.108751~ (2023)
- Zhang, W., "Joint location and pricing optimization of self-service in urban logistics considering customers’ choice behavior", Transportation Research Part E, 174, pp.103128~ (2023)
- Zhou, L., "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases", Sustainability, 8, pp.828~ (2016)
- Zhu, L., "Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands", Computer & Operations Research, 50(1), pp.1~13 (2014)