基于协同进化的松弛时序约束多服务流程优化  

Multiple service processes optimization with slack temporal constraints based on cooperative coevolution algorithm

作　　者：梁合兰[1] 杜彦华[2] 李苏剑[2] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006 [2]北京科技大学机械工程学院,北京100083

出　　处：《计算机集成制造系统》2015年第8期2213-2227,共15页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(61473035);中央高校基本科研业务费专项资金资助项目(FRF-TP-14-017A2)~~

摘　　要：为满足复杂服务流程优化的需求,提出一种新的松弛时序约束下的多服务流程优化方法。建立了多服务流程优化问题的形式化模型,并通过定义带松弛量的时序约束满足性,为实现时序约束的量化判定及流程优化求解奠定基础。针对问题模型具有搜索规模大且需考虑跨流程间松弛时序协调的难点,提出基于非均衡协作的混合协同进化算法实现模型求解。该算法参考Potter的协同进化框架,设计了基于信息素交叉的子种群进化、非均衡概率的种群间协作及精英迁移等改进策略,有利于提高种群搜索导向性及保持种群多样性。通过与现有方法的多组实验对比,证明了该算法在求解精度及执行时间上的优越性。To meet the requirements of complex service processes application, an optimization approach for multiple processes with slack temporal constraints was proposed. A formal model for multi-processes optimization with slack temporal constraints was designed, and the satisfaction principle on slack temporal constraints was defined, which could lay a foundation for the temporal verification and process optimization. Aiming at the problems of large-scale searching and slack temporal coordination between different processes, a Non-uniform based Hybrid Cooperative Co- evolution （NHCC） algorithm was proposed to solve the problem. By referencing Potter＇s cooperative coevolution framework, some improved strategies such as sub-population evolution based on pheromone crossing, sub-populations collaboration based on non-uniform probability and elite sub-individuals migration were designed to increase the searching efficiency and population diversity. Several experiments were executed and the results showed the effectiveness and advantage of proposed method in both speed and accuracy.

关 键 词：服务流程 服务质量 时序约束 协同进化 非均衡概率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]