Order picking in an automatic warehouse: Solving online asymmetric TSPs
From MaRDI portal
Publication:1304425
DOI10.1007/s001860050064zbMath1009.90037OpenAlexW2063778862MaRDI QIDQ1304425
Atef Abdel-Aziz Abdel-Hamid, Norbert Ascheuer, Martin Grötschel
Publication date: 4 June 2000
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860050064
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Production models (90B30)
Related Items
Research on warehouse operation: a comprehensive review ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Genetic algorithm and its performance analysis for scheduling a single crane ⋮ Integrated scheduling of handling equipment at automated container terminals ⋮ A polyhedral study of the asymmetric traveling salesman problem with time windows ⋮ A survey of literature on automated storage and retrieval systems
