改进混沌烟花算法的多目标调度优化研究-计算机应用研究.PDFVIP

优先出版 计 算 机 应 用 研 究 第33 卷 改进混沌烟花算法的多目标调度优化研究* 1 1 1 1, 2 包晓晓 ，叶春明 ，计 磊 ，黄 霞 (1．上海理工大学 管理学院，上海 200093 ；2 ．江苏科技大学 张家港校区，江苏 苏州 215600) 摘 要：为满足生产中的不同需求，以最小化完成时间、最小化工件总延期时间、最小化机器总空闲时间为目标函数， 建立多目标优化模型。提出一种改进混沌烟花算法，通过逻辑自映射产生混沌序列避免算法陷入局部最优，并设计了一 种双元锦标赛与动态淘汰制相结合的帕累托非劣解集的构造方法。最后用本文所提出的方法求解六个不同规模标准问 题，实验结果表明该算法在求解多目标作业车间问题时具有较高求解精度和稳定性。 关键词：作业车间调度；多目标优化；烟花算法；帕累托非劣解集；混沌搜索 中图分类号：TP181 Improved chaotic firework algorithm for multi-objective scheduling optimization 1 1 1 1, 2 Bao Xiaoxiao , Ye Chunming , Ji Lei , Huang Xia (1. Business School, University of Shanghai for Science Technology, Shanghai 200093, China; 2. College of Zhangjiagang, Jiangsu University of Science Technology, Suzhou Jiangsu 215600, China) Abstract: In order to meet the different needs of the production. this paper proposed a multi-objective optimization model with the objectives of minimizing the completion time. the jobs delay time. and the machine idle time. An improved chaotic fireworks algorithm came forward to solve this model. In this algorithm. it applies the self-logical mapping function to enhance the local search ability. and using the method of a binary tournament and the dynamical elimination process generated the set of the Pareto dominance solutions. Finally. the algorithm presents highly accuracy and robustness on solving the multi-objective job -shop scheduling problem. Key Words: job -shop scheduling; multi-objective optimization; firework algo