A MEMETIC ALGORITHM FOR THE INTEGRAL OBP/OPP PROBLEM IN A LOGISTICS DISTRIBUTION CENTER
FABIO MIGUEL; MARIANO FRUTOS; FERNANDO TOHMÉ; DANIEL A. ROSSIT
Uncertain Supply Chain Management
Año: 2019 vol. 7 p. 203 - 203
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.