摘要
对SSFCTP进行了研究,给出了一种简便的遗传算法,这种算法是在基本遗传算法的基础上省略掉杂交过程,仅仅通过对种群中每一个个体的基因进行随机重组而生成新种群。这样一来既可以减少计算量,提高计算效率,也可以保证种群中产生个体的多样性和可行性。并用实例验证和比较了它与基本遗传算法在解决此类问题中的有效性。同时也根据问题解的特殊结构,给出并证明了最优解的一些性质。
The SSTCTP is analyzed, a convenient genetic algorithm is given, this algorithm omits crossover process on the base of basal genetic algorithm and recombines individuals of the population randomly to give birth to another population. By dong this, it can not only reduces calculation and increases computing efficiency, but also guarantees its feasibility and diversity of individuals. At the same time its validity is validated and compared with basic genetic solution founding on the special structure of the problem are given. algorithm by some examples. In the end some properties of optimal
出处
《计算机工程与设计》
CSCD
北大核心
2008年第11期2906-2907,2911,共3页
Computer Engineering and Design
关键词
优化选址
改进遗传算法
隐枚举法
动态规划法
基因重组
optimal location
improved genetic algorithm
implicit enumeration
dynamic programming approach
genetic recombination
