| 求解整数规划问题的混合遗传算法及收敛性 |
| |
| 引用本文： | 郭仁拥,金海和.求解整数规划问题的混合遗传算法及收敛性[J].高等学校计算数学学报,2009,31(3). |
| |
| 作者姓名： | 郭仁拥 金海和 |
| |
| 作者单位： | 1. 内蒙古大学计算机学院,呼和浩特,010021
2. 内蒙古大学公共管理学院,呼和浩特,010021 |
| |
| 摘 要： | 1引言 科学和工程领域中的许多优化问题最终可以归结为求解一个带有约束条件的整数规划问题.其形式为: {maxx∈In f(x) s.t.gi(x)=0,j=1,…,me; gi(x)≥0,i=me+1,…m, x∈nΠi=1 Ai, 式中I表示整数集,x=(x1,…,xn)T,Ai(i∈{1,…,n})为有限整数集. 遗传算法作为一种优化技术,是一种近似算法,一般不能保证一定能得到优化问题的精确解.
|
| 关 键 词： | 算法效率 种群 混合遗传算法 遗传模拟退火算法 整数规划问题 求解 标准遗传算法 马尔可夫链 收敛性 |
A HYBRID GENETIC ALGORITHM FOR INTEGER PROGRAMMING AND ITS CONVERGENCE |
| |
| Guo Renyong,Jin Haihe.A HYBRID GENETIC ALGORITHM FOR INTEGER PROGRAMMING AND ITS CONVERGENCE[J].Numerical Mathematics A Journal of Chinese Universities,2009,31(3). |
| |
| Authors: | Guo Renyong Jin Haihe |
| |
| Institution: | Guo Renyong (College of Computer Science,Inner Mongolia University,Hohhot 010021) Jin Haihe (School of Public Management,Hohhot 010021) |
| |
| Abstract: | In this paper a hybrid genetic algorithm for integer programming, which integrates both a genetic algorithm and a simulated annealing algorithm by a new method to avoid large drop of the algorithm's efficiency is proposed.A newnature selectrule is added into the algorithm to ensure that it converges to optimal solution with probability 1.And also individuals more than one are generated by a pair of parents to improve individuals' diversity and algorithm's local search ability.The algorithm's convergence is ... |
| |
| Keywords: | hybrid genetic algorithm integer programming Markov chain |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
