An improved evolutionary algorithm to sequence operations on an ASRS warehouse

Abstract

This paper describes the hybridization of an evolutionary algorithm with a greedy algorithm to solve a job-shop problem with recirculation. We model a real problem that arises within the domain of loads’ dispatch inside an automatic warehouse. The evolutionary algorithm is based on random key representation. It is very easy to implement and allows the use of conventional genetic operators for combinatorial optimization problems. A greedy algorithm is used to generate active schedules. This constructive algorithm reads the chromosome and decides which operation is scheduled next. This option increases the efficiency of the evolutionary algorithm. The algorithm was tested using some instances of the real problem and computational results are presented.