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

DOI10.1007/S00291-021-00663-8MaRDI QIDQ2152010zbMATH OpenOpenAlexFDO

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

Publication date 6 July 2022

Published in OR Spectrum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Benders decompositiondynamic programmingorder pickingroutingstorage assignmentU-shaped pick area

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Exact algorithms for the order picking problem
• scientific article; zbMATH DE number 1189262
• 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
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems

Cites work

• A branch and bound algorithm for class based storage location assignment
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
• 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 worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• An algorithm for dynamic order-picking in warehouse operations
• An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• 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
• Ergonomic workplace design in the fast pick area
• Exact algorithms for the order picking problem
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mixed-width aisle configurations for order picking in distribution centers
• On the capacitated vehicle routing problem
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Planning and Scheduling by Logic-Based Benders Decomposition
• Research on warehouse operation: a comprehensive review
• 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 effect of warehouse cross aisles on order picking efficiency
• The theory of dynamic programming
• Using a TSP heuristic for routing order pickers in warehouses

Cited in

(2)

• The Study of Depot Position Effect on Travel Distance in Order Picking Problem
• Locating charging stations and routing drones for efficient automated stocktaking

This page was built for publication: New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot

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