Performance comparison of meta-heuristics for the multiblock warehouse order picking problem

Basit Öğe Kaydı
dc.authorscopusid57212212831
dc.authorscopusid14521673500
dc.authorscopusid57295065800
dc.contributor.authorDüzgit, Z.
dc.contributor.authorToy, A.Ö.
dc.contributor.authorSaner, A.C.
dc.date.accessioned2024-07-18T20:17:47Z
dc.date.available2024-07-18T20:17:47Z
dc.date.issued2021
dc.description.abstractThis study focuses on streamlining the order-picking process in a warehouse. We consider determining the picking sequence of items in a pick-list to minimize the total traveled distance in a multiblock warehouse, where a low-level picker-to-parts manual picking system is employed. We assume that the items are stored randomly in the warehouse. First, we construct a distance matrix of the shortest path between any pair of items. Next, using the distance matrix, we implement two meta-heuristics-the tabu search algorithm and the iterated greedy algorithm-to determine the picking sequence with the minimum total traveled distance. Through a numerical study, the performances of the meta-heuristic algorithms are compared with those of popular rule-based heuristics (S-shape, largest gap, and Combined+) and the best-known solutions. We conducted the numerical study in two stages. In the first stage, we considered a two-block rectangular warehouse, and in the second stage, we considered a three-block rectangular warehouse. The performance of the heuristics was calculated based on the optimal solution when available or the best calculated bound when the optimal solution is not available. We observed that the iterated greedy algorithm significantly outperforms the other heuristics for both stages. © 2021 University of Cincinnati. All rights reserved.en_US
dc.identifier.endpage91en_US
dc.identifier.issn1072-4761
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85116961515en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage75en_US
dc.identifier.urihttps://hdl.handle.net/11411/6727
dc.identifier.volume28en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUniversity of Cincinnatien_US
dc.relation.ispartofInternational Journal of Industrial Engineering : Theory Applications and Practiceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectIterated Greedy Algorithmen_US
dc.subjectMeta-Heuristicen_US
dc.subjectMultiblock Warehouseen_US
dc.subjectOrder Pickingen_US
dc.subjectPicker Routingen_US
dc.subjectTabu Searchen_US
dc.subjectOptimal Systemsen_US
dc.subjectRouting Algorithmsen_US
dc.subjectTabu Searchen_US
dc.subjectWarehousesen_US
dc.subjectDistance Matrixen_US
dc.subjectIterated Greedy Algorithmen_US
dc.subjectMetaheuristicen_US
dc.subjectMultiblock Warehouseen_US
dc.subjectMultiblocksen_US
dc.subjectOptimal Solutionsen_US
dc.subjectOrder-Pickingen_US
dc.subjectPerformanceen_US
dc.subjectPerformance Comparisonen_US
dc.subjectPicker Routingen_US
dc.subjectHeuristic Algorithmsen_US
dc.titlePerformance comparison of meta-heuristics for the multiblock warehouse order picking problem
dc.typeArticle

Dosyalar

Koleksiyon

Scopus Indexed Publications