An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem

Research paper by Jian Lin, Shuai Zhang

Indexed on: 05 May '16Published on: 04 May '16Published in: Computers & Industrial Engineering


Distributed assembly permutation flow-shop scheduling problem (DAPFSP) is widely exists in modern supply chains and manufacturing systems. In this paper, an effective hybrid biogeography-based optimization (HBBO) algorithm that integrates several novel heuristics is proposed to solve the DAPFSP with the objective of minimizing the makespan. Firstly, the path relinking heuristic is employed in the migration phase as product local search strategy to optimize the assembly sequence. Secondly, an insertion-based heuristic is used in the mutation phase to determine the job permutation for each product. Then, a novel local search method is designed based on the problem characteristics and embedded in the HBBO scheme to further improve the most promising individual. Finally, computational simulations on 900 small-sized instances and 810 large-sized instances are conducted to demonstrate the effectiveness of the proposed algorithm, and the new best known solutions for 162 instances are found.

Figure 10.1016/j.cie.2016.05.005.0.jpg
Figure 10.1016/j.cie.2016.05.005.1.jpg
Figure 10.1016/j.cie.2016.05.005.2.jpg
Figure 10.1016/j.cie.2016.05.005.3.jpg
Figure 10.1016/j.cie.2016.05.005.4.jpg
Figure 10.1016/j.cie.2016.05.005.5.jpg
Figure 10.1016/j.cie.2016.05.005.6.jpg
Figure 10.1016/j.cie.2016.05.005.7.jpg
Figure 10.1016/j.cie.2016.05.005.8.jpg