A novel approach for modeling order picking paths

DOI10.1002/NAV.21966MaRDI QIDQ6076484zbMATH OpenOpenAlexFDO

Authors Alice E. Smith, Kevin R. Gue

Publication date 17 October 2023

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

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

zbMATH Keywords

computational geometryroutingshortest path problemvisibility graphwarehouse design

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A model for warehouse order picking
• Modelling and solving the joint order batching and picker routing problem in inventories
• A routing method for multiple order pickers with congestion consideration
• Stochastic modeling of multiline orders in integrated <scp>storage‐order</scp> picking system
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
• A travel-time model for a person-onboard order picking system
• An efficient and general approach for the joint order batching and picker routing problem
• An algorithm for dynamic order-picking in warehouse operations
• Optimally solving the joint order batching and picker routing problem

Cites work

• A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• A note on two problems in connexion with graphs
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Efficient Algorithms for Shortest Paths in Sparse Networks
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• On a routing problem
• Optimizing fishbone aisles for dual-command operations in a warehouse
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Routing methods for warehouses with multiple cross aisles
• Routing order pickers in a warehouse with a middle aisle
• Shortest path algorithms: An evaluation using real road networks
• Shortest path methods: A unifying approach
• Shortest paths synthesis for a car-like robot
• Using a TSP heuristic for routing order pickers in warehouses

Cited in

(2)

• A travel-time model for a person-onboard order picking system
• A computational software system to design order picking warehouses

This page was built for publication: A novel approach for modeling order picking paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076484)