The problem of finding efficient orderpicking routes is studied for both conventional warehouses, where pickers have a central depot for picking up and depositing carts and pick lists, and modern warehouses, where orderpicking trucks can pick up and deposit pallets at the head of every aisle without returning to the depot. Such environments can be found in many warehouses where paperless picking is performed from pallet locations with pickers having mobile terminals receiving instructions one by one. In order to find orderpicking routes with a minimal length in both the situations of a central depot or decentralized depositing, the well-known polynomial algorithm of Ratliff and Rosenthal (1983) that considered warehouses with a central depot is extended. In practice, the problem is mainly solved by using the so-called S-shape heuristic in which orderpickers move in a S-shape curve along the pick locations. The performance of the new algorithm and the S-shape heuristic are compared in three realistic orderpicking systems.

algorithms, heuristics, optimization, orderpicking, routing, statistical analysis, stuedies, warehouses
hdl.handle.net/1765/11845
ERIM Top-Core Articles
IIE Transactions
Erasmus Research Institute of Management

de Koster, M.B.M, & van der Poort, E. (1998). Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions. IIE Transactions, 469–480. Retrieved from http://hdl.handle.net/1765/11845