检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原科技大学系统仿真与计算机应用研究所,山西太原030024
出 处:《计算机应用》2009年第5期1264-1266,1269,共4页journal of Computer Applications
基 金:山西省自然科学基金资助项目(20041048)
摘 要:改进差分进化算法不能有效利用进化过程中的知识,传统文化算法进化后期收敛速度较慢。针对这些问题提出一种基于文化算法和改进差分进化算法的混合算法,并将这一算法应用于约束求解问题。对基准函数和丁烯烷化生产调度问题进行仿真,结果表明该混合算法具有较好的实用性和稳健性,在寻优效率和优化结果方面都优于与之比较的算法,并降低了计算量。Modified differential evolution algorithm can not make effective use of knowledge about evolutionary information, and traditional cultural algoritbm converge slowly because only mutation operation is adopted in population space. To solve these problems, a new hybrid optimization algorithm was proposed based on cultural algorithm and modified differential evolution algorithm. It was applied to constraint solving. Simulation tests were performed based on benchmark functions and the production scheduling problem of butene alkylation. The results indicate that the proposed algorithm is practicable and effective. Compared with other algorithms, it is superior in optimizing efficiency and results, and reduces the computational cost.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33