General variable neighborhood search applied to the picking process in a warehouse

DOI10.1016/J.ENDM.2014.11.011zbMath1362.90095OpenAlexW1975953818MaRDI QIDQ2631231

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

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.011

zbMATH Keywords

heuristicsVNSorder batching problemGVNS

Mathematics Subject Classification ID

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

Related Items (6)

Variable neighborhood search strategies for the order batching problem ⋮ A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices ⋮ 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 ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ On solving the order processing in picking workstations

Cites Work

• Variable neighborhood search
• 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
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
• Variable neighborhood search: Principles and applications

This page was built for publication: General variable neighborhood search applied to the picking process in a warehouse