A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices

DOI10.1016/j.ejor.2022.03.056OpenAlexW4225630677MaRDI QIDQ2171595

Yanyan Li

Publication date: 9 September 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.03.056

zbMATH Keywords

variable neighborhood searchlogisticsreal-world problemorder batchingdedicated heterogeneous pick devices

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Order batching problems: taxonomy and literature review ⋮ Variable neighborhood search: the power of change and simplicity

Cites Work

• Unnamed Item
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• Design and control of warehouse order picking: a literature review
• Variable neighborhood search strategies for the order batching 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
• Utilizing individual picker skills to improve order batching in a warehouse
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• General variable neighborhood search for the order batching and sequencing problem
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• Warehousing in the e-commerce era: a survey
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• 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
• Constraint handling in genetic algorithms: the set partitioning problem
• General variable neighborhood search applied to the picking process in a warehouse
• Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems
• The multi-trip vehicle routing problem
• 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
• A comparison of heuristics for the problem of batching orders for warehouse selection
• Efficient orderbatching methods in warehouses
• Vehicle Routeing with Multiple Use of Vehicles
• Parallel variable neighborhood search for the min–max order batching problem
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
• Variable neighborhood search: Principles and applications

This page was built for publication: A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices