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
相关论文
共 50 条
  • [1] Variable neighborhood search heuristics for a test assembly design problem
    Pereira, Jordi
    Vila, Mariona
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (10) : 4805 - 4817
  • [2] A Variable Neighborhood Search Algorithm for the Truck-Drone Routing Problem
    Madani, Batool
    Ndiaye, Malick
    [J]. COMPUTATIONAL LOGISTICS, ICCL 2023, 2023, 14239 : 322 - 334
  • [3] Adaptive general variable neighborhood search heuristics for solving the unit commitment problem
    Todosijevic, Raca
    Mladenovic, Marko
    Hanafi, Said
    Mladenovic, Nenad
    Crevits, Igor
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2016, 78 : 873 - 883
  • [4] Neighborhood search heuristics for the uncapacitated facility location problem
    Ghosh, D
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 150 (01) : 150 - 162
  • [5] Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent
    Infuehr, Johannes
    Raidl, Guenther R.
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2013), 2013, 7832 : 250 - 261
  • [6] Variable neighborhood search for the orienteering problem
    Sevkli, Zulal
    Sevilgen, F. Erdogan
    [J]. Computer and Information Sciences - ISCIS 2006, Proceedings, 2006, 4263 : 134 - 143
  • [7] Variable neighborhood search based algorithms for crossdock truck assignment
    Daquin, Cecilia
    Allaoui, Hamid
    Goncalves, Gilles
    Hsu, Tiente
    [J]. RAIRO-OPERATIONS RESEARCH, 2021, 55 : S2291 - S2323
  • [8] Variable neighborhood search for the linear ordering problem
    Garcia, Carlos G.
    Perez-Brito, Dionisio
    Campos, Vicente
    Marti, Rafael
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3549 - 3565
  • [9] Variable neighborhood search for the Vertex Separation Problem
    Duarte, Abraham
    Escudero, Laureano F.
    Marti, Rafael
    Mladenovic, Nenad
    Jose Pantrigo, Juan
    Sanchez-Oro, Jesus
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3247 - 3255
  • [10] Variable neighborhood search for the travelling deliveryman problem
    Nenad Mladenović
    Dragan Urošević
    Saïd Hanafi
    [J]. 4OR, 2013, 11 : 57 - 73