Resumen
Order Batching is an optimization problem related to the picking process of orders in a warehouse. It consists in grouping the orders (each order is composed by a list of items to be collected) received in a warehouse in a set of batches of a maximum fixed capacity. Then, a route to collect the items in the same batch must be conformed. In this paper we tackle a variant of this problem known as Order Batching and Sequencing Problem where each order has a certain due date. This variant consists in grouping the orders into batches and then sequencing them, in such a way that the tardiness of each order (the extra time over the due date needed to collect it) is minimized. In this paper we propose a Variable Neighborhood Search algorithm to tackle the problem. Our approach outperforms previous attempts in the state of the art.
Eduardo García Pardo
Catedrático de Universidad
Miembro fundador del grupo de investigación GRAFO, cuya línea de investigación principal es el desarrollo de algoritmos para abordar problemas de optimización, temática sobre la que versa la Tesis Doctoral del investigador y en la que se enmarcan sus publicaciones más destacadas.
Abraham Duarte
Catedrático de Universidad
Mi carrera investigadora se ha centrado en el desarrollo de nuevos algoritmos y técnicas de Inteligencia Computacional (metaheurísticas) y su aplicación a diferentes problemas en Ciencia e Ingeniería desde que me incorporé a la Universidad Rey Juan Carlos (URJC) en el octubre del año 2000.