Articles & Issues
- Language
- English
- Conflict of Interest
- In relation to this article, we declare that there is no conflict of interest.
- Publication history
-
Received November 12, 2023
Revised April 26, 2023
Accepted May 3, 2023
- Acknowledgements
- This work was supported by Korea Environment Industry &Technology Institute (KEITI) through Advanced Technology Development Project for Predicting and Preventing Chemical Accidents, funded by the Ministry of Environment (MOE) (2022003620005) and supported by Korea Institute for Advancement of Technology (KIAT) through Smart Digital Engineering Education and Training for Lead Engineer project (P0008475-G02P04570001901) funded by the Ministry of Trade, Industry and Energy (MOTIE). We would also like to thank
-
This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/bync/3.0) which permits
unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
All issues
Highly feasible, energy-minimizing and time window-guaranteeing last-mile delivery routes generation based on clustering and local search considering package densities
Download PDF
Abstract
The last-mile, which is the final stage of delivery, has great meaning for both consumers and suppliers.
Consumers first form user experiences with a company in the final delivery stage, and the efficient last mile delivery
for suppliers must be achieved by guaranteed delivery time window and minimized delivery cost in energy and time.
Execution feasibility is also important, because the optimal route is optimal only when it is actually executed by drivers. In this study, we aim to create an optimal route with high feasibility and minimal energy consumption for green
delivery. The proposed method minimizes the sum of volume-weighted delivery time of packages and determines the
priority of the visit by considering clusters made from the zone ID sequences systematically extracted from the collected delivery routes. The optimal route is generated by determining the order of visits of inter- and intra-clusters
through local search based minimization. Case studies using the actual delivery data provided by the Amazon Lastmile Routing Challenge in year 2021 show its efficiency in achieving green delivery
References
fileDown&FileNm=uma_200214.html (2020).
2. Jacopo Prisco, Why UPS trucks (almost) never turn left, CNN, https://edition.cnn.com/2017/02/16/world/ups-trucks-no-left-turns/index.html (2017).
3. M. Dorigo, M. Birattari and T. Stutzle, IEEE Comput. Intelligence Mag., 1(4), 28 (2006).
4. J. H. Holland, Sci. Am., 267(1), 66 (1992).
5. R. M. Brady, Nature, 317, 804 (1985).
6. Y. Nagata and S. Kobayashi, INFORMS J. Computing, 25(2) (2012).
7. B.-r. Moon, Easy-to-learn genetic algorithms evolutionary approach, Hanbit Academy (2008).
8. J. D. C. Little, Oper. Res., 11(6), 972 (1963).
9. S.-h. Zhan, Comput. Intelligence Neurosci., 2016(5), 1 (2016).
10. S. Mirjalili, Evolutionary Algorithms and Neural Networks: Theory and Applications, Springer (2018).
11. G. A. Croes, Oper. Res., 6, 791 (1958).
12. S. Lin and B. W. Kernighan, Oper. Res., 21(2), 498 (1973).
13. Keld Helsgaun, Efficient Recombination in the Lin-KernighanHelsgaun Traveling Salesman Heuristic, Parallel Problem Solving from Nature-PPSN XV : 15th International Conference, Coimbra, Portugal, Part I (2018).
14. D. Zhang, EURASIP J. Adv. Signal Process., 2010, 303140 (2010).
15. J.-H. Kim, J. Korean Soc. Transport., 29(2), 25 (2011).
16. P. M. Thompson and H. N. Psaraftis, Oper. Res., 41(5), 935 (1993).
17. G. Laporte, Eur. J. Oper. Res., 59, 231 (1992).
18. Larry Hardesty, Amazon, MIT team up to add driver know-how to delivery-routing models, Amazon Science Blog, https://www.
amazon.science/blog/amazon-mit-team-up-to-add-driver-know-howto-delivery-routing-models (2021
