Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
From MaRDI portal
Publication:1740491
DOI10.1016/j.ejor.2019.03.012zbMath1430.90144OpenAlexW2921924300MaRDI QIDQ1740491
Katrien Ramaekers, Kris Braekers, An Caris, Teun van Gils
Publication date: 30 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/27968
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Evaluating the benefits of picking and packing planning integration in e-commerce warehouses, New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot, Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, Quantifying the impact of sharing resources in a collaborative warehouse, A deep learning approach for the selection of an order picking system, An efficient and general approach for the joint order batching and picker routing problem, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, Order batching problems: taxonomy and literature review, Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
Uses Software
Cites Work
- Unnamed Item
- A travel time estimation model for a high-level picker-to-part system with class-based storage policies
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A new mathematical programming formulation for the single-picker routing problem
- Using a TSP heuristic for routing order pickers in warehouses
- The vehicle routing problem: An overview of exact and approximate algorithms
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Improving order picking efficiency by analyzing combinations of storage, batching, zoning, and routing policies
- Optimally solving the joint order batching and picker routing problem
- Utilizing individual picker skills to improve order batching in a warehouse
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Tabu search heuristics for the order batching problem in manual order picking systems
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Order sequencing on a unidirectional cyclical picking line
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- The traveling salesman problem on a graph and some related integer polyhedra
- Efficient orderbatching methods in warehouses
- Joint order batching and order picking in warehouse operations
- Routing order pickers in a warehouse with a middle aisle
