Order batching using an approximation for the distance travelled by pickers
From MaRDI portal
(Redirected from Publication:2178066)
Abstract: In this paper we investigate the problem of order batching for picker routing. Our approach is applicable to warehouses (storage areas) arranged in the standard rectangular grid layout, so with parallel aisles and two or more cross-aisles. The motivation underlying our work is online grocery shopping in which orders may be composed of dozens of items. The approach presented directly addresses order batching, but uses a distance approximation to influence the batching of orders without directly addressing the routing problem. We present a basic formulation based on deciding the orders to be batched together so as to optimise an objective that approximates the picker routing distance travelled. We extend our formulation by improving the approximation for cases where we have more than one block in the warehouse. We present constraints to remove symmetry in order to lessen the computational effort required, as well as constraints that significantly improve the value of the linear programming relaxation of our formulation. A heuristic algorithm based on partial integer optimisation of our mathematical formulation is also presented. Once order batching has been decided we optimally route each individual picker using a previous approach presented in the literature. Extensive computational results for publicly available test problems involving up to 75 orders are given for both single and multiple block warehouse configurations.
Recommendations
- Optimally solving the joint order batching and picker routing problem
- Modelling and solving the joint order batching and picker routing problem in inventories
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- An efficient and general approach for the joint order batching and picker routing problem
- Efficient orderbatching methods in warehouses
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- A new mathematical programming formulation for the single-picker routing problem
- A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
- A Theorem on Boolean Matrices
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Algorithms for on-line order batching in an order picking warehouse
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- An algorithm for dynamic order-picking in warehouse operations
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- 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
- Design and control of warehouse order picking: a literature review
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Efficient orderbatching methods in warehouses
- General variable neighborhood search for the order batching and sequencing problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Optimally solving the joint order batching and picker routing problem
- 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
- Parallel variable neighborhood search for the min-max order batching problem
- Picker routing in rectangular mixed shelves warehouses
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- Routing methods for warehouses with multiple cross aisles
- Routing order pickers in a warehouse with a middle aisle
- Sequencing of picking orders in mobile rack warehouses
- Tabu search heuristics for the order batching problem in manual order picking systems
- Using a TSP heuristic for routing order pickers in warehouses
- Utilizing individual picker skills to improve order batching in a warehouse
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search strategies for the order batching problem
Cited in
(21)- A travel-time model for a person-onboard order picking system
- Optimally solving the joint order batching and picker routing problem
- A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- A mixed integer linear programming model to support e-fulfillment strategies in warehouse-based supermarket chains
- An efficient and general approach for the joint order batching and picker routing problem
- Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- Travel time estimation and order batching in a 2-block warehouse
- Modelling and solving the joint order batching and picker routing problem in inventories
- Order batching in walk-and-pick order picking systems
- Order batching algorithms and travel-time estimation for automated storage/retrieval systems
- A comparison of heuristics for the problem of batching orders for warehouse selection
- Efficient orderbatching methods in warehouses
- The Study of Depot Position Effect on Travel Distance in Order Picking Problem
- A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
- Approximate optimal order batch sizes in a parallel aisle warehouse
- Order batching problems: taxonomy and literature review
- The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
- Solving the multi-block order batching problem with branch-price-and-cut
This page was built for publication: Order batching using an approximation for the distance travelled by pickers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178066)
