PERFORMANCE COMPARISON OF META-HEURISTICS FOR THE MULTIBLOCK WAREHOUSE ORDER PICKING PROBLEM

Basit Öğe Kaydı
dc.authoridToy, Ayhan Özgür/0000-0003-1603-6860|Duzgit, Zehra/0000-0003-0686-1672
dc.authorwosidToy, Ayhan Özgür/F-2155-2017
dc.contributor.authorDuzgit, Zehra
dc.contributor.authorToy, Ayhan Ozgur
dc.contributor.authorSaner, Ahmet Can
dc.date.accessioned2024-07-18T20:52:07Z
dc.date.available2024-07-18T20:52:07Z
dc.date.issued2021
dc.departmentİstanbul Bilgi Üniversitesien_US
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 bestknown 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.en_US
dc.identifier.endpage91en_US
dc.identifier.issn1072-4761
dc.identifier.issn1943-670X
dc.identifier.issue1en_US
dc.identifier.startpage75en_US
dc.identifier.urihttps://hdl.handle.net/11411/8523
dc.identifier.volume28en_US
dc.identifier.wosWOS:000711725400005en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherUniv Cincinnati Industrial Engineeringen_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.subjectOrder Pickingen_US
dc.subjectPicker Routingen_US
dc.subjectMultiblock Warehouseen_US
dc.subjectMeta-Heuristicen_US
dc.subjectTabu Searchen_US
dc.subjectİterated Greedy Algorithmen_US
dc.subjectAnt Colony Optimizationen_US
dc.subjectGenetic Algorithmen_US
dc.subjectRouting Policiesen_US
dc.subjectTravel Distanceen_US
dc.subjectDesignen_US
dc.subjectSingleen_US
dc.subjectAssignmenten_US
dc.subjectPickersen_US
dc.subjectStorageen_US
dc.subjectSolveen_US
dc.titlePERFORMANCE COMPARISON OF META-HEURISTICS FOR THE MULTIBLOCK WAREHOUSE ORDER PICKING PROBLEMen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Web of Science Indexed Publications