Tabu search heuristics for the order batching problem in manual order picking systems
From MaRDI portal
Publication:1926958
DOI10.1016/j.ejor.2012.05.049zbMath1253.90008OpenAlexW1988119270MaRDI QIDQ1926958
Gerhard Wäscher, Sebastian Henn
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.049
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (29)
Parallel variable neighborhood search for the min–max order batching problem ⋮ An integrated model to improve ergonomic and economic performance in order picking by rotating pallets ⋮ MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem ⋮ A new mathematical programming formulation for the single-picker routing problem ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Variable neighborhood search strategies for the order batching problem ⋮ Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing ⋮ A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices ⋮ Picker Routing in AGV-Assisted Order Picking Systems ⋮ 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 ⋮ A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem ⋮ Optimally solving the joint order batching and picker routing problem ⋮ Order batching problems: taxonomy and literature review ⋮ Cost-neutral reduction of infection risk in picker-to-parts warehousing systems ⋮ Energy minimizing order picker forklift routing problem ⋮ Utilizing individual picker skills to improve order batching in a warehouse ⋮ General variable neighborhood search for the order batching and sequencing problem ⋮ Order batching and order picking with 3D positioning of the articles: solution through a hybrid evolutionary algorithm ⋮ 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 ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm ⋮ On solving the order processing in picking workstations ⋮ Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories ⋮ Order batching and batch sequencing in an AMR-assisted picker-to-parts system ⋮ An extensible multi-block layout warehouse routing optimization model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The attribute based hill climber
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- Design and control of warehouse order picking: a literature review
- The impact of order batching and picking area zoning on order picking system performance
- Future paths for integer programming and links to artificial intelligence
- Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
- Order batching in walk-and-pick order picking systems
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- Order batching algorithms and travel-time estimation for automated storage/retrieval systems
- Routing policies and COI-based storage policies in picker-to-part systems
- An Introduction to Tabu Search
- Efficient orderbatching methods in warehouses
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
This page was built for publication: Tabu search heuristics for the order batching problem in manual order picking systems
