A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
type: Item
instance of: scholarly article
title: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
zbMATH Open document ID: 1375.90066
author: Ivan Žulj
author: Sergej Kramer
author: Michael Schneider
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6812065
zbMATH Keywords: logistics
zbMATH Keywords: order batching
zbMATH Keywords: adaptive large neighborhood search
zbMATH Keywords: tabu search
zbMATH Keywords: hybrid metaheuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.06.056
OpenAlex ID: W2732893316
cites work: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
cites work: Order batching in walk-and-pick order picking systems
cites work: Order batching algorithms and travel-time estimation for automated storage/retrieval systems
cites work: Handbook of metaheuristics
cites work: Future paths for integer programming and links to artificial intelligence
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: Batch picking in narrow-aisle order picking systems with consideration for picker blocking
cites work: A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
cites work: Efficient orderbatching methods in warehouses
cites work: Design and control of warehouse order picking: a literature review
cites work: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: Rich routing problems arising in supply chain management
cites work: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
cites work: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
DOI: 10.1016/J.EJOR.2017.06.056
description: scientific article; zbMATH DE number 6812065