Novel variable neighborhood search heuristics for truck management in distribution warehouses problem

被引:0
作者
Sarhan, Akram Y. [1 ]
Melhim, Loai Kayed B. [2 ]
Jemmali, Mahdi [3 ,4 ,5 ,6 ]
El Ayeb, Faycel [7 ,8 ]
Alharbi, Hadeel [9 ]
Banjar, Ameen [10 ]
机构
[1] Univ Jeddah, Coll Comp & Informat Technol Khulis, Dept Informat Technol, Jeddah, Saudi Arabia
[2] Univ Hafr Al Batin, Coll Appl Med Sci, Dept Hlth Informat Management & Technol, Hafar Al Batin, Saudi Arabia
[3] Univ Sousse, MARS Lab, Sousse, Tunisia
[4] Univ Sharjah, Coll Comp & Informat, Sharjah, U Arab Emirates
[5] Majmaah Univ, Coll Sci Al Zulfi, Dept Comp Sci & Informat, Al Majmaah, Saudi Arabia
[6] Univ Monastir, Higher Inst Comp Sci & Math, Dept Comp Sci, Monastir, Tunisia
[7] Qassim Univ, Appl Coll, Unit Sci Res, Buraydah, Saudi Arabia
[8] La Manouba Univ, CRISTAL Lab, GRIFT Res Grp, Natl Sch Comp Sci, Manouba, Tunisia
[9] Univ Hail, Coll Comp Sci & Engn, Dept Informat & Comp Sci, Hail, Saudi Arabia
[10] Univ Jeddah, Coll Comp Sci & Engn, Dept Informat Syst & Technol, Jeddah, Saudi Arabia
关键词
Variable neighborhood search; Truck management; Distribution warehouses; Algorithms; Heuristics; SCHEDULING PROBLEM; OPTIMIZATION;
D O I
10.7717/peerj-cs.1582
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Logistics and sourcing management are core in any supply chain operation and are among the critical challenges facing any economy. The specialists classify transport operations and warehouse management as two of the biggest and costliest challenges in logistics and supply chain operations. Therefore, an effective warehouse management system is a legend to the success of timely delivery of products and the reduction of operational costs. The proposed scheme aims to discuss truck unloading operations problems. It focuses on cases where the number of warehouses is limited, and the number of trucks and the truck unloading time need to be manageable or unknown. The contribution of this article is to present a solution that: (i) enhances the efficiency of the supply chain process by reducing the overall time for the truck unloading problem; (ii) presents an intelligent metaheuristic warehouse management solution that uses dispatching rules, randomization, permutation, and iteration methods; (iii) proposes four heuristics to deal with the proposed problem; and (iv) measures the performance of the proposed solution using two uniform distribution classes with 480 trucks' unloading times instances. Our result shows that the best algorithm is gOIS, as it has a percentage of 78.7% of the used cases, an average gap of 0.001, and an average running time of 0.0053 s.
引用
收藏
页数:20
相关论文
共 38 条
[1]   Enhanced meta-heuristic optimization of resource efficiency in multi-relay underground wireless sensor networks [J].
Ayedi, Mariem .
PEERJ COMPUTER SCIENCE, 2023, 9
[2]  
Chen Kuanchin, 2023, International Journal of Applied Decision Sciences, P1, DOI 10.1504/IJADS.2023.127957
[3]   Route optimization in township logistics distribution considering customer satisfaction based on adaptive genetic algorithm [J].
Cui, Huixia ;
Qiu, Jianlong ;
Cao, Jinde ;
Guo, Ming ;
Chen, Xiangyong ;
Gorbachev, Sergey .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 204 :28-42
[4]   Adaptive particle swarm optimization for integrated quay crane and yard truck scheduling problem [J].
Dang Cong Hop ;
Nguyen Van Hop ;
Truong Tran Mai Anh .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153
[5]  
Dobler C, 2013, PhD thesis.
[6]   A heuristic to solve the synchronized log-truck scheduling problem [J].
El Hachemi, Nizar ;
Gendreau, Michel ;
Rousseau, Louis-Martin .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (03) :666-673
[7]   Autonomous Delivery Solutions for Last-Mile Logistics Operations: A Literature Review and Research Agenda [J].
Engesser, Valeska ;
Rombaut, Evy ;
Vanhaverbeke, Lieselot ;
Lebeau, Philippe .
SUSTAINABILITY, 2023, 15 (03)
[8]   A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem [J].
Escamilla Serna, Nayeli Jazmin ;
Carlos Seck-Tuoh-Mora, Juan ;
Medina-Marin, Joselito ;
Hernandez-Romero, Norberto ;
Barragan-Vite, Irving ;
Corona Armenta, Jose Ramon .
PEERJ COMPUTER SCIENCE, 2021,
[9]   Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations [J].
Fabry, Quentin ;
Agnetis, Alessandro ;
Berghman, Lotte ;
Briand, Cyril .
OPERATIONS RESEARCH LETTERS, 2022, 50 (01) :50-56
[10]   Truck Scheduling Problem Considering Carbon Emissions under Truck Appointment System [J].
Fan, Houming ;
Ren, Xiaoxue ;
Guo, Zhenfeng ;
Li, Yang .
SUSTAINABILITY, 2019, 11 (22)