作者: Kees Jan Roodbergen , René de Koster
DOI: 10.1016/S0377-2217(00)00177-6
关键词:
摘要: This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every and also cross halfway along aisles. An algorithm is presented that find shortest picking tours in this type warehouses. The applicable warehouse situations with up to three changing possibilities. Average tour length compared for warehouses without middle aisle. It appears many cases average time be decreased significantly by adding layout.