Optimally solving the joint order batching and picker routing problem
From MaRDI portal
Publication:1683118
DOI10.1016/j.ejor.2017.03.069zbMath1375.90025arXiv1703.06531OpenAlexW2603290257MaRDI QIDQ1683118
John E. Beasley, Alexandre Salles da Cunha, Cristiano Arbex Valle
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06531
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
Inventory routing in a warehouse: the storage replenishment routing problem, An optimisation approach for the e-grocery order picking and delivery problem, Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane, Picker routing in rectangular mixed shelves warehouses, A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices, Spatial and temporal optimization for smart warehouses with fast turnover, Order batching using an approximation for the distance travelled by pickers, The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem, Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, An efficient and general approach for the joint order batching and picker routing problem, Order batching problems: taxonomy and literature review, The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Warehousing in the e-commerce era: a survey, 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, Order batching and batch sequencing in an AMR-assisted picker-to-parts system, Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Compact formulations of the Steiner traveling salesman problem and related problems
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A new mathematical programming formulation for the single-picker routing problem
- Modeling and solving the mixed capacitated general routing problem
- Design and control of warehouse order picking: a literature review
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Using a TSP heuristic for routing order pickers in warehouses
- A cutting plane procedure for the travelling salesman problem on road networks
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- The traveling salesman problem in graphs with some excluded minors
- Logic cuts for processing networks with fixed charges
- The capacitated arc routing problem: Valid inequalities and facets
- 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
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The traveling salesman problem on a graph and some related integer polyhedra
- A new approach to the maximum-flow problem
- A fundamental problem in vehicle routing
- Dynamic programming and the graphical traveling salesman problem
- Efficient orderbatching methods in warehouses
- Routing methods for warehouses with multiple cross aisles
- Halin graphs and the travelling salesman problem
- An order-picking operations system for managing the batching activities in a warehouse
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
- Routing order pickers in a warehouse with a middle aisle
