Variable neighborhood search strategies for the order batching problem

DOI10.1016/J.COR.2016.01.020zbMath1391.90663OpenAlexW2287925039MaRDI QIDQ1652118

Elisenda Molina, Antonio Alonso-Ayuso, Abraham Duarte, Borja Menéndez, Eduardo G. Pardo

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.020

zbMATH Keywords

variable neighborhood searchorder batching problempicking process

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (14)

Inventory routing in a warehouse: the storage replenishment routing problem ⋮ Storage assignment and order batching problem in Kiva mobile fulfilment system ⋮ 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 ⋮ An efficient and general approach for the joint order batching and picker routing problem ⋮ Hybrid variable neighborhood search for automated warehouse scheduling ⋮ Order batching problems: taxonomy and literature review ⋮ The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store ⋮ General variable neighborhood search for the order batching and sequencing problem ⋮ A variable neighborhood search approach for the vertex bisection problem ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm ⋮ On solving the order processing in picking workstations

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• Research on warehouse operation: a comprehensive review
• Design and control of warehouse order picking: a literature review
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems
• Variable neighbourhood search: methods and applications
• Research on warehouse design and performance evaluation: a comprehensive review
• Variable neighborhood search
• Tabu search heuristics for the order batching problem in manual order picking systems
• General variable neighborhood search applied to the picking process in a warehouse
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• A comparison of heuristics for the problem of batching orders for warehouse selection
• 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
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE

This page was built for publication: Variable neighborhood search strategies for the order batching problem