Batch picking in narrow-aisle order picking systems with consideration for picker blocking.

*(English)*Zbl 1253.90009Summary: We develop strategies to control picker blocking that challenge the traditional assumptions regarding the tradeoffs between wide- and narrow-aisle order picking systems. We propose an integrated batching and sequencing procedure called the indexed batching model (IBM), with the objective of minimizing the total retrieval time (the sum of travel time, pick time and congestion delays). The IBM differs from traditional batching formulations by assigning orders to indexed batches, whereby each batch corresponds to a position in the batch release sequence. We develop a mixed integer programming solution for exact control, and demonstrate a simulated annealing procedure to solve large practical problems. Our results indicate that the proposed approach achieves a 5-15% reduction in the total retrieval time primarily by reducing picker blocking. We conclude that the IBM is particularly effective in narrow-aisle picking systems.

##### MSC:

90-08 | Computational methods for problems pertaining to operations research and mathematical programming |

90B30 | Production models |

90B06 | Transportation, logistics and supply chain management |

##### Keywords:

facilities planning and design; distribution center; order picking; batching and sequencing
PDF
BibTeX
Cite

\textit{S. Hong} et al., Eur. J. Oper. Res. 221, No. 3, 557--570 (2012; Zbl 1253.90009)

Full Text:
DOI

##### References:

[1] | Aarts, E.; Lenstra, J.K., Local search in combinatorial optimization, (2003), Princeton University Press New Jersey · Zbl 1106.90002 |

[2] | Bartholdi, J.J.; Eisenstein, D.D., A production line that balances itself, Operations research, 44, 1, 21-34, (1996) · Zbl 0847.90063 |

[3] | Clarke, G.; Wright, J.W., Scheduling of vehicles from a central depot to a number of delivery points, Operations research, 12, 568-581, (1964) |

[4] | De Koster, R.; Van der Poort, E.S.; Wolters, M., Efficient orderbatching methods in warehouses, International journal of production research, 37, 7, 1479-1504, (1999) · Zbl 0948.90508 |

[5] | De Koster, R.; Yu, M., Minimizing makespan and throughput times at aalsmeer flower auction, The journal of the operational research society, 59, 9, 1182-1190, (2008) · Zbl 1153.91447 |

[6] | Gademann, N.; Van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse, IIE transactions, 37, 1, 63-75, (2005) |

[7] | Gademann, N.; Van den Berg, J.; Van der Hoff, H., An order batching algorithm for wave picking in a parallel-aisle warehouse, IIE transactions, 33, 5, 385-398, (2001) |

[8] | Gong, Y.; De Koster, R., A polling-based dynamic order picking system for online retailers, IIE transactions, 40, 11, 1070-1082, (2008) |

[9] | Gue, K.R.; Meller, R.D.; Skufca, J.D., The effects of Pick density on order picking areas with narrow aisles, IIE transactions, 38, 10, 859-868, (2006) |

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

[11] | Ho, Y.C.; Tseng, Y.Y., A study on order-batching methods of order-picking in a distribution centre with two cross-aisles, International journal of production research, 44, 17, 3391-3417, (2006) · Zbl 1094.90505 |

[12] | Hong, S.; Johnson, A.L.; Peters, B.A., Analysis of picker blocking in narrow-aisle batch picking, () · Zbl 1253.90009 |

[13] | Hong, S.; Johnson, A.L.; Peters, B.A., Large-scale order batching in parallel-aisle picking systems, IIE transactions, 44, 2, 88-106, (2012) |

[14] | Hsu, C.M.; Chen, K.Y.; Chen, M.C., Batching orders in warehouses by minimizing travel distance with genetic algorithms, Computers in industry, 56, 2, 169-178, (2005) |

[15] | Law, A.M.; Kelton, W.D., Simulation modeling and analysis, (2000), McGraw-Hill Boston |

[16] | Napolitano, M., Sitting tight - 2008 warehouse/DC operations survey results, Logistics management, 47, 11, 47-50, (2008) |

[17] | Napolitano, M., Real DC stories: low cost deep impact, Logistics management, 48, 1, 46-49, (2009) |

[18] | Pan, C.H.; Liu, S.Y., A comparative study of order batching algorithms, Omega, 23, 6, 691-700, (1995) |

[19] | Parikh, P.J.; Meller, R.D., A note on worker blocking in narrow-aisle order picking systems when Pick time is non-deterministic, IIE transactions, 42, 6, 392-404, (2010) |

[20] | Petersen, C.G., An evaluation of order picking policies for mail order companies, Production and operations management, 9, 4, 319-335, (2000) |

[21] | Pinedo, M., Scheduling: theory, algorithms, and systems, (1995), Prentice Hall Englewood Cliffs, NJ · Zbl 1145.90393 |

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

[23] | Ruben, R.A.; Jacobs, F.R., Batch construction heuristics and storage assignment strategies for walk/ride and Pick systems, Management science, 45, 4, 575-596, (1999) · Zbl 1231.90054 |

[24] | Won, J.; Olafsson, S., Joint order batching and order picking in warehouse operations, International journal of production research, 43, 7, 1427-1442, (2005) · Zbl 1068.90011 |

[25] | Zhang, M.; Batta, R.; Nagi, R., Modeling of workflow congestion and optimization of flow routing in a manufacturing/warehouse facility, Management science, 55, 2, 267-280, (2009) · Zbl 1232.90161 |

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.