A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
From MaRDI portal
Publication:1681522
DOI10.1016/j.ejor.2017.06.056zbMath1375.90066OpenAlexW2732893316MaRDI QIDQ1681522
Sergej Kramer, Michael Schneider, Ivan Žulj
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.06.056
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (20)
Evaluating the benefits of picking and packing planning integration in e-commerce warehouses ⋮ Stream data load prediction for resource scaling using online support vector regression ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ 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 ⋮ Wave order picking under the mixed-shelves storage strategy: a solution method and advantages ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Local branching relaxation heuristics for integer linear programs ⋮ Order batching problems: taxonomy and literature review ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination ⋮ Warehousing in the e-commerce era: a survey ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ A matheuristic for AGV scheduling with battery constraints ⋮ Order batching and batch sequencing in an AMR-assisted picker-to-parts system ⋮ Short-term scheduling of production fleets in underground mines using CP-based LNS
Cites Work
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Design and control of warehouse order picking: a literature review
- A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
- Algorithms for on-line order batching in an order picking warehouse
- Future paths for integer programming and links to artificial intelligence
- 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
- Rich routing problems arising in supply chain management
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- 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-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
- Efficient orderbatching methods in warehouses
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
- Handbook of metaheuristics
This page was built for publication: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
