中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

文献类型:期刊论文

作者Luo ZT(罗长童)
刊名Journal of Information and Computational Science
出版日期2007
卷号4期号:1页码:195-203
通讯作者邮箱luo@imech.ac.cn
关键词triangle evolution stochastic optimization infeasible programming inconsistent inequalities evolutionary computation
ISSN号15487741
通讯作者Luo CT
合作状况其它
中文摘要In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.
学科主题计算流体力学
收录类别EI
语种英语
公开日期2010-12-07
源URL[http://dspace.imech.ac.cn/handle/311007/43243]  
专题力学研究所_力学所知识产出(1956-2008)
推荐引用方式
GB/T 7714
Luo ZT. Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques[J]. Journal of Information and Computational Science,2007,4(1):195-203.
APA Luo ZT.(2007).Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques.Journal of Information and Computational Science,4(1),195-203.
MLA Luo ZT."Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques".Journal of Information and Computational Science 4.1(2007):195-203.

入库方式: OAI收割

来源:力学研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。