Cargando…
Novel variable neighborhood search heuristics for truck management in distribution warehouses problem
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...
Autores principales: | , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10588704/ https://www.ncbi.nlm.nih.gov/pubmed/37869458 http://dx.doi.org/10.7717/peerj-cs.1582 |
_version_ | 1785123636161544192 |
---|---|
author | Sarhan, Akram Y. B. Melhim, Loai Kayed Jemmali, Mahdi El Ayeb, Faycel Alharbi, Hadeel Banjar, Ameen |
author_facet | Sarhan, Akram Y. B. Melhim, Loai Kayed Jemmali, Mahdi El Ayeb, Faycel Alharbi, Hadeel Banjar, Ameen |
author_sort | Sarhan, Akram Y. |
collection | PubMed |
description | 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 [Image: see text] , 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. |
format | Online Article Text |
id | pubmed-10588704 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | PeerJ Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-105887042023-10-21 Novel variable neighborhood search heuristics for truck management in distribution warehouses problem Sarhan, Akram Y. B. Melhim, Loai Kayed Jemmali, Mahdi El Ayeb, Faycel Alharbi, Hadeel Banjar, Ameen PeerJ Comput Sci Algorithms and Analysis of Algorithms 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 [Image: see text] , 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. PeerJ Inc. 2023-10-04 /pmc/articles/PMC10588704/ /pubmed/37869458 http://dx.doi.org/10.7717/peerj-cs.1582 Text en © 2023 Sarhan et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
spellingShingle | Algorithms and Analysis of Algorithms Sarhan, Akram Y. B. Melhim, Loai Kayed Jemmali, Mahdi El Ayeb, Faycel Alharbi, Hadeel Banjar, Ameen Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title | Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title_full | Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title_fullStr | Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title_full_unstemmed | Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title_short | Novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
title_sort | novel variable neighborhood search heuristics for truck management in distribution warehouses problem |
topic | Algorithms and Analysis of Algorithms |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10588704/ https://www.ncbi.nlm.nih.gov/pubmed/37869458 http://dx.doi.org/10.7717/peerj-cs.1582 |
work_keys_str_mv | AT sarhanakramy novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem AT bmelhimloaikayed novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem AT jemmalimahdi novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem AT elayebfaycel novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem AT alharbihadeel novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem AT banjarameen novelvariableneighborhoodsearchheuristicsfortruckmanagementindistributionwarehousesproblem |