Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery. (English) Zbl 1541.90073
Summary: Last mile delivery shows an increasingly tough challenge for logistics service providers due to the rapidly expanding e-commerce sales around the globe. To ease the implementation of last mile delivery, an effective delivery strategy is to predetermine the service regions of vehicles before optimizing their delivery routes. On this ground, this paper proposes a new delivery strategy named Community Logistics (CL) to generate vehicle service region and departure time dynamically. Through adopting this new delivery strategy, we transform the original last mile delivery to a new type of research problem, namely dynamic community partitioning problem (DCPP), with an aim to strike a balance between vehicle service region range, order delay time and vehicle capacity usage based on the real-time order arrivals and vehicle availability status. We present a Markov decision process (MDP) model for the DCPP and develop a heuristic solution approach to solve this MDP model. Numerical results demonstrate significant benefits of the proposed solution framework and delivery strategy.
MSC:
| 90B06 | Transportation, logistics and supply chain management |
| 90C59 | Approximation methods and heuristics in mathematical programming |
Keywords:
logistics; last mile delivery; business to customer e-commerce; community logistics; dynamic community partitioning problemReferences:
| [1] | Arnold, F.; Gendreau, M.; Sörensen, K., Efficiently solving very large-scale routing problems, Computers & Operations Research, 107, 32-42 (2019) · Zbl 1458.90055 |
| [2] | Azi, N.; Gendreau, M.; Potvin, J. Y., A dynamic vehicle routing problem with multiple delivery routes, Annals of Operations Research (2012) · Zbl 1251.90081 |
| [3] | Battarra, M.; Erdoǧan, G.; Vigo, D., Exact algorithms for the clustered vehicle routing problem, Operations Research, 62, 1, 58-71 (2014) · Zbl 1291.90030 |
| [4] | Bender, M., Kalcsics, J., & Meyer, A. (2020). Districting for parcel delivery services - A two-Stage solution approach and a real-World case study. Omega, 96, 102283. https://doi.org/10.1016/j.omega.2020.102283 |
| [5] | Carlsson, J. G., Dividing a territory among several vehicles, INFORMS Journal on Computing (2012) · Zbl 1460.90028 |
| [6] | Carlsson, J. G.; Delage, E., Robust partitioning for stochastic multivehicle routing, Operations Research (2013) · Zbl 1273.90022 |
| [7] | Chien, T. W., Operational estimators for the length of a traveling salesman tour, Computers and Operations Research, 19, 6, 469-478 (1992) · Zbl 0765.90088 |
| [8] | Comert, S. E.; Yazgan, H. R.; Kır, S.; Yener, F., A cluster first-route second approach for a capacitated vehicle routing problem: A case study, International Journal of Procurement Management, 11, 4, 399 (2018) |
| [9] | Cuda, R.; Guastaroba, G.; Speranza, M. G., A survey on two-echelon routing problems, Computers & Operations Research, 55, 185-199 (2015) · Zbl 1348.90078 |
| [10] | Defryn, C.; Sörensen, K., A fast two-level variable neighborhood search for the clustered vehicle routing problem, Computers and Operations Research, 83, 78-94 (2017) · Zbl 1458.90609 |
| [11] | Ewbank, H.; Wanke, P.; Hadi-Vencheh, A., An unsupervised fuzzy clustering approach to the capacitated vehicle routing problem, Neural Computing and Applications, 27, 4, 857-867 (2016) |
| [12] | Gendreau, M.; Hertz, A.; Laporte, G., Tabu search heuristic for the vehicle routing problem, Management Science (1994) · Zbl 0822.90053 |
| [13] | Gevaers, R.; Van de Voorde, E.; Vanelslander, T., Cost modelling and simulation of last-mile characteristics in an innovative B2C supply chain environment with implications on urban areas and cities, Procedia - Social and Behavioral Sciences (2014) |
| [14] | Gillett, B. E.; Miller, L. R., A Heuristic Algorithm for the Vehicle-Dispatch Problem, Operations Research, 22, 2, 340-349 (1974) · Zbl 0274.90013 |
| [15] | González-Ramírez, R. G.; Smith, N. R.; Askin, R. G.; Miranda, P. A.; Sánchez, J. M., A hybrid metaheuristic approach to optimize the districting design of a parcel company, Journal of Applied Research and Technology (2011) |
| [16] | Hintsch, T.; Irnich, S., Large multiple neighborhood search for the clustered vehicle-routing problem, European Journal of Operational Research (2018) · Zbl 1403.90123 |
| [17] | Hintsch, T.; Irnich, S., Exact solution of the soft-clustered vehicle-routing problem, European Journal of Operational Research (2020) · Zbl 1430.90090 |
| [18] | Hollis, B. L.; Green, P. J., Real-life vehicle routing with time windows for visual attractiveness and operational robustness, Asia-Pacific Journal of Operational Research (2012) · Zbl 1250.90018 |
| [19] | Hsieh, L.-F.; Huang, Y.-C., New batch construction heuristics to optimise the performance of order picking systems, International Journal of Production Economics, 131, 2, 618-630 (2011) |
| [20] | Huang, B.; Zhu, H.; Liu, D.; Wu, N.; Qiao, Y.; Jiang, Q., Solving last-mile logistics problem in spatiotemporal crowdsourcing via role awareness with adaptive clustering, IEEE Transactions on Computational Social Systems, 8, 3, 668-681 (2021) |
| [21] | Huang, Y.; Savelsbergh, M.; Zhao, L., Designing logistics systems for home delivery in densely populated urban areas, Transportation Research Part B: Methodological, 115, 95-125 (2018) |
| [22] | Kalcsics, J., Districting problems, Location Science (2015) |
| [23] | Retrieved from http://eproxy.lib.hku.hk/login?url=https://www.proquest.com/scholarly-journals/balanced-clustering-algorithms-improving-shapes/docview/192459518/se-2. |
| [24] | Kim, B. I.; Kim, S.; Sahoo, S., Waste collection vehicle routing problem with time windows, Computers and Operations Research (2006) · Zbl 1113.90035 |
| [25] | Klapp, M. A.; Erera, A. L.; Toriello, A., The one-dimensional dynamic dispatch waves problem, Transportation Science, 52, 2, 402-415 (2018) |
| [26] | Landa-Torres, I.; Del Ser, J.; Salcedo-Sanz, S.; Gil-Lopez, S.; Portilla-Figueras, J. A.; Alonso-Garrido, O., A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Computers & Operations Research, 39, 9, 2214-2222 (2012) · Zbl 1251.90329 |
| [27] | Laporte, G., The traveling salesman problem: An overview of exact and approximate algorithms, European Journal of Operational Research, 59, 2, 231-247 (1992) · Zbl 0760.90089 |
| [28] | Lei, H.; Laporte, G.; Guo, B., Districting for routing with stochastic customers, EURO Journal on Transportation and Logistics (2012) |
| [29] | Lei, H.; Wang, R.; Laporte, G., Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, Computers and Operations Research (2016) · Zbl 1349.90098 |
| [30] | Luo, J.; Chen, M.-R., Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW, Computers & Industrial Engineering, 72, 84-97 (2014) |
| [31] | Mai, F.; Fry, M. J.; Ohlmann, J. W., Model-based capacitated clustering with posterior regularization, European Journal of Operational Research, 271, 2, 594-605 (2018) · Zbl 1403.90519 |
| [32] | Mourão, M. C.; Nunes, A. C.; Prins, C., Heuristic methods for the sectoring arc routing problem, European Journal of Operational Research (2009) · Zbl 1176.90074 |
| [33] | Nallusamy, R.; Duraiswamy, K.; Dhanalaksmi, R.; Parthiban, P., Optimization of non-linear multiple traveling salesman problem using K-means clustering, shrink wrap algorithm and meta-heuristics, International Journal of Nonlinear Science, 9, 4, 171-177 (2010) · Zbl 1197.90059 |
| [34] | Pillac, V.; Gendreau, M.; Guéret, C.; Medaglia, A. L., A review of dynamic vehicle routing problems, European Journal of Operational Research, 225, 1, 1-11 (2013) · Zbl 1292.90203 |
| [35] | Rossit, D. G.; Vigo, D.; Tohmé, F.; Frutos, M., Visual attractiveness in routing problems: A review, Computers and Operations Research, 103, 13-34 (2019) · Zbl 1458.90134 |
| [36] | Savelsbergh, M.; Van Woensel, T., 50th anniversary invited article—City logistics: challenges and opportunities, Transportation Science, 50, 2, 579-590 (2016) |
| [37] | Sevaux, M.; Sörensen, K., Hamiltonian paths in large clustered routing problems, (Proceedings of the EU/MEeting 2008 Workshop on Metaheuristics for Logistics and Vehicle Routing, EU/ME’08 (2008)) |
| [38] | Sluijk, N.; Florio, A. M.; Kinable, J.; Dellaert, N.; Van Woensel, T., Two-echelon vehicle routing problems: A literature review, European Journal of Operational Research (2022) |
| [39] | Snoeck, A.; Winkenbach, M., A Discrete Simulation-Based Optimization Algorithm for the Design of Highly Responsive Last-Mile Distribution Networks, Transportation Science, 56, 1, 201-222 (2022) |
| [40] | Stroh, A. M.; Erera, A. L.; Toriello, A., Tactical design of same-day delivery systems, Management Science (2021) |
| [41] | Ulmer, M. W.; Goodson, J. C.; Mattfeld, D. C.; Hennig, M., Offline-online approximate dynamic programming for dynamic vehicle routing with stochastic requests, Transportation Science, 53, 1, 185-202 (2019) |
| [42] | Ulmer, M. W.; Mattfeld, D. C.; Köster, F., Budgeting time for dynamic vehicle routing with stochastic customer requests, Transportation Science, 52, 1, 20-37 (2018) |
| [43] | Ulmer, M. W.; Thomas, B. W.; Mattfeld, D. C., Preemptive depot returns for dynamic same-day delivery, EURO Journal on Transportation and Logistics, 8, 4, 327-361 (2019) |
| [44] | Vidal, T.; Laporte, G.; Matl, P., A concise guide to existing and emerging vehicle routing problem variants, European Journal of Operational Research, xxxx, 1-16 (2019) |
| [45] | Voccia, S. A.; Campbell, A. M.; Thomas, B. W., The same-day delivery problem for online purchases, Transportation Science, 53, 1, 167-184 (2019) |
| [46] | Wang, H., Routing and scheduling for a last-mile transportation system, Transportation Science, 53, 1, 131-147 (2019) |
| [47] | Winkenbach, M.; Kleindorfer, P. R.; Spinler, S., Enabling urban logistics services at la poste through multi-echelon location-routing, Transportation Science (2016) |
| [48] | Yücenur, G. N.; Demirel, N.Ç., A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem, Expert Systems with Applications, 38, 9, 11859-11865 (2011) |
| [49] | Zhou, L.; Zhen, L.; Baldacci, R.; Boschetti, M.; Dai, Y.; Lim, A., A Heuristic Algorithm for solving a large-scale real-world territory design problem, Omega (United Kingdom), 103, Article 102442 pp. (2021) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
