Route planning of stacker by improved genetic algorithm

摘要

By the improved adaptive of genetic algorithm, the genetic operators that have adaptability at any time can be obtained, and the premature convergence problem of the traditional genetic algorithm have been overcomed. Then, the location of each storage in the warehouse has been defined by the serial number method, and the model of stacker to pick has been established. Finally, the adaptive genetic algorithm has been adopted to improve the initial path and get the optimal solution. In addition, a simulation has been conducted by the Matlab Genetic Algorithms Box to show that this algorithm is more quickly and efficiently.