Using a TSP heuristic for routing order pickers in warehouses
From MaRDI portal
Publication:1044093
DOI10.1016/j.ejor.2009.01.036zbMath1177.90044WikidataQ110086558 ScholiaQ110086558MaRDI QIDQ1044093
Olli Bräysy, Birger Raa, Christophe Theys, Wout E. H. Dullaert
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.036
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Uses Software
Cites Work
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- The vehicle routing problem. Latest advances and new challenges.
- A model for warehouse order picking
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Improving product location and order picking activities in a distribution centre
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The traveling salesman problem on a graph and some related integer polyhedra
- Mersenne twister
- The effect of warehouse cross aisles on order picking efficiency
- Routing methods for warehouses with multiple cross aisles
- Routing order pickers in a warehouse with a middle aisle
