双目标流水线调度的动态双子群离散果蝇算法

发布时间：2018-05-01 03:05

本文选题：果蝇优化算法 + 无等待流水线调度问题　；参考：《计算机工程与应用》2017年12期

【摘要】：提出了一种基于动态双子群的离散果蝇优化算法,求解以最大完工时间和机床空闲时间的最小化为目标的无等待流水线调度问题。与传统的果蝇算法不同,该算法采用基于工序的编码方式,并用改进的NEH方法进行初始化,提高初始解的质量;根据算法在进化过程中个体的进化水平,动态地将整个群体划分为先进子群和后进子群,简单但有效地插入方法在先进个体邻域内进化精细搜索,贪婪迭代进化机制用于优化后进个体,以此平衡算法的全局开发能力和局部搜索能力;为了提高算法效率,快速算法用于计算函数目标值和判断更新非支配解。仿真试验表明了所提果蝇算法的有效性和高效性。
[Abstract]:A discrete Drosophila optimization algorithm based on dynamic double subsets is proposed to solve the problem of no-wait pipeline scheduling with the goal of minimizing the maximum completion time and idle time of machine tools. Different from the traditional Drosophila algorithm, the algorithm uses a process-based coding method, and uses an improved NEH method to initialize the initial solution to improve the quality of the initial solution, according to the evolutionary level of the individual in the evolution process of the algorithm. The whole population is dynamically divided into advanced subgroups and backward subgroups. The simple but effective insertion method is applied to fine search in the neighborhood of advanced individuals. Greedy iterative evolution mechanism is used to optimize the backward individuals. In order to improve the efficiency of the algorithm, the fast algorithm is used to calculate the target value of the function and to judge the updated non-dominated solution. Simulation results show that the proposed algorithm is effective and efficient.
【作者单位】：三亚学院信息与智能工程学院;聊城大学计算机学院;
【基金】：国家自然科学基金(No.61573178) 国家青年基金项目(No.61503170) 海南省教育厅科研项目(No.Hnky2015-51,No.Hnky2015-55) 三亚市院地科技合作项目(No.2015YD57,No.2015YD11) 山东省高等学校科技计划项目(No.J14LN28) 海南省自然科学基金(No.617182)
【分类号】：TP18

【相似文献】