摘要
布谷鸟搜索算法是一种新型元启发式优化算法,该算法受到自然界中布谷鸟的巢寄生行为启发而提出。首先分析了布谷鸟搜索算法的仿生原理和数学描述,采用基于工序的编码方式对最小化最大完工时间的作业车间调度问题进行布谷鸟搜索算法求解。通过典型算例进行仿真实验,测试结果表明布谷鸟搜索算法求解作业车间调度问题的可行性和有效性,优于萤火虫算法和基本粒子群算法,是解决生产调度问题的一种有效方法。
Cuckoo Search（CS）is one of the latest nature-inspired metaheuristic algorithm, which is based on the obligate brood parasitism behavior of some cuckoo species. Firstly, this paper analyzes the bionic principle of CS and its mathematical description. The code rule based on sequence is adopted to solve job-shop scheduling problem, whose objective is to minimize the makespan. Then the paper validates the CS algorithm against some typical benchmark instances and compares its performance with those of firefly algorithm and basic particle swarm optimization. Simulations and results show that CS is very effective, superior and promising in solving production scheduling problem.
出处
《计算机工程与应用》
CSCD
北大核心
2015年第5期255-260,265,共7页
Computer Engineering and Applications
基金
国家自然科学基金(No.71271138)
上海市教育委员会科研创新项目(No.12ZS133)
上海市一流学科项目(No.S1201YLXK)
