Variable neighborhood search strategies for the order batching problem
type: Item
instance of: scholarly article
title: Variable neighborhood search strategies for the order batching problem
zbMATH Open document ID: 1391.90663
author: Borja Menéndez
author: Eduardo G. Pardo
author: Antonio Alonso-Ayuso
author: Elisenda Molina
author: Abraham Duarte
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 6901318
zbMATH Keywords: order batching problem
zbMATH Keywords: picking process
zbMATH Keywords: variable neighborhood search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2016.01.020
OpenAlex ID: W2287925039
cites work: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
cites work: Efficient orderbatching methods in warehouses
cites work: Q4495285
cites work: Design and control of warehouse order picking: a literature review
cites work: Multi-objective variable neighborhood search: an application to combinatorial optimization problems
cites work: Q4198056
cites work: Q4354785
cites work: Research on warehouse operation: a comprehensive review
cites work: Research on warehouse design and performance evaluation: a comprehensive review
cites work: Variable neighbourhood search: methods and applications
cites work: Tabu search heuristics for the order batching problem in manual order picking systems
cites work: A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
cites work: General variable neighborhood search applied to the picking process in a warehouse
cites work: Variable neighborhood search
cites work: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Routing methods for warehouses with multiple cross aisles
cites work: A comparison of heuristics for the problem of batching orders for warehouse selection
DOI: 10.1016/J.COR.2016.01.020
Recommended article: General variable neighborhood search for the order batching and sequencing problem
Recommended article: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
Recommended article: A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
Recommended article: Parallel variable neighborhood search for the min–max order batching problem
Recommended article: Variable neighborhood search for the linear ordering problem
Recommended article: GRASP with variable neighborhood descent for the online order batching problem
Recommended article: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Recommended article: Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
Recommended article: Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
Recommended article: Variable neighborhood search for the travelling deliveryman problem
description: scientific article; zbMATH DE number 6901318