首页 | 本学科首页   官方微博 | 高级检索  
     检索      

资源优化模型及遗传算法
引用本文:周康,同小军,许进.资源优化模型及遗传算法[J].华中科技大学学报(自然科学版),2005,33(10):59-62.
作者姓名:周康  同小军  许进
作者单位:武汉工业学院,数理科学系,湖北,武汉,430023;华中科技大学,控制科学与工程系,湖北,武汉,430074;华中科技大学,控制科学与工程系,湖北,武汉,430074
基金项目:国家自然科学基金资助项目(60373089,30370356,60274026)
摘    要:在网络计划中提出了资源优化问题,并建立了资源优化数学模型.同时,指出现代优化算法是求解资源优化模型的主要算法,并使用遗传算法对资源优化模型进行求解.此遗传算法与传统的遗传算法有所不同,第一是根据资源优化过程的特点设计的独特的杂交概率和变异概率,可以既尽快获得最佳模式又扩大搜索范围,避免早熟现象的发生;第二是引进了检查和修复算子以保证杂交和变异的子代满足可行性的要求;最后给出了算例以验证算法的有效性和正确性.

关 键 词:网络计划  资源优化问题  数学模型  遗传算法
文章编号:1671-4512(2005)10-0059-04
收稿时间:2004-10-14
修稿时间:2004年10月14

A mathematical model and genetic algorithm for resource optimization
Zhou Kang,Tong Xiaojun,Xu Jin.A mathematical model and genetic algorithm for resource optimization[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2005,33(10):59-62.
Authors:Zhou Kang  Tong Xiaojun  Xu Jin
Abstract:For network planning,resource optimization was put forward,and a mathematical model of resource optimization was set up.It was seen from the analysis that the modern optimization algorithms are mainly used to solve the mathematical model of resource optimization,and then genetic one used for solving this model of resource optimization.This genetic algorithm made a difference to traditional genetic algorithm.Firstly,the designed inimitable crossover probability and idiographic mutation one designed,can find optimal schema as soon as possible as well as enlarge searching area to solve deceptive problem.Secondly,being used inspecting and self-renovating operator can ensure that each son individual passing through crossover and mutation meets the feasibility.Finally,an example for showing validity of this algorithm was given.
Keywords:network planning  problem of resource optimization  mathematical model  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号