Design of a Routing Algorithm for Efficient Order Picking in a Non-traditional Rectangular Warehouse Layout

Basit Öğe Kaydı
dc.authoridDuzgit, Zehra/0000-0003-0686-1672
dc.contributor.authorSancakli, Edin
dc.contributor.authorDumlupinar, Irem
dc.contributor.authorAkcin, Ali Osman
dc.contributor.authorCinar, Ezgi
dc.contributor.authorGeylani, Ipek
dc.contributor.authorDuzgit, Zehra
dc.date.accessioned2024-07-18T20:40:04Z
dc.date.available2024-07-18T20:40:04Z
dc.date.issued2022
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description21st International Symposium on Production Research (ISPR) - Digitizing Production System -- OCT 07-09, 2021 -- ELECTR NETWORKen_US
dc.description.abstractWarehouses have gained considerable attention in recent years, especially due to the increasing interest for e-commerce. Order picking is the process of finding and removing products from a warehouse to fulfil customer orders. Order picking is the most time-consuming and costly operation in manual picker-to-parts warehouses. Order picking problem is similar to Traveling Salesman Problem in the sense that the order picker corresponds to the salesman whereas items to be picked correspond to cities to be visited. Hence, order picking problem is known to be NP-hard. The objective of order picking problem is to minimize total travelled distance of an order picker. For only single-block and two-block traditional rectangular warehouses, optimal picker routing can be found. However, there is no optimal algorithm for three or more block traditional rectangular warehouses. Some popular routing heuristics are applied for single-block and multi-block traditional rectangular warehouses, such as S-Shape, Largest Gap, Aisle-by-aisle, Combined/Combined+ heuristics. In this study, we consider the order picking problem of a merchandising company. The objective of the company is to minimize total travelled distance during order picking which leads to an increase in throughput (the number of picks per time). The warehouse under consideration can be said to be non-traditional rectangular due to its block and aisle configuration. Therefore, order picking heuristics, which are proposed for traditional rectangular warehouses, cannot be directly implemented. Accordingly, we modified popular picker routing heuristics to apply for the non-traditional rectangular warehouse layout. Then, a meta-heuristic algorithm is implemented to obtain the best picking sequence of items and order picking route. Finally, we examined the impact of different storage assignment policies on total travelled distance.en_US
dc.description.sponsorshipSoc Prod Res,TU Wienen_US
dc.identifier.doi10.1007/978-3-030-90421-0_33
dc.identifier.endpage412en_US
dc.identifier.isbn978-3-030-90421-0
dc.identifier.isbn978-3-030-90420-3
dc.identifier.issn2195-4356
dc.identifier.issn2195-4364
dc.identifier.scopus2-s2.0-85119884497en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage401en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-90421-0_33
dc.identifier.urihttps://hdl.handle.net/11411/6965
dc.identifier.wosWOS:000797796900035en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer-Verlag Singapore Pte Ltden_US
dc.relation.ispartofDigitizing Production Systems, Ispr2021en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectOrder Pickingen_US
dc.subjectPicker Routingen_US
dc.subjectWarehouseen_US
dc.subjectRouting Heuristicen_US
dc.subjectMeta-Heuristic Algorithmen_US
dc.subjectStorage Assignmenten_US
dc.titleDesign of a Routing Algorithm for Efficient Order Picking in a Non-traditional Rectangular Warehouse Layouten_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications