An evaluation of several combinations of routing and storage location assignment policies for the order batching problem

BAHÇECİ U., ÖNCAN T.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.60, no.19, pp.5892-5911, 2022 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 60 Issue: 19
  • Publication Date: 2022
  • Doi Number: 10.1080/00207543.2021.1973684
  • Journal Name: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Page Numbers: pp.5892-5911
  • Keywords: Warehouse design, order batching, picking routing, storage policies, PICKING, WAREHOUSE, PICKERS, DESIGN
  • Galatasaray University Affiliated: Yes

Abstract

In this work, we address the Order Batching Problem (OBP) and we devise tailor-made Mixed Integer Linear Programming (MILP) formulations of the OBP considering composite, largest gap and optimum routing policies, for the first time. We also introduce a novel picker routing policy named as mixed policy which combines the properties of both midpoint and return routing policies. Then, we perform extensive computational experiments with MILP formulations of the OBP considering several combinations of routing and storage policies under different operating conditions on randomly generated test instances. Finally, we present several managerial insights based on the computational results.