A new mathematical programming formulation for the single-picker routing problem
From MaRDI portal
Recommendations
Cites work
- A New Formulation for the Travelling Salesman Problem
- 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
- Compact formulations of the Steiner traveling salesman problem and related problems
- Design and control of warehouse order picking: a literature review
- Integer Programming Formulation of Traveling Salesman Problems
- Order batching in walk-and-pick order picking systems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- 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
- Solution of a Large-Scale Traveling-Salesman Problem
- Some Simple Applications of the Travelling Salesman Problem
- Tabu search heuristics for the order batching problem in manual order picking systems
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Traveling salesman problem, theory and applications.
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Cited in
(22)- Locating charging stations and routing drones for efficient automated stocktaking
- scientific article; zbMATH DE number 7686970 (Why is no real title available?)
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
- An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
- Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
- Inventory routing in a warehouse: the storage replenishment routing problem
- Optimally solving the joint order batching and picker routing problem
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- Exact algorithms for the order picking problem
- On solving the order processing in picking workstations
- A discrete cross aisle design model for order-picking warehouses
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
- Order batching problems: taxonomy and literature review
- Energy minimizing order picker forklift routing problem
- Using a TSP heuristic for routing order pickers in warehouses
- 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
- An extensible multi-block layout warehouse routing optimization model
- Order batching using an approximation for the distance travelled by pickers
This page was built for publication: A new mathematical programming formulation for the single-picker routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323113)
