基于改进遗传算法的最短路径问题的研究

Research on Shortest Path Problem Based on Improved Genetic Algorethm

遗传算法解决最短路径问题,易出现早熟现象,对此论文提出了隔代交叉的自适应遗传算法。本文首先阐述了标准遗传算法过程,并对其出现的早熟现象进行了分析;其次,调整自适应遗传算法的适应度函数,提出了隔代交叉的自适应遗传算法;最终,算法在多峰值问题和不同最短路径问题进行了验证,分析了算法的优劣。实验表明,本文提出的算法可以有效的避免早熟、收敛速度快、稳定性高。

This paper describes the standard genetic algorithm process, the precocious phenomenon is analyzed. The adaptiue func- tion of adaptive genetic algorithm is improued, the generational cross is presented in this article. The pros and cons of three algo- rithms are compared and analyzed. Experimental results show that the proposed algorithm can effectively avoid prematurity, last convergence and high stability.