Routing order pickers in a warehouse with a middle aisle.

*(English)*Zbl 0989.90025Summary: 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.

PDF
BibTeX
XML
Cite

\textit{K. J. Roodbergen} and \textit{R. de Koster}, Eur. J. Oper. Res. 133, No. 1, 32--43 (2001; Zbl 0989.90025)

Full Text:
DOI

##### References:

[1] | De Koster, R.; Van der Poort, E., Routing orderpickers in a warehouse: A comparison between optimal and heuristic solutions, IIE transactions, 30, 469-480, (1998) |

[2] | Hall, R.W.H., Distance approximations for routing manual pickers in a warehouse, IIE transactions, 25, 4, 76-87, (1993) |

[3] | Little, J.D.C.; Murty, K.G.; Sweeney, D.W.; Karel, C., An algorithm for the traveling salesman problem, Operations research, 11, 972-989, (1963) · Zbl 0161.39305 |

[4] | Petersen, C.G., An evaluation of order picking routeing policies, International journal of operations & production management, 17, 11, 1098-1111, (1997) |

[5] | Ratliff, H.D.; Rosenthal, A.S., Orderpicking in a rectangular warehouse: A solvable case of the traveling salesman problem, Operations research, 31, 507-521, (1983) · Zbl 0523.90060 |

[6] | Tompkins, J.A.; White, J.A.; Bozer, Y.A.; Frazelle, E.H.; Tanchoco, J.M.A.; Trevino, J., Facilities planning, (1996), Wiley New York |

[7] | Vaughan, T.S.; Petersen, C.G., The effect of warehouse cross aisles on order picking efficiency, International journal of production research, 37, 4, 881-897, (1999) · Zbl 0940.90516 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.