基于蜻蜓算法求解柔性流水车间排产优化问题  

Flexible flow-shop scheduling problem based on dragonfly algorithm

作　　者：孙树琪 陈书宏[1,2,3] SUN Shuqi;CHEN Shuhong(Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang Liaoning 110169,China;University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院沈阳自动化研究所,沈阳110016 [2]中国科学院机器人与智能制造创新研究院,沈阳110169 [3]中国科学院大学,北京100049

出　　处：《计算机应用》2020年第S01期37-40,共4页journal of Computer Applications

摘　　要：针对柔性流水车间调度问题(FFSP),提出一种离散化的蜻蜓算法。鉴于蜻蜓算法在连续优化问题上表现出色,为了将其应用到离散的组合优化问题上,采用工件升序排列(ROV)的编码方式,将连续位置矢量转换成工件的序列,解码过程采用最先空闲机器优先原则(FAMFR),将每个蜻蜓个体转化为可行调度,从而能够计算出其总完工时间。这两个改进使该算法适用于求解FFSP。最后将该算法应用于FFSP实例进行验证,与遗传算法(GA)进行对比,实验结果表明该算法减少了8.5%的所需加工时间,验证了它求解FFSP的有效性。In order to solve the Flexible Flow shop Scheduling Problem(FFSP),a discretized dragon algorithm was proposed. In view of the outstanding performance of dragonfly algorithm on continuous optimization problems,it was now applied to the discrete optimization problems. This new algorithm adopted the Ranked Order Value(ROV)coding method,converted the continuous position vector into a sequence of jobs,and a decoding method using First Available Machine First Rule(FAMFR),converted each dragonfly individual into a feasible schedule and calculated its total completion time. These two improvements make the algorithm suitable for solving FFSP. Finally,the algorithm was applied to a FFSP instance.Compared with the Genetic Algorithm(GA),the experimental results show that the proposed algorithm reduces the required processing time by 8. 5%,which verifies the effectiveness of the algorithm for solving FFSP.

关 键 词：柔性流水车间问题调度 蜻蜓算法 解码方法 最大完工时间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]