A memetic algorithm for the integral OBP/OPP problem in a logistics distribution center

Abstract: In this paper, we present a new decision-making tool aimed at improving the efficiency of the operational planning of pick-up processes in logistic distribution centers. It is based on a memetic algorithm (MA) solving both the Order Batching Problem (OBP) and the Order Picking Problem (OPP). The result yields a sequence of simultaneous pick up operations of lots for different clients in a storing facility, satisfying a previously defined distribution plan. The objective is the minimization of the operational cost of the entire process, which is directly proportional to the time spent on different activities involved. The failure to satisfy the conditions, either leads to overstocking, delays in delivery or creates inefficiency costs. The analysis of the results obtained with our algorithmic tool indicates that it has a good performance in comparison with other known algorithms used to solve this kind of problem.

How to cite this paper

 Miguel, F., Frutos, M., Tohmé, F & Rossit, D. (2019). A memetic algorithm for the integral OBP/OPP problem in a logistics distribution center.Uncertain Supply Chain Management, 7(2), 203-214.

Refrences

Arora, R., Haleem, A., & Farooquie, J. (2017). Impact of critical success factors on successful technology implementation in Consumer Packaged Goods (CPG) supply chain. Management Science Letters, 7(5), 213-224.
Biswas, T., & Das, M. (2018). Selection of hybrid vehicle for green environment using multi-attributive border approximation area comparison method. Management Science Letters, 8(2), 121-130.
Chen, M. C., & Wu, H. P. (2005). An association-based clustering approach to order batching considering customer demand patterns. Omega, 33(4), 333-343.
De Koster, M. B., Van Der Poort, E. S., & Wolters, M. (1999). Efficient order batching methods in warehouses. International Journal of Production Research, 7(37), 1479 - 1504.
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.
Henn, S., Koch, S., & Wäscher, G. (2012). Order batching in order picking warehouses: a survey of solution approaches. In Warehousing in the global supply chain (pp. 105-137). Springer, London.
Henn, S., & Wäscher, G. (2012). Tabu search heuristics for the order batching problem in manual order picking systems. European Journal of Operational Research, 222(3), 484-494.
Henn, S., Koch, S., Doerner, K., Strauss, C., & Wäscher, G. (2010). Metaheuristics for the order batching problem in manual order picking systems. Business Research, 3(1), 82 - 105.
Ho, Y. C., & Tseng, Y. Y. (2006). 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 - 3471.
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan Press.
Hwang, H., & Kim, D. (2005). Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system. European Journal of Operational Research, 43(17), 3657–3670.
Janaki, D., Izadbakhsh, H., & Hatefi, S. (2018). The evaluation of supply chain performance in the Oil Products Distribution Company, using information technology indicators and fuzzy TOPSIS technique. Management Science Letters, 8(8), 835-848.
Lam, C. H., Choy, K. L., Ho, G. T., & Lee, C. K. (2014). An order-picking operations system for managing the batching activities in a warehouse. International Journal of Systems Science, 45(6), 1283-1295.
Menéndez, B., Pardo, E. G., Alonso-Ayuso, A., Molina, E. & Duartea A. (2017). Variable neighborhood search strategies for the order batching problem. Computers and Operations Research, 78(1), 500-512.
Öncan, T. (2015). MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. Journal of Operational Research, 243(1), 142-155.
Petersen, C. G. (1997). An evaluation of order picking routeing policies. International Journal of Operations & Production Management, 17(11), 1098-1111.
Rana, K. (1991). Order-picking in narrow-aisle warehouse. International Journal of Physical Distribution and Logistics Management, 20(2), 9-15.
Theys, C., Bräysy, O., Dullaert, W., & Raa, B. (2010). Using a TSP heuristic for routing order pickers in warehouses. European Journal of Operational Research, 200(3), 755-763.
Tsai, C. Y., Liou, J. J., & Huang, T. M. (2008). Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. International Journal of Production Research, 46(22), 6533-6555.
Wetzel, A. (1983). Evaluation of the effectiveness of genetic algorithms in combinatorial optimization. Pittsburgh, Philadelphia, USA: University of Pittsburgh.
Zulj, I., Kramer, S., & Schneider, M. (2018). A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. European Journal of Operational Research, 264(2), 653-664.