Hull assembly line balancing has significant impact on performance of shipbuilding system and is usually a multi-objective optimization problem. In this article, the primary objectives of the hull assembly line balancing are to minimize the number of workstations, to minimize the static load balancing index, to minimize the dynamic load balancing index between workstations, and to minimize the multi-station-associated complexity. Because this problem comes under combinatorial optimization category and is non-deterministic polynomial-time hard, an improved genetic algorithm simulated annealing is presented. In genetic algorithm simulated annealing, the task sequence numbers are used as chromosomes, and selection, crossover, and mutation operators only deal with the elements of task set instead of the ones of the problem space. In order to prevent the algorithm appearing early convergence or getting local optimal result, the simulated annealing algorithm is used to deal with the individuals. Meanwhile, the algorithm is embedded with the hierarchical scheduling tactics in order to solve the selection problem on optimal solution in the Pareto-optimal set. A number of benchmark problems are solved to prove the superior efficiency of the proposed algorithm. Finally, a case study of the optimization of a hull assembly line was given to illustrate the feasibility and effectiveness of the method.
A note on “A multi-objective genetic algorithm for solving assembly line balancing problem”
