Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
Date
2023-01-01
Author
Saylam, Serhat
Çelik, Melih
Süral, Haldun
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
89
views
0
downloads
Cite This
Order picking is the most expensive and labor-intensive warehouse activity. The objective of the order picking problem (OPP) is to collect the items on the pick list in a sequence that minimizes the total travel time. While the literature has generally modeled the OPP as a special case of the traveling salesman problem, this paper presents arc routing-based binary integer programming formulations for the OPP in single- and two-block parallel-aisle warehouses, by taking into account the special properties of the graph corresponding to both warehouse layouts. These formulations depend on replacing the subtour elimination constraints with a much smaller number of disconnectivity elimination constraints, which significantly reduces the integrality gap. Our computational experiments show that the proposed formulation solves large instances within significantly short computing times when compared with its counterparts in the literature for single- and two-block parallel-aisle warehouses. The efficiency of these formulations implies that not only can they be used to solve the OPP in a timely manner, but they can also be incorporated into integrated models that consider multiple warehouse decision problems at the operational level. More importantly, when compared to other state-of-the-art formulations, the extensibility of our proposed model makes it an ideal candidate for further research in this field.
Subject Keywords
Lazy constraints
,
Order picking
,
Picker routing
,
Routing
,
Warehouse management
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85171143400&origin=inward
https://hdl.handle.net/11511/105745
Journal
European Journal of Operational Research
DOI
https://doi.org/10.1016/j.ejor.2023.08.018
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Saylam, M. Çelik, and H. Süral, “Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses,”
European Journal of Operational Research
, pp. 0–0, 2023, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85171143400&origin=inward.