Assembly Line Balancing Based on Tabu Search and Genetic Hybrid Algorithm

A tabu search and genetic hybrid algorithm is presented to solve assembly line balancing problem(ALBP).In its genetic algorithm part, special genetic operators(two point crossover and insert mutation) is adopted to scan only in the subspace of those feasible task sequences,which reduces search area and improves algorithm efficiency.In its tabu search part,after evolution of each generation,some random selected individuals execute tabu search,which can improve algorithm search ability.In the end of this paper,the calculating results of several classic problems prove that the tabu search and genetic hybrid algorithm is better than the genetic algorithm in search ability and convergence performance.