基于自适应免疫算法的最优路径问题研究

Research on Optimal Path Planning Problem Based on an Adaptive Immune Algorithm

针对标准遗传算法在解决路径规划问题中存在的不能以概率1收敛及进化时出现退化等情况,提出并实现了一种自适应免疫算法,提出了一种新的编解码方式,给出了相关的免疫克隆、免疫优势等免疫算子的具体设计。进化过程中克隆规模可依据抗体-抗原亲合度、抗体-抗体亲合力自适应调整,采取了最优保存策略从而保证了算法以概率1收敛。实例验证了该算法的可行性,有效性。与标准遗传算法相比,增强了全局收敛,提高了收敛速度,通过仿真验证,该算法运算速度快、结果精度高,为路径规划问题研究提供了一种新方法。

In solving path planning ,standard genetic algorithm exists the problem of non-convergence with probability one and inevitable degeneration including prematurity and decrease of diversity. Faced with this problem, A new algorithm named adaptive immune algorithm is presented and realized. A new symbol encoding and decoding style is presented, the design of immune clone, immune dominance of immune operator are given. The clone scale can be regulated automatically by affinity between antibody and antigen, and between antibodies during evolution. By use of elitist strategy, the algorithm can be convergent with probability one. The feasibility and validity of the algorithm are validated by the calculation instance. Compared with standard genetic algorithm, the algorithm improved the speed of convergence and achieved higher capacity of global optimization .The instance shows that it is a high speed and fidelity method and provides a new approach for solving the problem of optimal path planning.