将约束离散优化(CDO)转化为非线性约束非负整数规划(CNIP)我要分享

Of nonlinear constraints discrete optimization (CDO) can be converted to constrained non-negative in

约束离散优化 CDO 非线性约束非负整数规划 CNIP

关注次数: 455

下载次数: 0

文件大小: 906KB

代码分类: 电子书籍

开发平台: matlab

下载需要积分: 1积分

版权声明:如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

代码描述

中文说明:

将约束离散优化(CDO)转化为非线性约束非负整数规划(CNIP),该算法采用了种群混沌初始化、双方案变异、离散差分进化等多种改进措施,可求解非线性约束非负整数规划(CNIP),以及具有随机扰动的积分算子。针对非线性约束,给出了连续映射基惩罚的计算方法和基函数的公式,并在此基础上提出了处理约束的自适应惩罚因子。研究了一种新的描述种群多样性的新测度,称为种群的拟再平均基因距离,并在此基础上实现了保持种群多样性的混沌移民算子和概率。定向约束工程优化


English Description:

The constrained discrete optimization (CDO) is transfor med into a nonlinear constrained non-negative integer programming (CNIP) which can be solved by the proposed discrete differential evolution (DDE) algorithm that adopts several improvements such as the chaotic initialization of a population, the double-scheme mutation, and the integrating operator with stochastic perturbation. Aiming at the nonlinear constraints, th e calculating approaches for the base penalty and the formula f or the base function of continuous mapping are carried out, and self-adaptive penalty factors based on these notions for handling cons traints are presented. It is studied that a novel measure, termed as a quasi re-averaging gene distance for a population, is employed t o depict the diversity of the population and chaotic immigration operato rs depending on this measure a nd the probability are implemented to preserve the population diversity. Orientating constrained engineering optimizati


代码预览

Constrained Engineering Optimization.pdf