基于果蝇优化算法的最短路径路由优化

The Route Optimization of the Shortest Path with Fruit Fly Optimization Algorithm

针对传统算法无法高效地解决网络路由最优化选择的问题,将FOA算法引入最短路径路由优化问题,应用FOA算法的快速寻优能力,在保证路径最短和能耗最低的情况下,实现路由路径的最优化选择。选择死亡节点数目、网络能耗和端到端时延三个指标作为路由优化结果的评价指标,实验结果表明,本文算法均优于改进算法和经典算法,效果较好,可以进一步进行推广和应用。

For traditional algorithms cannot efficiently solve network routing optimization problem, the FOA algorithm is introduced into the shortest path routing optimization problem, FOA algorithm is applied to the rapid searching ability, in ensuring the shortest path and minimum energy consumption situation, the optimal routing path choice. Death number of nodes and the network energy consumption and the end to end delay three indicators as the routing optimization, the evaluation index selection. Experimental results show that the proposed algorithm is better than those of the improved algorithm and the classical algorithm, the effect is better, thus proving the validity and reliability of the algorithm for further promotion and application.