模拟退火下布谷鸟算法求解车间作业调度问题  

Modified cuckoo search algorithm for job-shop scheduling problem based on simulated annealing

作　　者：施文章 韩伟[1] 戴睿闻 SHI Wenzhang;HAN Wei;DAI Ruiwen(College of Information Engineering, Nanjing University of Finance & Economics, Nanjing 210046, China;College of Computer Science and Technology, Nanjing University of Technology, Nanjing 210046, China)

机构地区：[1]南京财经大学信息工程学院,南京210046 [2]南京工业大学计算机科学与技术学院,南京210046

出　　处：《计算机工程与应用》2017年第17期249-253,259,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.71372188)

摘　　要：针对车间作业调度问题(JSP),在标准布谷鸟算法的莱维飞行中加入自适应机制,寻优过程中引入二值交叉算子保持改进算法的种群多样性,最后在模拟退火框架下增强改进算法跳出局部最优的能力。通过标准算例对所提的改进算法进行实验仿真,结果证明了改进算法的正确性和有效性。This paper proposes a Modified Cuckoo Search algorithm based on Simulated Annealing(SA-MCS)for the job-shop scheduling problem.Adding the self-adaptive method in the Levy flight makes the step-length changing in the process of algorithm to improve the ability of global and local search.Introducing2values crossover operator keeps the population diversity and makes the algorithm avoiding premature convergence.What is more,the ability of jumping out of local optimum has increased under the framework of simulated annealing.Finally it uses the modified one in job-shop scheduling problem with standard test cases.The results prove the validity and efficiency of proposed algorithm.

关 键 词：车间作业调度 布谷鸟算法 自适应 二值交叉算子 模拟退火 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]