Using a TSP heuristic for routing order pickers in warehouses

DOI10.1016/j.ejor.2009.01.036zbMath1177.90044OpenAlexW3122244527WikidataQ110086558 ScholiaQ110086558MaRDI QIDQ1044093

Birger Raa, Christophe Theys, Olli Bräysy, 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

zbMATH Keywords

routing order picking warehousing logistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (33)

An integrated model to improve ergonomic and economic performance in order picking by rotating pallets ⋮ Inventory routing in a warehouse: the storage replenishment routing problem ⋮ An algorithm for dynamic order-picking in warehouse operations ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Picker routing in rectangular mixed shelves warehouses ⋮ Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing ⋮ Spatial and temporal optimization for smart warehouses with fast turnover ⋮ Order batching using an approximation for the distance travelled by pickers ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ Wave order picking under the mixed-shelves storage strategy: a solution method and advantages ⋮ A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ Optimally solving the joint order batching and picker routing problem ⋮ A novel approach for modeling order picking paths ⋮ Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses ⋮ Energy minimizing order picker forklift routing problem ⋮ Optimization of order-picking problems by intelligent optimization algorithm ⋮ Utilizing individual picker skills to improve order batching in a warehouse ⋮ Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems ⋮ Order batching and order picking with 3D positioning of the articles: solution through a hybrid evolutionary algorithm ⋮ Exact results for the order picking time distribution under return routing ⋮ Necessity and complexity of order picking routing optimisation based on pallet loading features ⋮ A polling-based dynamic order-picking system considering priority orders ⋮ A discrete cross aisle design model for order-picking warehouses ⋮ Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse ⋮ Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review ⋮ An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses ⋮ Exact algorithms for the order picking problem ⋮ The multiple shortest path problem with path deconfliction ⋮ Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ Randomized heuristics for the family traveling salesperson problem ⋮ Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories ⋮ An extensible multi-block layout warehouse routing optimization model

Uses Software

Cites Work

This page was built for publication: Using a TSP heuristic for routing order pickers in warehouses