Abstract.
We report on a joint project with industry that had the aim to sequence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environment is such that scheduling decisions have to be made before all jobs are known. We have modeled this task as an online Asymmetric Traveling Salesman Problem (ATSP). Several heuristics for the online ATSP are compared computationally within a simulation environment to judge which should be used in practice. Compared to the priority rule used so far, the optimization package reduced the unloaded travel time by about 40%. Because of these significant savings our procedure was implemented as part of the control software for the stacker cranes of the storage systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: November 1998
Rights and permissions
About this article
Cite this article
Ascheuer, N., Grötschel, M. & Abdel-Aziz Abdel-Hamid, A. Order picking in an automatic warehouse: Solving online asymmetric TSPs. Mathematical Methods of OR 49, 501–515 (1999). https://doi.org/10.1007/s001860050064
Issue Date:
DOI: https://doi.org/10.1007/s001860050064