Resolución de los problemas Order Batching / Picking a través de un Algoritmo Evolutivo

Abstract

In this paper, an evolutionary algorithm is proposed to solve the Order Batching Problem and the Order Picking Problem in a combined way. This combined problem consists of picking and batching multiple order items for different customers simultaneously from a storage area and given a time frame for completion of assembling each order according to a distribution plan. The aim is to determine the plan that minimizes the total cost of the picking process, which will be directly proportional to the travel time in the storage area, the time to pick up each item and unload it in the dispatch area, and the punctuality in the assembly of each order, in the sense that anticipation or delay will entail costs due to inefficiency in the use of space or due to non-compliance with the distribution plan. From the analysis of the results achieved, when comparing them with other results extracted from the literature, a good performance of the algorithm proposed in this work is observed.