GRASP with variable neighborhood descent for the online order batching problem
type: Item
instance of: scholarly article
title: GRASP with variable neighborhood descent for the online order batching problem
zbMATH Open document ID: 1465.90045
author: Sergio Gil-Borrás
author: Eduardo G. Pardo
author: Antonio Alonso-Ayuso
author: Abraham Duarte
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7340730
zbMATH Keywords: warehouse management
zbMATH Keywords: online order batching problem
zbMATH Keywords: order batching
zbMATH Keywords: turnover time
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: s10898-020-00910-2
OpenAlex ID: W3026000362
cites work: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
cites work: Efficient orderbatching methods in warehouses
cites work: Design and control of warehouse order picking: a literature review
cites work: Q4495285
cites work: Multi-objective variable neighborhood search: an application to combinatorial optimization problems
cites work: Parallel variable neighbourhood search strategies for the cutwidth minimization problem
cites work: Greedy randomized adaptive search procedures
cites work: Research on warehouse design and performance evaluation: a comprehensive review
cites work: Variable neighborhood search: Principles and applications
cites work: Variable neighbourhood search: methods and applications
cites work: Algorithms for on-line order batching in an order picking warehouse
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 for the order batching and sequencing problem
cites work: Variable neighborhood search strategies for the order batching problem
cites work: General variable neighborhood search applied to the picking process in a warehouse
cites work: Parallel variable neighborhood search for the min–max order batching problem
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
cites work: Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
cites work: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
cites work: On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
cites work: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
DOI: 10.1007/S10898-020-00910-2
description: scientific article; zbMATH DE number 7340730