A Cuckoo Search Heuristic to Improve a Last Mile Ecommerce Problem

被引：0

作者：

Escudero-Santana, Alejandro ^{[1
]}

Rodriguez-Palero, Luis Onieva Maria ^{[1
]}

Munoz-Diaz, Maria-Luisa ^{[1
]}

机构：

[1] Univ Seville, Dept Org Ind & Gest Empresas 2, Escuela Tecn Super Ingn, Camino Descubrimientos S-N, Seville 41092, Spain

来源：

PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND INDUSTRIAL MANAGEMENT, ICIEIM-XXVII CONGRESO DE INGENIERIA DE ORGANIZACION, CIO 2023 | 2024年 / 206卷

关键词：

e-commerce; last mile logistics; vrp; metaheuristics; cuckoo search; TIME;

D O I：

10.1007/978-3-031-57996-7_57

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The rise of e-commerce as an alternative to face-to-face trader has entailed an increase in logistic complexity of the deliveries to end customers. It is in these deliveries that there are too many incidences due to the recipients not being in the agreed place. This work presents a new framework of last mile logistics where customers can suggest several delivery points with different time-windows. This logistics problem is a new kind of vehicle routing problem with time-windows, but more complex. A cuckoo search heuristic has been proposed to solve it. The results reveal that this new policy with several locations can reduce delivery costs. Regarding cuckoo search, this algorithm finds good solutions, as long as the execution time is not a limitation.

引用

页码：330 / 335

页数：6

共 50 条

[41] Hybrid Cuckoo Search Approach for Course Time-Table Generation Problem
Mallick, Subhasis
Majumdar, Dipankar
Mukherjee, Soumen
Bhattacharjee, Arup Kumar
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2020, 11 (04) : 214 - 230
[42] "Last mile" delivery problem in Chinese electronic commerce logistics and improvement method research
Han, Lie
Proceedings of the 2016 6th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2016), 2016, 96 : 425 - 428
[43] The Vehicle Routing Problem Considering Customers' Multiple Preferences in Last-Mile Delivery
Zhao, Shouting
Li, Pu
Li, Qinghua
TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2024, 31 (03): : 734 - 743
[44] Solving the "last mile" problem in overdose prevention: Lessons from the HEALing Communities Study
Walters, Scott T.
Drainoni, Mari-Lynn
Oga, Emmanuel A.
Byard, Jeremy
Chandler, Redonna K.
DRUG AND ALCOHOL DEPENDENCE, 2024, 264
[45] A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping
Jiang, Li
Liang, Changyong
Dong, Junfeng
Lu, Wenxing
Mladenovic, Marko
MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
[46] Identifying the Optimal Packing and Routing to Improve Last-Mile Delivery Using Cargo Bicycles
Naumov, Vitalii
Pawlus, Michal
ENERGIES, 2021, 14 (14)
[47] Ant colony optimization for Cuckoo Search algorithm for permutation flow shop scheduling problem
Zhang, Yu
Yu, Yanlin
Zhang, Shenglan
Luo, Yingxiong
Zhang, Lieping
SYSTEMS SCIENCE & CONTROL ENGINEERING, 2019, 7 (01): : 20 - 27
[48] A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Elkeran, Ahmed
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (03) : 757 - 769
[49] A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem
Li, Xiangtao
Yin, Minghao
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (16) : 4732 - 4754
[50] A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
Hammami, Farouk
Rekik, Monia
Coelho, Leandro C.
COMPUTERS & OPERATIONS RESEARCH, 2020, 123

← 1 2 3 4 5 →