摘要
对经典遗传算子中的交叉算子和变异算子进行了重新设计 ,提出一种连续探索型自适应遗传算法。该算法能够根据种群进化情况 ,动态地调整遗传算子 ,维持种群的多样性 ,克服过早收敛并加快了搜索速度 ,得到高品质解。将该算法用于最短路径求取中 。
Through redesigning cross operator and variation operator on classical genetic algorithm,a self adaptative genetic algorithm based on relay search method is proposed in this paper. It gets perfect quality answer by maintaining diversity of group, overcoming early constringency and quickening search speed after dynamically regulating genetic operators according to the evolving situations of groups.The shortest path is obtained in the simulative traffic network by using this algorithm. The results show that it is reasonable and efficient.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2002年第6期580-584,共5页
Journal of Nanjing University of Science and Technology
基金
国防科技应用基础基金资助项目
