Order picking in an automatic warehouse: Solving online asymmetric TSPs | Zendy

Norbert Ascheuer | Zendy; Martin Gr�tschel | Zendy; Atef Abdel-Aziz Abdel-Hamid | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Order picking in an automatic warehouse: Solving online asymmetric TSPs

Author(s) -

Norbert Ascheuer,

Martin Gr�tschel,

Atef Abdel-Aziz Abdel-Hamid

Publication year - 1999

Publication title -

mathematical methods of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.524

H-Index - 48

eISSN - 1432-5217

pISSN - 1432-2994

DOI - 10.1007/s001860050064

Subject(s) - stacker , travelling salesman problem , heuristics , computer science , scheduling (production processes) , software , warehouse , operations research , task (project management) , job shop scheduling , mathematical optimization , algorithm , engineering , schedule , mathematics , operating system , mechanical engineering , systems engineering , marketing , business

We report on a joint project with industry that had the aim to se- quence transportation requests within an automatic storage system in such a way that the overall travel time is minimized. The manufacturing environ- ment is such that scheduling decisions have to be made before all jobs are known. We have modeled this task as an online Asymmetric Traveling Sales- man 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research