检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南理工大学自动化科学与工程学院,广州510640
出 处:《计算机科学》2003年第9期35-38,共4页Computer Science
基 金:广东省自然科学基金(011626)
摘 要:1引言 许多实际的优化问题带有不等式和/或等式约束,这类问题一般可以描述为如下的形式:In solving constrained optimization problems with genetic algorithms, more emphases are laid on handling constraints than increasing the search capability of algorithms, which often leed to unsatisfied results as reported in most literatures. This paper proposes a new evolutionary algorithm for constrained optimization, emphasizing more on increasing the search capability of the algorithm by means of hybrid crossovers and intermittent mutation while adopting a simple constraint handling technique called direct comparison. Numerical experiments and comparisons show the effectiveness of the proposed algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222