Parallel variable neighborhood search for the min–max order batching problem

DOI10.1111/itor.12309zbMath1366.90130OpenAlexW2549531087MaRDI QIDQ5278230

Jesús Sánchez-Oro, Borja Menéndez, Abraham Duarte, Eduardo G. Pardo

Publication date: 13 July 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12309

zbMATH Keywords

general variable neighborhood searchparallel variable neighborhood searchmin-max order batching problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Related Items (11)

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 ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Order batching problems: taxonomy and literature review ⋮ A parallel variable neighborhood search approach for the obnoxious p‐median problem ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ 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 ⋮ Warehousing in the e-commerce era: a survey ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ On solving the order processing in picking workstations

Uses Software

• CUDA

Cites Work

• Unnamed Item
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Variable neighborhood search for the vertex separation problem
• Variable neighborhood search
• Algorithms for on-line order batching in an order picking warehouse
• The parallel variable neighborhood search for the \(p\)-median problem
• Tabu search heuristics for the order batching problem in manual order picking systems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
• Parallel Strategies for Meta-Heuristics
• Efficient orderbatching methods in warehouses
• Routing methods for warehouses with multiple cross aisles
• Parallel Metaheuristics
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE

This page was built for publication: Parallel variable neighborhood search for the min–max order batching problem