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

改进混沌烟花算法的多目标调度优化研究
引用本文:包晓晓,叶春明,计磊,黄霞. 改进混沌烟花算法的多目标调度优化研究[J]. 计算机应用研究, 2016, 33(9)
作者姓名:包晓晓  叶春明  计磊  黄霞
作者单位:上海理工大学 管理学院,上海理工大学 管理学院,上海理工大学 管理学院,上海理工大学 管理学院
基金项目:国家自然科学基金资助项目(71271138);上海市教育委员会科研创新项目(12ZS133);上海市一流学科项目(S1201YLXK);上海理工大学人文社科攀登计划项目(14XPB01)
摘    要:为满足生产中的不同需求,以最小化完成时间、最小化工件总延期时间、最小化机器总空闲时间为目标函数,建立多目标优化模型。提出一种改进混沌烟花算法,通过逻辑自映射产生混沌序列避免算法陷入局部最优,并设计了一种双元锦标赛与动态淘汰制相结合的帕累托非劣解集的构造方法。通过对六个不同规模标准问题的仿真测试,验证了该算法在求解多目标作业车间问题时具有较高求解精度和稳定性。

关 键 词:作业车间调度   多目标优化   烟花算法   帕累托非劣解集   混沌搜索
收稿时间:2015-05-18
修稿时间:2016-07-27

Improved chaotic firework algorithm for multi-objective scheduling optimization
BAO Xiao-xiao,YE Chun-ming,JI Lei and HUANG Xia. Improved chaotic firework algorithm for multi-objective scheduling optimization[J]. Application Research of Computers, 2016, 33(9)
Authors:BAO Xiao-xiao  YE Chun-ming  JI Lei  HUANG Xia
Affiliation:Business School,University of Shanghai for Science Technology,Business School,University of Shanghai for Science Technology,Business School,University of Shanghai for Science Technology,Business School,University of Shanghai for Science Technology
Abstract:In order to meet the different needs of the production, a multi-objective optimization model was built with the objective of minimizing the completion time, the jobs delay time, the machine idle time. An improved chaotic fireworks algorithm was proposed to solve this model. In this algorithm, the self-logical mapping function was introduced to enhance the local search ability, and the set of the Pareto dominance solutions was generated by using the method of a binary tournament and the dynamical elimination process. Finally, the algorithm presents highly accuracy and robustness on solving the multi-objective job-shop scheduling problem.
Keywords:job-shop scheduling   multi-objective optimization   firework algorithm   Pareto dominance   chaos search
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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