检索结果-南通市图书馆

Sample Bound Estimate Based Chance-constrained immune optimization and Its Applications

International Journal of Automation and computing 2016年第5期13卷 468-479页

作者： Zhu-Hong Zhang Kai Yang Da-Min Zhang College of Big Data & Information Engineering Guizhou University College of Computer Science & Technology Guizhou University

This work investigates a simple and practical bio-immune optimization approach to solve a kind of chance-constrained programming problem without known noisy attributes, after probing into a lower bound estimate of sample size for any random variable. Such approach mainly consists of sample allocation, evaluation, proliferation and mutation. The former two, depending on a lower bound estimate acquired, not only decide the sample size of random variable and the importance level of each evolving B cell, but also ensure that such B cell is evaluated with low computational cost; the third makes diverse B cells participate in evolution and suppresses the influence of noise; the last, which associates with the information on population diversity and fitness inheritance, creates diverse and high-affinity B cells. Under such approach, three similar immune algorithms are derived after selecting different mutation rules. The experiments, by comparison against two valuable genetic algorithms, have illustrated that these immune algorithms are competitive optimizers capable of effectively executing noisy compensation and searching for the desired optimal reliable solution.

关键词： Chance-constrained programming immune optimization sample allocation lower bound estimate noise attenuation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Adaptive sampling immune algorithm solving joint chance-constrained programming

引用

控制理论与应用（英文版） 2013年第2期11卷 237-246页

作者： Zhuhong ZHANG Lei WANG Min LIAO Institute of System Science & Information Technology College of Science Guizhou University

This work investigates one immune optimization algorithm in uncertain environments, solving linear or nonlinear joint chance-constrained programming with a general distribution of the random vector. In this algorithm, an a priori lower bound estimate is developed to deal with one joint chance constraint, while the scheme of adaptive sampling is designed to make empirically better antibodies in the current population acquire larger sample sizes in terms of our sample-allocation rule. Relying upon several simplified immune metaphors in the immune system, we design two immune operators of dynamic proliferation and adaptive mutation. The first picks up those diverse antibodies to achieve proliferation according to a dynamical suppression radius index, which can ensure empirically potential antibodies more clones, and reduce noisy influence to the optimized quality, and the second is a module of genetic diversity, which exploits those valuable regions and finds those diverse and excellent antibodies. Theoretically, the proposed approach is demonstrated to be convergent. Experimentally, the statistical results show that the approach can obtain satisfactory performances including the optimized quality, noisy suppression and efficiency.

关键词： Joint chance-constrained programming immune optimization Adaptive sampling Reliability domi-nance Noisy attenuation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：