scholarly journals Order picking with multiple pickers and due dates – Simultaneous solution of Order Batching, Batch Assignment and Sequencing, and Picker Routing Problems

2017 ◽  
Vol 263 (2) ◽  
pp. 461-478 ◽  
Author(s):  
André Scholz ◽  
Daniel Schubert ◽  
Gerhard Wäscher
Keyword(s):  
Order Picking ◽  
Due Dates ◽  
Simultaneous Solution ◽  
Routing Problems ◽  
Order Batching

scholarly journals EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING

2015 ◽  
Vol 57 (2) ◽  
pp. 166-174 ◽  
Author(s):  
H. CHARKHGARD ◽  
M. SAVELSBERGH
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Linear Time ◽  
Optimal Solution ◽  
Efficient Algorithms ◽  
Order Picking ◽  
Travelling Salesman ◽  
Routing Problems ◽  
Parallel Lines

We investigate two routing problems that arise when order pickers traverse an aisle in a warehouse. The routing problems can be viewed as Euclidean travelling salesman problems with points on two parallel lines. We show that if the order picker traverses only a section of the aisle and then returns, then an optimal solution can be found in linear time, and if the order picker traverses the entire aisle, then an optimal solution can be found in quadratic time. Moreover, we show how to approximate the routing cost in linear time by computing a minimum spanning tree for the points on the parallel lines.

Sign in / Sign up

Export Citation Format

Share Document