Routing order pickers in a warehouse with a middle aisle |
| |
| Affiliation: | 1. Universidade Federal de Minas Gerais, Departamento de Ciência da Computação, Belo Horizonte, Brazil;2. Brunel University, Mathematical Sciences, Uxbridge, Middlesex, UK;1. Department of Engineering and Architecture, University of Parma, Viale G.P. Usberti 181/A, 43124 Parma, Italyn;2. Logistics division, NUMBER 1 Logistics Group S.p.A., Via Paradigna 110/A, 43122 Parma, Italy;1. Universidade Federal de Minas Gerais, Departamento de Ciência da Computação, Av. Antônio Carlos, 6627. 31270-901, Belo Horizonte, Brazil;2. Brunel University, Mathematical Sciences, Kingston Lane, Uxbridge, UB8 3PH, United Kingdom |
| |
| Abstract: | This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every aisle and also at a cross aisle halfway along the aisles. An algorithm is presented that can find shortest order picking tours in this type of warehouses. The algorithm is applicable in warehouse situations with up to three aisle changing possibilities. Average tour length is compared for warehouses with and without a middle aisle. It appears that in many cases the average order picking time can be decreased significantly by adding a middle aisle to the layout. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
