Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing
The advent of e-commerce and omnichannel retailing has sparked renewed interest in picker routing in warehouses. This paper presents two significant methodological advances in this well-established field. First, it is a well-known fact that the parallel-aisle layout of warehouses, as opposed to gene...
Uložené v:
| Vydané v: | European journal of operational research Ročník 321; číslo 3; s. 775 - 788 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
16.03.2025
|
| Predmet: | |
| ISSN: | 0377-2217 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The advent of e-commerce and omnichannel retailing has sparked renewed interest in picker routing in warehouses. This paper presents two significant methodological advances in this well-established field. First, it is a well-known fact that the parallel-aisle layout of warehouses, as opposed to general graphs, allows for polynomial-time solutions of the Traveling Salesman Problem. We show that the parallel-aisle structure can also be exploited when pickers are tasked with visiting storage positions associated with specific due dates. We establish that picker routing in warehouses, subject to soft due date constraints, is a binary NP-hard problem. We also present an exact branch-and-bound algorithm with pseudo-polynomial time complexity. This algorithm effectively solves instances with up to 60 picking positions and five cross aisles within a few seconds while guaranteeing optimality. Second, for even larger pick lists, we demonstrate the successful integration of our algorithm into a real-time framework. This approach allows us to avoid extended solution times that would otherwise delay the picker’s departure, without compromising the quality of the solution. To illustrate the practical relevance of these two methodological innovations, we apply our routing algorithm to the context of pick-from-store omnichannel retailing. By assigning due dates to critical products, we significantly reduce stockout occurrences for online customers. These stockouts occur when the stock level, initially deemed sufficient to confirm an online order, is depleted by walk-in customers before the picker reaches the relevant shelf.
•We consider picker routing in warehouses with soft due dates.•We prove binary NP-hardness.•Our exact branch-and-bound procedure has pseudo-polynomial runtime.•We integrate the algorithm in a real-time framework.•We apply the algorithm to avoid stockouts in omnichannel retail. |
|---|---|
| AbstractList | The advent of e-commerce and omnichannel retailing has sparked renewed interest in picker routing in warehouses. This paper presents two significant methodological advances in this well-established field. First, it is a well-known fact that the parallel-aisle layout of warehouses, as opposed to general graphs, allows for polynomial-time solutions of the Traveling Salesman Problem. We show that the parallel-aisle structure can also be exploited when pickers are tasked with visiting storage positions associated with specific due dates. We establish that picker routing in warehouses, subject to soft due date constraints, is a binary NP-hard problem. We also present an exact branch-and-bound algorithm with pseudo-polynomial time complexity. This algorithm effectively solves instances with up to 60 picking positions and five cross aisles within a few seconds while guaranteeing optimality. Second, for even larger pick lists, we demonstrate the successful integration of our algorithm into a real-time framework. This approach allows us to avoid extended solution times that would otherwise delay the picker’s departure, without compromising the quality of the solution. To illustrate the practical relevance of these two methodological innovations, we apply our routing algorithm to the context of pick-from-store omnichannel retailing. By assigning due dates to critical products, we significantly reduce stockout occurrences for online customers. These stockouts occur when the stock level, initially deemed sufficient to confirm an online order, is depleted by walk-in customers before the picker reaches the relevant shelf.
•We consider picker routing in warehouses with soft due dates.•We prove binary NP-hardness.•Our exact branch-and-bound procedure has pseudo-polynomial runtime.•We integrate the algorithm in a real-time framework.•We apply the algorithm to avoid stockouts in omnichannel retail. |
| Author | Boysen, Nils Bock, Stefan |
| Author_xml | – sequence: 1 givenname: Stefan orcidid: 0000-0002-2838-4785 surname: Bock fullname: Bock, Stefan email: sbock@winfor.de organization: Lehrstuhl für Wirtschaftsinformatik und Operations Research, Bergische Universität Wuppertal, Germany – sequence: 2 givenname: Nils orcidid: 0000-0002-1681-4856 surname: Boysen fullname: Boysen, Nils email: nils.boysen@uni-jena.de organization: Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, Germany |
| BookMark | eNp9kMlOwzAURb0oEm3hB1j5A0iwnVlig8ooVWID68jDS-uQ2JXtIvgA_hunZcWi8sLSve-84S7QzFgDCF1RklJCy5s-hd66lBGWRyEltJihOcmqKmGMVudo4X1PSJRpMUc_93vAigdIrNNgAii80_IDHHZ2H7TZXGNuMHSdlpON4YvLgL0domkN5sMmcmE7TmUK6-Ax3-0GLfnBDvbQLemcHRMfrANsR6PllhsDA3YQuB7ikAt01vHBw-Xfv0Tvjw9vq-dk_fr0srpbJzJrSEigphKqSnSKMUVzocq85NAIJXgjZJfldZEVUjBek5JwQjoRXw4iV01GpCiyJaqPfaWz3jvoWqnDYdXg4iYtJe0UYdu3U4TtFOGkxawiyv6hO6dH7r5PQ7dHCOJRnxpc66cYJSjtQIZWWX0K_wUdP5PX |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2025_02_037 |
| Cites_doi | 10.1287/mnsc.2021.4275 10.1287/opre.2014.1261 10.1016/j.ejor.2020.10.006 10.1016/j.cie.2018.06.015 10.1287/msom.2021.1024 10.1287/ijoc.2021.1060 10.1016/S0167-8116(00)00005-7 10.1287/trsc.2023.1198 10.1016/j.ejor.2015.02.009 10.1007/s10951-016-0481-1 10.1080/00207540110028128 10.1287/ijoc.2023.0075 10.1016/j.orl.2022.01.014 10.1002/nav.21969 10.1016/S0377-2217(00)00177-6 10.1080/24725854.2019.1660833 10.1016/j.ejor.2018.08.023 10.1145/3828.3830 10.1051/ita/1986200100791 10.1287/ijoc.2022.0173 10.1016/j.ijpe.2014.09.029 10.1016/j.ijpe.2019.107564 10.1016/j.ejor.2018.03.042 10.1287/opre.31.3.507 10.1016/j.ejor.2019.11.058 10.1016/j.ijpe.2019.01.037 10.1080/00207543.2020.1724342 10.1086/314323 10.1016/j.ejor.2006.07.009 10.1016/j.cor.2018.07.002 |
| ContentType | Journal Article |
| Copyright | 2024 The Authors |
| Copyright_xml | – notice: 2024 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2024.10.015 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EndPage | 788 |
| ExternalDocumentID | 10_1016_j_ejor_2024_10_015 S0377221724007914 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXKI AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FEDTE FGOYB HVGLF HZ~ LY1 R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c390t-e81ce77bfd22d14bd646ae9bdba9bcf348535cb2a8060a00fbfbf4eb4d930cb53 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001369985800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 05:34:58 EST 2025 Tue Nov 18 22:37:51 EST 2025 Wed Dec 04 16:47:14 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Real-time planning Branch-and-bound Picker routing Warehousing |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c390t-e81ce77bfd22d14bd646ae9bdba9bcf348535cb2a8060a00fbfbf4eb4d930cb53 |
| ORCID | 0000-0002-2838-4785 0000-0002-1681-4856 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2024.10.015 |
| PageCount | 14 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2024_10_015 crossref_primary_10_1016_j_ejor_2024_10_015 elsevier_sciencedirect_doi_10_1016_j_ejor_2024_10_015 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-03-16 |
| PublicationDateYYYYMMDD | 2025-03-16 |
| PublicationDate_xml | – month: 03 year: 2025 text: 2025-03-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – sequence: 0 name: Elsevier B.V |
| References | Tompkins, White, Bozer, Tanchoco (b31) 2010 Žulj, Glock, Grosse, Schneider (b33) 2018; 123 Garey, Johnson (b14) 1979 Roodbergen, De Koster (b27) 2001; 133 Bock, Boysen (b5) 2023; 36 Ratliff, Rosenthal (b25) 1983; 31 Govindarajan, Sinha, Uichanco (b15) 2020; 68 Dechter, Pearl (b11) 1985; 32 Chen, Cheng, Chen, Chan (b8) 2015; 159 Fitzsimons (b13) 2000; 27 Boysen, De Koster, Weidinger (b6) 2019; 277 Bock (b3) 2016; 19 Bock (b2) 2015; 244 Masae, Glock, Grosse (b21) 2020; 224 Afrati, Cosmadakis, Papadimitriou, Papageorgiou, Papakostantinou (b1) 1986; 20 Pansart, Catusse, Cambazard (b24) 2018; 100 MacCarthy, Zhang, Muyldermans (b20) 2019; 211 Masae, Glock, Vichitkunakorn (b23) 2020; 52 Roodbergen, De Koster (b26) 2001; 39 Heßler, Irnich (b17) 2024 De Koster, Le-Duc, Roodbergen (b10) 2007; 182 Saha, Bhattacharya (b28) 2021; 294 Heßler, Irnich (b16) 2022; 50 Silver, Pyke, Peterson (b30) 1998 Chen, Pang, Pan (b9) 2014; 62 Löffler, Boysen, Schneider (b19) 2022; 34 Wahlen, Gschwind (b32) 2023; 57 Cambazard, Catusse (b7) 2018; 270 Degeratu, Rangaswamy, Wu (b12) 2000; 17 Jia, Karp, Ravi, Tayur (b18) 2022; 24 Masae, Glock, Vichitkunakorn (b22) 2020; 58 Bock (b4) 2020; 283 Schiffer, Boysen, Klein, Laporte, Pavone (b29) 2022; 68 Dechter (10.1016/j.ejor.2024.10.015_b11) 1985; 32 Schiffer (10.1016/j.ejor.2024.10.015_b29) 2022; 68 Wahlen (10.1016/j.ejor.2024.10.015_b32) 2023; 57 Fitzsimons (10.1016/j.ejor.2024.10.015_b13) 2000; 27 Cambazard (10.1016/j.ejor.2024.10.015_b7) 2018; 270 Bock (10.1016/j.ejor.2024.10.015_b5) 2023; 36 Chen (10.1016/j.ejor.2024.10.015_b8) 2015; 159 Degeratu (10.1016/j.ejor.2024.10.015_b12) 2000; 17 Boysen (10.1016/j.ejor.2024.10.015_b6) 2019; 277 Masae (10.1016/j.ejor.2024.10.015_b22) 2020; 58 Roodbergen (10.1016/j.ejor.2024.10.015_b27) 2001; 133 Tompkins (10.1016/j.ejor.2024.10.015_b31) 2010 Govindarajan (10.1016/j.ejor.2024.10.015_b15) 2020; 68 Bock (10.1016/j.ejor.2024.10.015_b3) 2016; 19 Chen (10.1016/j.ejor.2024.10.015_b9) 2014; 62 Garey (10.1016/j.ejor.2024.10.015_b14) 1979 Bock (10.1016/j.ejor.2024.10.015_b4) 2020; 283 Ratliff (10.1016/j.ejor.2024.10.015_b25) 1983; 31 Saha (10.1016/j.ejor.2024.10.015_b28) 2021; 294 MacCarthy (10.1016/j.ejor.2024.10.015_b20) 2019; 211 Heßler (10.1016/j.ejor.2024.10.015_b16) 2022; 50 Silver (10.1016/j.ejor.2024.10.015_b30) 1998 Löffler (10.1016/j.ejor.2024.10.015_b19) 2022; 34 Pansart (10.1016/j.ejor.2024.10.015_b24) 2018; 100 Afrati (10.1016/j.ejor.2024.10.015_b1) 1986; 20 Masae (10.1016/j.ejor.2024.10.015_b21) 2020; 224 De Koster (10.1016/j.ejor.2024.10.015_b10) 2007; 182 Heßler (10.1016/j.ejor.2024.10.015_b17) 2024 Roodbergen (10.1016/j.ejor.2024.10.015_b26) 2001; 39 Žulj (10.1016/j.ejor.2024.10.015_b33) 2018; 123 Masae (10.1016/j.ejor.2024.10.015_b23) 2020; 52 Bock (10.1016/j.ejor.2024.10.015_b2) 2015; 244 Jia (10.1016/j.ejor.2024.10.015_b18) 2022; 24 |
| References_xml | – volume: 50 start-page: 155 year: 2022 end-page: 159 ident: b16 article-title: A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing publication-title: Operations Research Letters – volume: 62 start-page: 284 year: 2014 end-page: 300 ident: b9 article-title: Coordinating inventory control and pricing strategies for perishable products publication-title: Operations Research – volume: 52 start-page: 665 year: 2020 end-page: 687 ident: b23 article-title: Optimal order picker routing in the chevron warehouse publication-title: IISE Transactions – volume: 211 start-page: 251 year: 2019 end-page: 264 ident: b20 article-title: Best performance frontiers for buy-online-pickup-in-store order fulfilment publication-title: International Journal of Production Economics – volume: 68 start-page: 779 year: 2020 end-page: 794 ident: b15 article-title: Joint inventory and fulfillment decisions for omnichannel retail networks publication-title: Naval Research Logistics – volume: 133 start-page: 32 year: 2001 end-page: 43 ident: b27 article-title: Routing order pickers in a warehouse with a middle aisle publication-title: European Journal of Operational Research – volume: 270 start-page: 419 year: 2018 end-page: 429 ident: b7 article-title: Fixed-parameter algorithms for rectilinear steiner tree and rectilinear traveling salesman problem in the plane publication-title: European Journal of Operational Research – year: 1979 ident: b14 publication-title: Computers and intractability – volume: 224 year: 2020 ident: b21 article-title: Order picker routing in warehouses: A systematic literature review publication-title: International Journal of Production Economics – volume: 24 start-page: 1650 year: 2022 end-page: 1663 ident: b18 article-title: Effective online order acceptance policies for omnichannel fulfillment publication-title: Manufacturing & Service Operations Management – volume: 294 start-page: 906 year: 2021 end-page: 921 ident: b28 article-title: ‘Buy online and pick up in-store’: Implications for the store inventory publication-title: European Journal of Operational Research – volume: 283 start-page: 863 year: 2020 end-page: 882 ident: b4 article-title: Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios publication-title: European Journal of Operational Research – volume: 100 start-page: 117 year: 2018 end-page: 127 ident: b24 article-title: Exact algorithms for the order picking problem publication-title: Computers & Operations Research – volume: 123 start-page: 338 year: 2018 end-page: 347 ident: b33 article-title: Picker routing and storage-assignment strategies for precedence-constrained order picking publication-title: Computers & Industrial Engineering – volume: 17 start-page: 55 year: 2000 end-page: 78 ident: b12 article-title: Consumer choice behavior in online and traditional supermarkets: The effects of brand name, price, and other search attributes publication-title: International Journal of Research in Marketing – volume: 58 start-page: 5337 year: 2020 end-page: 5358 ident: b22 article-title: Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour publication-title: International Journal of Production Research – volume: 244 start-page: 690 year: 2015 end-page: 703 ident: b2 article-title: Solving the traveling repairman problem on a line with general processing times and deadlines publication-title: European Journal of Operational Research – volume: 68 start-page: 7497 year: 2022 end-page: 7517 ident: b29 article-title: Optimal picking policies in e-commerce warehouses publication-title: Management Science – volume: 32 start-page: 505 year: 1985 end-page: 536 ident: b11 article-title: Generalized best-first search strategies and the optimality of A publication-title: Journal of the ACM – volume: 19 start-page: 527 year: 2016 end-page: 546 ident: b3 article-title: Finding optimal tour schedules on transportation paths under extended time window constraints publication-title: Journal of Scheduling – volume: 277 start-page: 396 year: 2019 end-page: 411 ident: b6 article-title: Warehousing in the e-commerce era: A survey publication-title: European Journal of Operational Research – volume: 20 start-page: 79 year: 1986 end-page: 87 ident: b1 article-title: The complexity of the traveling repairman problem publication-title: Theoretical Informatics and Applications – year: 2024 ident: b17 article-title: Exact solution of the single-picker routing problem with scattered storage publication-title: INFORMS Journal on Computing – volume: 182 start-page: 481 year: 2007 end-page: 501 ident: b10 article-title: Design and control of warehouse order picking: A literature review publication-title: European Journal of Operational Research – volume: 39 start-page: 1865 year: 2001 end-page: 1883 ident: b26 article-title: Routing methods for warehouses with multiple cross aisles publication-title: International Journal of Production Research – year: 2010 ident: b31 article-title: Facilities planning – volume: 36 start-page: 3 year: 2023 end-page: 20 ident: b5 article-title: Routing replenishment workers: The prize collecting Traveling Salesman Problem in scattered storage warehouses publication-title: INFORMS Journal on Computing – volume: 27 start-page: 249 year: 2000 end-page: 266 ident: b13 article-title: Consumer response to stockouts publication-title: Journal of Consumer Research – volume: 31 start-page: 507 year: 1983 end-page: 521 ident: b25 article-title: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem publication-title: Operations Research – year: 1998 ident: b30 publication-title: Inventory management and production planning and scheduling – volume: 57 start-page: 756 year: 2023 end-page: 777 ident: b32 article-title: Branch-price-and-cut-based solution of order batching problems publication-title: Transportation Science – volume: 34 start-page: 440 year: 2022 end-page: 462 ident: b19 article-title: Picker routing in AGV-assisted order picking systems publication-title: INFORMS Journal on Computing – volume: 159 start-page: 158 year: 2015 end-page: 167 ident: b8 article-title: An efficient hybrid algorithm for integrated order batching, sequencing and routing problem publication-title: International Journal of Production Economics – volume: 68 start-page: 7497 issue: 10 year: 2022 ident: 10.1016/j.ejor.2024.10.015_b29 article-title: Optimal picking policies in e-commerce warehouses publication-title: Management Science doi: 10.1287/mnsc.2021.4275 – year: 1998 ident: 10.1016/j.ejor.2024.10.015_b30 – volume: 62 start-page: 284 issue: 2 year: 2014 ident: 10.1016/j.ejor.2024.10.015_b9 article-title: Coordinating inventory control and pricing strategies for perishable products publication-title: Operations Research doi: 10.1287/opre.2014.1261 – volume: 294 start-page: 906 issue: 3 year: 2021 ident: 10.1016/j.ejor.2024.10.015_b28 article-title: ‘Buy online and pick up in-store’: Implications for the store inventory publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.10.006 – volume: 123 start-page: 338 year: 2018 ident: 10.1016/j.ejor.2024.10.015_b33 article-title: Picker routing and storage-assignment strategies for precedence-constrained order picking publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2018.06.015 – volume: 24 start-page: 1650 issue: 3 year: 2022 ident: 10.1016/j.ejor.2024.10.015_b18 article-title: Effective online order acceptance policies for omnichannel fulfillment publication-title: Manufacturing & Service Operations Management doi: 10.1287/msom.2021.1024 – volume: 34 start-page: 440 issue: 1 year: 2022 ident: 10.1016/j.ejor.2024.10.015_b19 article-title: Picker routing in AGV-assisted order picking systems publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2021.1060 – volume: 17 start-page: 55 issue: 1 year: 2000 ident: 10.1016/j.ejor.2024.10.015_b12 article-title: Consumer choice behavior in online and traditional supermarkets: The effects of brand name, price, and other search attributes publication-title: International Journal of Research in Marketing doi: 10.1016/S0167-8116(00)00005-7 – volume: 57 start-page: 756 issue: 3 year: 2023 ident: 10.1016/j.ejor.2024.10.015_b32 article-title: Branch-price-and-cut-based solution of order batching problems publication-title: Transportation Science doi: 10.1287/trsc.2023.1198 – volume: 244 start-page: 690 issue: 3 year: 2015 ident: 10.1016/j.ejor.2024.10.015_b2 article-title: Solving the traveling repairman problem on a line with general processing times and deadlines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.02.009 – volume: 19 start-page: 527 issue: 5 year: 2016 ident: 10.1016/j.ejor.2024.10.015_b3 article-title: Finding optimal tour schedules on transportation paths under extended time window constraints publication-title: Journal of Scheduling doi: 10.1007/s10951-016-0481-1 – volume: 39 start-page: 1865 issue: 9 year: 2001 ident: 10.1016/j.ejor.2024.10.015_b26 article-title: Routing methods for warehouses with multiple cross aisles publication-title: International Journal of Production Research doi: 10.1080/00207540110028128 – year: 2024 ident: 10.1016/j.ejor.2024.10.015_b17 article-title: Exact solution of the single-picker routing problem with scattered storage publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2023.0075 – volume: 50 start-page: 155 issue: 2 year: 2022 ident: 10.1016/j.ejor.2024.10.015_b16 article-title: A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing publication-title: Operations Research Letters doi: 10.1016/j.orl.2022.01.014 – year: 1979 ident: 10.1016/j.ejor.2024.10.015_b14 – volume: 68 start-page: 779 year: 2020 ident: 10.1016/j.ejor.2024.10.015_b15 article-title: Joint inventory and fulfillment decisions for omnichannel retail networks publication-title: Naval Research Logistics doi: 10.1002/nav.21969 – volume: 133 start-page: 32 issue: 1 year: 2001 ident: 10.1016/j.ejor.2024.10.015_b27 article-title: Routing order pickers in a warehouse with a middle aisle publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00177-6 – volume: 52 start-page: 665 issue: 6 year: 2020 ident: 10.1016/j.ejor.2024.10.015_b23 article-title: Optimal order picker routing in the chevron warehouse publication-title: IISE Transactions doi: 10.1080/24725854.2019.1660833 – volume: 277 start-page: 396 issue: 2 year: 2019 ident: 10.1016/j.ejor.2024.10.015_b6 article-title: Warehousing in the e-commerce era: A survey publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.08.023 – volume: 32 start-page: 505 issue: 3 year: 1985 ident: 10.1016/j.ejor.2024.10.015_b11 article-title: Generalized best-first search strategies and the optimality of A∗ publication-title: Journal of the ACM doi: 10.1145/3828.3830 – volume: 20 start-page: 79 issue: 1 year: 1986 ident: 10.1016/j.ejor.2024.10.015_b1 article-title: The complexity of the traveling repairman problem publication-title: Theoretical Informatics and Applications doi: 10.1051/ita/1986200100791 – volume: 36 start-page: 3 issue: 1 year: 2023 ident: 10.1016/j.ejor.2024.10.015_b5 article-title: Routing replenishment workers: The prize collecting Traveling Salesman Problem in scattered storage warehouses publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2022.0173 – volume: 159 start-page: 158 year: 2015 ident: 10.1016/j.ejor.2024.10.015_b8 article-title: An efficient hybrid algorithm for integrated order batching, sequencing and routing problem publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2014.09.029 – volume: 224 year: 2020 ident: 10.1016/j.ejor.2024.10.015_b21 article-title: Order picker routing in warehouses: A systematic literature review publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2019.107564 – year: 2010 ident: 10.1016/j.ejor.2024.10.015_b31 – volume: 270 start-page: 419 issue: 2 year: 2018 ident: 10.1016/j.ejor.2024.10.015_b7 article-title: Fixed-parameter algorithms for rectilinear steiner tree and rectilinear traveling salesman problem in the plane publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.03.042 – volume: 31 start-page: 507 issue: 3 year: 1983 ident: 10.1016/j.ejor.2024.10.015_b25 article-title: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem publication-title: Operations Research doi: 10.1287/opre.31.3.507 – volume: 283 start-page: 863 issue: 3 year: 2020 ident: 10.1016/j.ejor.2024.10.015_b4 article-title: Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.11.058 – volume: 211 start-page: 251 year: 2019 ident: 10.1016/j.ejor.2024.10.015_b20 article-title: Best performance frontiers for buy-online-pickup-in-store order fulfilment publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2019.01.037 – volume: 58 start-page: 5337 issue: 17 year: 2020 ident: 10.1016/j.ejor.2024.10.015_b22 article-title: Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour publication-title: International Journal of Production Research doi: 10.1080/00207543.2020.1724342 – volume: 27 start-page: 249 issue: 2 year: 2000 ident: 10.1016/j.ejor.2024.10.015_b13 article-title: Consumer response to stockouts publication-title: Journal of Consumer Research doi: 10.1086/314323 – volume: 182 start-page: 481 issue: 2 year: 2007 ident: 10.1016/j.ejor.2024.10.015_b10 article-title: Design and control of warehouse order picking: A literature review publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.07.009 – volume: 100 start-page: 117 year: 2018 ident: 10.1016/j.ejor.2024.10.015_b24 article-title: Exact algorithms for the order picking problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2018.07.002 |
| SSID | ssj0001515 |
| Score | 2.4784427 |
| Snippet | The advent of e-commerce and omnichannel retailing has sparked renewed interest in picker routing in warehouses. This paper presents two significant... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 775 |
| SubjectTerms | Branch-and-bound Picker routing Real-time planning Warehousing |
| Title | Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing |
| URI | https://dx.doi.org/10.1016/j.ejor.2024.10.015 |
| Volume | 321 |
| WOSCitedRecordID | wos001369985800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001515 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZWLUJw4LGAKC_5wC2kysOJk2MLRcBhhdQi7S2yHQd2tU1WIVttf0B_AP-YmbWdTR-qAAmtFK2sOLEyn8fj8TczhLxNUhZonIBSyMRnYZj6MhLCV2mqmASdKdNqU2yCTybZdJp_HY1-uViYswWv62y9zpf_VdTQBsLG0Nm_EHf_UGiA_yB0uILY4fpHgv-w0h5u4_0GUxijQbmcIXfCa5tVZyuYwKTWm9wRyATQa4yTdIPyxOI79Ox-nDpiJx4tDM650VrFJ_oYmeIjuVJ7zWmN9HvkzHjthpTqVsSbnP7WAIaG1rkibc6h3jd9aNX0caerLX4Pm3PrMJrMFpccFlGCjC0TT2m8aNciaUz0Fud-FJk4TqeZYxM8bSEYD_QsN-VW7JLNTWXAa6uBcUzM9_W8wdSvEdtHIl-YbNe-npF4jAPA9yOnludYGn034kkOinL34PPR9Eu_vKMFuDmasgO2kViGNHj1TTdbOwML5uQReWC3HvTAQOYxGel6TO66yIcxeegqfFCr8Mfk_iBd5RNyAdCil6BFDbSohdY7KmraA4tugEUdsGgPLLytpAArOoAV7Rp6BVZ0ACvaw-op-fbx6OT9J9-W8fBVnAedr7NQac5lVUZRGTJZpiwVOpelFLlUVczAYkwUaIgsSAMRBJWEH9OSlXkcKJnEz8hO3dT6OaFZmIhQwZ4mUILxgAteiVTGeVpxpVWS7ZHQfe5C2Rz3WGplUTgy47xAERUoImwDEe0Rr--zNBlebr07cVIsrI1qbM8CQHdLvxf_2O8lubedQ6_ITteu9GtyR511s5_tG4vN37YjvfI |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Due+date-oriented+picker+routing%2C+an+efficient+exact+solution+algorithm%2C+and+its+application+to+pick-from-store+omnichannel+retailing&rft.jtitle=European+journal+of+operational+research&rft.au=Bock%2C+Stefan&rft.au=Boysen%2C+Nils&rft.date=2025-03-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.volume=321&rft.issue=3&rft.spage=775&rft.epage=788&rft_id=info:doi/10.1016%2Fj.ejor.2024.10.015&rft.externalDocID=S0377221724007914 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |