Optimally solving the joint order batching and picker routing problem

DOI10.1016/J.EJOR.2017.03.069MaRDI QIDQ1683118zbMATH OpenOpenAlexFDO

Authors Cristiano Arbex Valle, J. E. Beasley, Alexandre Salles da Cunha

Publication date 6 December 2017

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.06531

zbMATH Keywords

integer programminginventory managementorder pickingpicker routingorder batching

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Abstract: In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential number of connectivity constraints and we introduce a significant number of valid inequalities based on the standard layout of warehouses, composed of parallel aisles and two or more cross-aisles. The proposed inequalities are highly effective and greatly improve computational results. Instances involving up to 20 orders are solved to proven optimality when we jointly consider order batching and picker routing. Instances involving up to 5000 orders are considered where order batching is done heuristically, but picker routing is done optimally.

Recommendations

• Modelling and solving the joint order batching and picker routing problem in inventories
• Order batching using an approximation for the distance travelled by pickers
• An efficient and general approach for the joint order batching and picker routing problem
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem

Cites work

• scientific article; zbMATH DE number 2064405 (Why is no real title available?)
• scientific article; zbMATH DE number 2209623 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A cutting plane procedure for the travelling salesman problem on road networks
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• A fundamental problem in vehicle routing
• A new approach to the maximum-flow problem
• A new mathematical programming formulation for the single-picker routing problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• An order-picking operations system for managing the batching activities in a warehouse
• Batch picking in narrow-aisle order picking systems with consideration for picker blocking
• Compact formulations of the Steiner traveling salesman problem and related problems
• Design and control of warehouse order picking: a literature review
• Dynamic programming and the graphical traveling salesman problem
• Efficient orderbatching methods in warehouses
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Halin graphs and the travelling salesman problem
• Logic cuts for processing networks with fixed charges
• Modeling and solving the mixed capacitated general routing problem
• Modelling and solving the joint order batching and picker routing problem in inventories
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Routing methods for warehouses with multiple cross aisles
• Routing order pickers in a warehouse with a middle aisle
• Tabu search heuristics for the order batching problem in manual order picking systems
• The capacitated arc routing problem: Valid inequalities and facets
• The traveling salesman problem in graphs with some excluded minors
• The traveling salesman problem on a graph and some related integer polyhedra
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• Using a TSP heuristic for routing order pickers in warehouses
• Variable neighborhood search for order batching in a warehouse

Cited in

(30)

• A novel approach for modeling order picking paths
• An efficient and general approach for the joint order batching and picker routing problem
• The deterministic product location problem under a pick-by-order policy
• Optimal sequencing of skip collections and deliveries
• Picker routing in rectangular mixed shelves warehouses
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• Spatial and temporal optimization for smart warehouses with fast turnover
• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
• An optimisation approach for the e-grocery order picking and delivery problem
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
• The picking and packing problem in buy-online-pick-up-in-store retailing
• Optimization of vehicle routing with pickup based on multibatch production
• Order batching and batch sequencing in an AMR-assisted picker-to-parts system
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• Inventory routing in a warehouse: the storage replenishment routing problem
• Order batching problems: taxonomy and literature review
• Shared capacity routing problem -- an omni-channel retail study
• A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
• Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
• Warehousing in the e-commerce era: a survey
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
• Order batching using an approximation for the distance travelled by pickers
• Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
• Exact algorithms for the order picking problem
• scientific article; zbMATH DE number 7234287 (Why is no real title available?)
• Modelling and solving the joint order batching and picker routing problem in inventories
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing

Describes a project that uses

Uses Software

• CPLEX
• MySQL

This page was built for publication: Optimally solving the joint order batching and picker routing problem

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