Loading...
Please wait, while we are loading the content...
Similar Documents
EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING
| Content Provider | Scilit |
|---|---|
| Author | Charkhgard, H. Savelsbergh, M. |
| Copyright Year | 2015 |
| Description | 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. |
| Related Links | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/680A237A0B82F4BA38C39D5A77D02D28/S1446181115000140a.pdf/div-class-title-efficient-algorithms-for-travelling-salesman-problems-arising-in-warehouse-order-picking-div.pdf |
| Ending Page | 174 |
| Page Count | 9 |
| Starting Page | 166 |
| ISSN | 14461811 |
| e-ISSN | 14468735 |
| DOI | 10.1017/s1446181115000140 |
| Journal | The Anziam Journal |
| Issue Number | 2 |
| Volume Number | 57 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2015-10-01 |
| Access Restriction | Open |
| Subject Keyword | The Anziam Journal Cybernetical Science Primary 90b06 Secondary 11y16 Order Batching Order Picking Picker Routing Travelling Salesman Problem Minimum Spanning Tree Problem |
| Content Type | Text |
| Resource Type | Article |
| Subject | Mathematics |
