VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
From MaRDI portal
Publication:5850790
DOI10.1142/S0217595909002390zbMath1178.90118OpenAlexW2001242796MaRDI QIDQ5850790
Antonio Alonso-Ayuso, Maria Albareda-Sambola, Elisenda Molina, Clara Simón de Blas
Publication date: 15 January 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595909002390
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (18)
Parallel variable neighborhood search for the min–max order batching problem ⋮ General variable neighborhood search applied to the picking process in a warehouse ⋮ MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem ⋮ 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 ⋮ 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 ⋮ Tabu search heuristics for the order batching problem in manual order picking systems ⋮ 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 ⋮ Utilizing individual picker skills to improve order batching in a warehouse ⋮ General variable neighborhood search for the order batching and sequencing problem ⋮ 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 solving the order processing in picking workstations ⋮ Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
Cites Work
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- Variable neighborhood search
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Order batching algorithms and travel-time estimation for automated storage/retrieval systems
- A comparison of heuristics for the problem of batching orders for warehouse selection
- Variable Neighborhood Search
- Efficient orderbatching methods in warehouses
- Routing methods for warehouses with multiple cross aisles
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
This page was built for publication: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
