The picking and packing problem in buy-online-pick-up-in-store retailing

DOI10.1007/978-3-031-08623-6_36MaRDI QIDQ6606673zbMATH OpenFDO

Authors Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Jafar Jamal, Roberto Montemanni

Publication date 17 September 2024

zbMATH Keywords

mathematical programmingin-store order picking and packingomnichannel grocery retailing

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
• Optimally solving the joint order batching and picker routing problem
• Modelling and solving the joint order batching and picker routing problem in inventories
• Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies
• Optimal in-store fulfillment policies for online orders in an omni-channel retail environment

Cites work

• An enhanced Ant Colony System for the Sequential Ordering Problem

This page was built for publication: The picking and packing problem in buy-online-pick-up-in-store retailing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606673)