Mathematical model, heuristics and exact method for order picking in narrow aisles

References

• Bodnar, P., & Lysgaard, J. (2014). A dynamic programming algorithm for the space allocation and aisle positioning problem. Journal of the Operational Research Society, 65(9), 1315–1324.
   Web of Science ®Google Scholar
• Chabot, T., Lahyani, R., Coelho, L. C., & Renaud, J. (2017). Order picking problems under weight, fragility and category constraints. International Journal of Production Research, 55(21), 6361–6379.
   Web of Science ®Google Scholar
• De Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007). Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182(2), 481–501.
   Web of Science ®Google Scholar
• Gademann, A. J. R. M., Van Den Berg, J. P., & Van Der Hoff, H. H. (2001). An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Transactions, 33(5), 385–398.
   Web of Science ®Google Scholar
• Gademann, N., & Velde, S. (2005). Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Transactions, 37(1), 63–75.
   Web of Science ®Google Scholar
• Goetschalckx, M., & Ratliff, D. H. (1988). Order picking in an aisle. IIE Transactions, 20(1), 53–62.
   Web of Science ®Google Scholar
• Gue, K. R., Meller, R. D., & Skufca, J. D. (2006). The effects of pick density on order picking areas with narrow aisles. IIE Transactions, 38(10), 859–868.
   Web of Science ®Google Scholar
• Gu, J., Goetschalckx, M., & McGinnis, L. F. (2007). Research on warehouse operation: A comprehensive review. European Journal of Operational Research, 177(1), 1–21.
   Web of Science ®Google Scholar
• Henn, S., Koch, S., & Wäscher, G. (2012). Order batching in order picking warehouses: A survey of solution approaches. In R. Manzini (Ed.), Warehousing in the Global Supply Chain. London: Springer.
   Google Scholar
• Hong, S., Johnson, A. L., & Peters, B. A. (2012). Batch picking in narrow-aisle order picking systems with consideration for picker blocking. European Journal of Operational Research, 221(3), 557–570.
   Web of Science ®Google Scholar
• Kim, B.-I., Heragu, S. S., Graves, R. J., & St, A. (2003). Onge. Realization of a short cycle time in warehouse replenishment and order picking. International Journal of Production Research, 41(2), 349–364.
   Web of Science ®Google Scholar
• Lysgaard, J. (2003). CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Handelshøjskolen i Århus: Institut for Driftøkonomi og Logistik.
   Google Scholar
• Mowrey, C. H., & Parikh, P. J. (2014). Mixed-width aisle configurations for order picking in distribution centers. European Journal of Operational Research, 232(1), 87–97.
   Web of Science ®Google Scholar
• Muter, \.{I}., & Öncan, T. (2015). An exact solution approach for the order batching problem. IIE Transactions, 47(7), 728–738.
   Web of Science ®Google Scholar
• Öncan, T. (2015). MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. European Journal of Operational Research, 243(1), 142–155.
   Web of Science ®Google Scholar
• Parikh, P. J., & Meller, R. D. (2010). A note on worker blocking in narrow-aisle order picking systems when pick time is non-deterministic. IIE Transactions, 42(6), 392–404.
   Web of Science ®Google Scholar
• Petersen, C. G. (1997). An evaluation of order picking routing policies. International Journal of Operations & Production Management, 17(11), 1098–1111.
   Web of Science ®Google Scholar
• Petersen, C. G. (1999). The impact of routing and storage policies on warehouse efficiency. International Journal of Operations & Production Management, 19(10), 1053–1064.
   Web of Science ®Google Scholar
• Potvin, J.-Y., & Rousseau, J.-M. (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66(3), 331–340.
   Web of Science ®Google Scholar
• Ratliff, H. D., & Rosenthal, A. S. (1983). Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem. Operations Research, 31(3), 507–521.
   Web of Science ®Google Scholar
• Renaud, J., & Ruiz, A. (2008). Improving product location and order picking activities in a distribution centre. Journal of the Operational Research Society, 59(12), 1603–1613.
   Web of Science ®Google Scholar
• Roodbergen, K. J., & de Koster, R. (2001). Routing order pickers in a warehouse with a middle aisle. European Journal of Operational Research, 133(1), 32–43.
   Web of Science ®Google Scholar
• Roodbergen, K. J., Sharp, G. P., & Vis, I. F. A. (2008). Designing the layout structure of manual order picking areas in warehouses. IIE Transactions, 40(11), 1032–1045.
   Web of Science ®Google Scholar
• Roodbergen, K. J., & Vis, I. F. A. (2006). A model for warehouse layout. IIE Transactions, 38(10), 799–811.
   Web of Science ®Google Scholar
• Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.
   Web of Science ®Google Scholar
• Rouwenhorst, B., Reuter, B., Stockrahm, V., Van Houtum, G. J., Mantel, R. J., & Zijm, W. H. M. (2000). Warehouse design and control: Framework and literature review. European Journal of Operational Research, 122(3), 515–533.
   Web of Science ®Google Scholar
• Scholz, A., & Wäscher, G. (2017). Order batching and picker routing in manual order picking systems: The benefits of integrated routing. Central European Journal of Operations Research, 25(2), 491–520.
   Web of Science ®Google Scholar
• Semet, F., Toth, P., & Vigo, D. (2014). Classical exact algorithms for capacited vehicle routing problem. In P. Toth & D. Vigo (Eds.), Vehicle Routing: Problems, Methods, and Applications, Vol. 18. Philadelphia: SIAM.
   Google Scholar
• Shaw, P. (1997). A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group. Glasgow, Scotland, UK: Dept of Computer Science, University of Strathclyde.
   Google Scholar
• Valle, C. A., Beasley, J. E., & da Cunha, A. S. (2017). Optimally solving the joint order batching and picker routing problem. European Journal of Operational Research, 262(3), 817–834.
   Web of Science ®Google Scholar
• Wruck, S., Vis, I. F. A., & Boter, J. (2013). Time-restricted batching models and solution approaches for integrated forward and return product flow handling in warehouses. Journal of the Operational Research Society, 64(10), 1505–1516.
   Web of Science ®Google Scholar