Order picking in an automatic warehouse: Solving online asymmetric TSPs
type: Item
instance of: scholarly article
title: Order picking in an automatic warehouse: Solving online asymmetric TSPs
zbMATH Open document ID: 1009.90037
author: Norbert Ascheuer
author: Martin Grötschel
author: Atef Abdel-Aziz Abdel-Hamid
published in: Mathematical Methods of Operations Research
publication date: 2000-06-04T00:00:00Z
review text: The authors present a joint project with industry that has the aim to sequence transportation request within an automatic storage system in such a way that the overall travel time is minimized. They solve this problem by determining an optimal solution of the asymmetric traveling salesman problem on a directed graph that they have defined. Because the manufacturing environment is such that scheduling decisions have to be made before all jobs are known, it is an online optimization problem. Since the authors consider today's theory of online optimization far from being satisfactory, they decided to use simulation to compare different solution approaches. Based on these comparisons, the authors designed and implemented an optimization package that reduced the unload travel time by about 40\%.
reviewed by: Eleonor Ciurea
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1339792
zbMATH Keywords: automatic storage system
zbMATH Keywords: asymmetric traveling salesman problem
zbMATH Keywords: online optimization problem
MaRDI profile type: Publication
full work available at URL: s001860050064
OpenAlex ID: W2063778862
DOI: 10.1007/S001860050064
description: scientific article; zbMATH DE number 1339792