A novel approach for modeling order picking paths

DOI10.1002/nav.21966MaRDI QIDQ6076484

Kevin R. Gue, Alice E. Smith, Unnamed Author

Publication date: 17 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21966

zbMATH Keywords

computational geometry; visibility graph; routing; shortest path problem; warehouse design

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

A computational software system to design order picking warehouses

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• Using a TSP heuristic for routing order pickers in warehouses
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• On a routing problem
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Shortest path methods: A unifying approach
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Efficient Algorithms for Shortest Paths in Sparse Networks
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Routing methods for warehouses with multiple cross aisles
• A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
• Shortest paths synthesis for a car-like robot
• Optimizing fishbone aisles for dual‐command operations in a warehouse
• Routing order pickers in a warehouse with a middle aisle