Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
From MaRDI portal
Publication:2835664
DOI10.1007/978-3-319-45587-7_8zbMath1432.90023OpenAlexW2515780291MaRDI QIDQ2835664
Alexandre Salles da Cunha, John E. Beasley, Cristiano Arbex Valle
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_8
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
An efficient and general approach for the joint order batching and picker routing problem, Optimally solving the joint order batching and picker routing problem, Order batching problems: taxonomy and literature review, Exact algorithms for the order picking problem
Uses Software
Cites Work
- Compact formulations of the Steiner traveling salesman problem and related problems
- Design and control of warehouse order picking: a literature review
- 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
- Tabu search heuristics for the order batching problem in manual order picking systems
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- 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
- Efficient orderbatching methods in warehouses
- Routing methods for warehouses with multiple cross aisles
- 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
