A Modified honey bees mating optimization algorithm for assembly line balancing problem

According to the characteristics of assembly line balancing problem, a modified honey bees mating optimization (MHBMO) algorithm was proposed to solve this problem. In this algorithm, the precedence matrix of tasks is proposed to apply the coding method based on the sequence of tasks. The initial feasible population was generated by a binary tree method, and a modified crossover operator and three neighborhood structures were used to keep solutions feasible. In order to enhance the balance of between intensification and diversification, a simulated annealing algorithm was utilized as a local optimization method. Finally, experimental results validate the effectiveness of the proposed algorithm.