求解区间数分布式流水线调度的混合离散果蝇优化算法
CSTR:
作者:
作者单位:

(清华大学自动化系,北京100084)

作者简介:

王凌(1972-), 男, 教授, 博士生导师, 从事智能优化调度理论与方法的研究; 郑洁(1995-), 女, 博士生, 从事智能优化不确定调度的研究.王晶晶(1995-), 女, 博士生, 从事智能问道那我经不确定调度研究.

通讯作者:

E-mail: wangling@tsinghua.edu.cn.

中图分类号:

TP8

基金项目:

国家重点研发计划项目(2016YFB0901900);国家自然科学基金项目(61873328);国家杰出青年科学基金项目(61525304).


A hybrid discrete fruit fly optimization algorithm for distributed permutation flowshop scheduling with interval data
Author:
Affiliation:

(Department of Automation,Tsinghua University,Beijing 100084,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    分布式调度是制造系统领域的前沿研究,而不确定调度问题的研究更具现实意义.针对不确定分布式置换流水线调度问题,采用区间数表示工序加工时间,以最小化区间最大完工时间为目标,利用问题特性在果蝇优化框架内提出一种混合离散果蝇优化算法.首先,通过改进启发式方法和随机方法混合初始化种群;然后,基于概率协同多搜索操作执行嗅觉搜索.为了平衡算法的全局探索与局部开发能力,设计基于学习机制的双种群协同搜索环节.为了进一步提升种群性能,针对优良解设计基于切换机制的双模式局部搜索.基于大量算例的仿真结果与统计对比,表明所提出算法能更有效求解区间数分布式流水线调度问题.

    Abstract:

    Distributed scheduling is the frontier research in the field of manufacturing systems, while the study on the uncertain scheduling problems is of more realistic significance. For the uncertain distributed permutation flowshop scheduling problem, interval processing times are used and the minimization of interval maximum completion time is considered as the objective. To solve the problem, a hybrid discrete fruit fly optimization algorithm is proposed with the framework of the fruit fly optimization by using the characteristics of the problem. Firstly, an improved heuristic and the random method are used in a hybrid way to initialize the population. Then, probabilistic cooperation of multiple search operators is executed as the olfactory search. To balance the exploration and the exploitation capabilities, a learning-based bi-population cooperation scheme is designed. Meanwhile, local intensification search based on a bi-mode switch scheme is applied for the elite solutions for further improvement. Simulation results and statistical comparison with extensive instances show that the proposed algorithm can solve the distributed flowshop scheduling with interval data more effectively.

    参考文献
    相似文献
    引证文献
引用本文

王凌,郑洁,王晶晶.求解区间数分布式流水线调度的混合离散果蝇优化算法[J].控制与决策,2020,35(4):930-936

复制
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2020-03-03
  • 出版日期:
文章二维码