Simulated Annealing Genetic Algorithm and its Application in Mixed-Model Assembly Line Design

Simple genetic algorithm has shortcomings of poor local search ability and premature convergence. To overcome these disadvantages, simulated annealing algorithm which has good local search ability was combined with genetic algorithm to form simulated annealing genetic algorithm. The tests by two commonly used test functions of Shaffer’s F6 and Rosenbrock show that simulated annealing genetic algorithm outperforms the simple genetic algorithm both in convergence rate and convergence quality. Finally, the simulated annealing genetic algorithm was firstly applied in a practical problem of balancing and sequencing design of mixed-model assembly line, once again, the solution results show that simulated annealing genetic algorithm outperforms the simple genetic algorithm. Meanwhile, it provides a new algorithm for solving the design problem of mixed-model assembly line.