A new mathematical programming formulation for the single-picker routing problem
From MaRDI portal
Publication:323113
DOI10.1016/j.ejor.2016.02.018zbMath1346.90175OpenAlexW2276677420MaRDI QIDQ323113
Meike Stuhlmann, André Scholz, Sebastian Henn, Gerhard Wäscher
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.018
Related Items (19)
An integrated model to improve ergonomic and economic performance in order picking by rotating pallets ⋮ Inventory routing in a warehouse: the storage replenishment routing problem ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Order batching using an approximation for the distance travelled by pickers ⋮ Optimally solving the joint order batching and picker routing problem ⋮ Order batching problems: taxonomy and literature review ⋮ Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses ⋮ Energy minimizing order picker forklift routing problem ⋮ Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems ⋮ Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm ⋮ Unnamed Item ⋮ A discrete cross aisle design model for order-picking warehouses ⋮ 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 ⋮ An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses ⋮ Exact algorithms for the order picking problem ⋮ On solving the order processing in picking workstations ⋮ Modeling Single-Picker Routing Problems in Classical and Modern Warehouses ⋮ An extensible multi-block layout warehouse routing optimization model
Cites Work
- Compact formulations of the Steiner traveling salesman problem and related problems
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- A comparative analysis of several asymmetric traveling salesman problem formulations
- An analytical comparison of different formulations of the travelling salesman problem
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Tabu search heuristics for the order batching problem in manual order picking systems
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- Order batching in walk-and-pick order picking systems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Some Simple Applications of the Travelling Salesman Problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Routing methods for warehouses with multiple cross aisles
- Solution of a Large-Scale Traveling-Salesman Problem
- Routing order pickers in a warehouse with a middle aisle
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Unnamed Item
This page was built for publication: A new mathematical programming formulation for the single-picker routing problem
