首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求解置换流水车间调度问题的布谷鸟算法
引用本文:刘长平,叶春明.求解置换流水车间调度问题的布谷鸟算法[J].上海理工大学学报,2013,35(1):17-20.
作者姓名:刘长平  叶春明
作者单位:上海理工大学 管理学院,上海200093;淮阴工学院 经济管理学院,淮安223001;上海理工大学 管理学院,上海200093
基金项目:国家自然科学基金资助项目(71271138);教育部人文社会科学规划基金资助项目(10YJA630187);上海市教委科研创新重点资助项目(12ZS133);高校博士点专项科研基金资助项目(20093120110008);上海市重点学科建设资助项目(S30504)
摘    要:分析了布谷鸟算法的优化机理和特点,针对最小化最大完工时间的置换流水车间调度问题,采用基于最小位置值规则的随机键编码方式,应用布谷鸟算法进行求解.通过选取的标准算例对算法进行了仿真测试,并与萤火虫算法和粒子群算法进行对比,测试结果表明了该算法求解置换流水车间调度问题的有效性和优越性.该方法可作为解决流水线生产调度问题的一种有效方法.

关 键 词:置换流水车间调度  布谷鸟算法  优化机理  最大完工时间

Cuckoo Search Algorithm for the Problem of Permutation Flow Shop Scheduling
LIU Changping and YE Chunming.Cuckoo Search Algorithm for the Problem of Permutation Flow Shop Scheduling[J].Journal of University of Shanghai For Science and Technology,2013,35(1):17-20.
Authors:LIU Changping and YE Chunming
Institution:1(1.Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)(2.College of Economics and Management,Huaiyin Institute of Technology,Huaian 223001,China)
Abstract:Being inspired by the breeding behavior such as brood parasitism of cuckoos,the cuckoo search(CS) was proposed as a novel bionic swarm intelligence optimization method.The optimization mechanism and characteristics of CS were analyzed.Then,the proposed search strategy was applied to solve the minimization of makespan for the problem of permutation flow shop scheduling,adopting the code rule of randomized key representation based on the smallest position value.Comparing with the firefly algorithm and particle swarm optimization,simulation results of benchmark instances validate the efficiency and superiority of CS.
Keywords:permutation flow shop scheduling  cuckoo search  optimization mechanism  makespan
本文献已被 CNKI 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号