New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot

DOI10.1007/s00291-021-00663-8zbMath1493.90023MaRDI QIDQ2152010

Eric H. Grosse, Simon Emde, Heiko Diefenbach, Christoph H. Glock

Publication date: 6 July 2022

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-021-00663-8

zbMATH Keywords

dynamic programming; Benders decomposition; routing; order picking; storage assignment; U-shaped pick area

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming

90B80: Discrete location and assignment

Cites Work

• Unnamed Item
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
• An algorithm for dynamic order-picking in warehouse operations
• A new mathematical programming formulation for the single-picker routing problem
• Research on warehouse operation: a comprehensive review
• Design and control of warehouse order picking: a literature review
• Using a TSP heuristic for routing order pickers in warehouses
• On the capacitated vehicle routing problem
• An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
• Ergonomic workplace design in the fast pick area
• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• Exact algorithms for the order picking problem
• Tabu search heuristics for the order batching problem in manual order picking systems
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
• Mixed-width aisle configurations for order picking in distribution centers
• A branch and bound algorithm for class based storage location assignment
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• The effect of warehouse cross aisles on order picking efficiency
• Routing methods for warehouses with multiple cross aisles
• The theory of dynamic programming
• Routing order pickers in a warehouse with a middle aisle