生物地理学算法求解柔性作业车间调度问题  

Solving flexible Job-Shop scheduling problem based on biogeography-based optimization algorithm

作　　者：张国辉[1] 聂黎[2] 毛学港 

机构地区：[1]郑州航空工业管理学院管理科学与工程学院,郑州450015 [2]上海第二工业大学机电工程学院,上海201209 [3]郑州市科学技术局,郑州450007

出　　处：《计算机应用研究》2014年第4期1005-1008,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61203179);国家教育部人文社会科学研究青年基金资助项目(12YJC630285)

摘　　要：针对柔性作业车间调度问题,对生物地理学优化算法中的迁移操作和突变操作进行改进,提出一种改进的生物地理学优化算法。在算法初始阶段采用混合初始化的方法,提高初始种群质量;对迁移操作和突变操作采用不同选择方法,提高算法全局搜索能力,加快收敛速度。通过编程仿真对柔性作业车间调度问题标准测试算例进行运算,并与其他文献中的计算结果进行比较,验证了该算法是可行和有效的,也可用于其他车间调度问题中。For the flexible Job-Shop scheduling problem （FJSP）, this paper proposed the improved biogeography-based opti- mization algorithm （BBO） , modified the migration operator and mutation operator. In the initial stage of the algorithm, it a- dopted hybrid initialization approach to improve the quality of the initialization population. Then it used different methods of migration operator and mutation operator to improve the ability of global search and to accelerate the convergence speed. By programming and simulation to solve the benchmark problem of FJSP, it compared results with the other results in the litera- ture. Computational results show that the proposed BBO algorithm is an effective and efficient approach and can also be used for other shop scheduling problems.

关 键 词：生物地理学优化算法 柔性作业车间调度问题 智能优化算法 迁移操作 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]