General variable neighborhood search for the order batching and sequencing problem

DOI10.1016/j.ejor.2017.05.001zbMath1380.90053OpenAlexW2610897102MaRDI QIDQ1695017

Manuel Bustillo, Eduardo G. Pardo, Abraham Duarte, Borja Menéndez

Publication date: 6 February 2018

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.05.001

zbMATH Keywords

metaheuristicsvariable neighborhood searchwarehousingorder batching and sequencing problem

Mathematics Subject Classification ID

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

Related Items (8)

A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices ⋮ Spatial and temporal optimization for smart warehouses with fast turnover ⋮ 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 ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Order batching problems: taxonomy and literature review ⋮ Warehousing in the e-commerce era: a survey ⋮ GRASP with variable neighborhood descent for the online order batching problem

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Variable neighborhood search strategies for the order batching problem
• Algorithms for on-line order batching in an order picking warehouse
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Tabu search heuristics for the order batching problem in manual order picking systems
• Minimizing Total Tardiness on One Machine is NP-Hard
• Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
• Efficient orderbatching methods in warehouses
• Routing methods for warehouses with multiple cross aisles
• Parallel variable neighborhood search for the min–max order batching problem
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE

This page was built for publication: General variable neighborhood search for the order batching and sequencing problem