EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING

DOI10.1017/S1446181115000140zbMath1331.90010OpenAlexW2262256556MaRDI QIDQ2788859

Savelsbergh, Martin W. P., Hadi Charkhgard

Publication date: 22 February 2016

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446181115000140

zbMATH Keywords

minimum spanning tree problemtravelling salesman problemorder pickingpicker routingorder batching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Energy minimizing order picker forklift routing problem ⋮ COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES

Cites Work

• Design and control of warehouse order picking: a literature review
• Algorithms for on-line order batching in an order picking warehouse
• Travel time analysis for general item location assignment in a rectangular warehouse
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Routing methods for warehouses with multiple cross aisles

This page was built for publication: EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING