基于改进的布谷鸟算法求解流水车间调度问题

Solving Flow Shop Scheduling Problem Based on Improved Cuckoo Algorithms

针对基本的布谷鸟算法在求解流水车间调度问题时存在搜索能力差、收敛速度慢的缺点,提出了一种高斯扰动的布谷鸟搜索算法(GCS)。该算法不仅增加了鸟窝移动的活力,还改善了搜索能力差的情况。仿真实验结果表明,改进的布谷鸟算法在求解流水车间调度问题上具有良好的优化性能,要优于基本的布谷鸟算法。

Aiming at the shortcomings of the basic cuckoo algorithm in solving flow shop scheduling problems,such as poor search ability and slow convergence speed,a new cuckoo search algorithm based on Gauss perturbation (GCS) is proposed. This algorithm not only increases the vitality of bird’s nest movement,but also improves the poor search ability. The simulation results show that the improved cuckoo algorithm has good optimization performance in solving flow shop scheduling problems,and is superior to the basic cuckoo algorithm.