节点文献
基于累积竞争神经网络的多约束路由算法
Multi-constrained routing algorithm based on accumulating competition neural networks
【摘要】 针对无约束最优路径问题,提出累积竞争神经网络模型及其搜索算法,该算法具有高度并行性、能获得最优解、结构简单等特点.以QoS路由选择为例,将算法推广到多约束路由问题.实验结果表明,对于大多数多约束QoS问题,在与相应最短路径上节点数目相当的迭代次数内,该算法能找到问题的满意解甚至最优解.
【Abstract】 A neural network model called accumulating competition neural network (ACNN) is proposed to solve the general shortest path problem. The ACNN algorithm has the characteristics of parallelism, simplicity and efficiency in finding the global optimal solution. Taking the QoS routing as an example, the ACNN based shortest path algorithm is generalized to solve the multi-constrained routing problem. Simulation results show that the proposed method can find the satisfactory even optimal solution within a few iterations.
【关键词】 多约束路由选择;
最短路径;
累积竞争神经网络;
【Key words】 multi-constrained routing; shortest path; accumulating competition neural networks;
【Key words】 multi-constrained routing; shortest path; accumulating competition neural networks;
【基金】 国家自然科学基金资助项目(60371044).
- 【文献出处】 控制与决策 ,Control and Decision , 编辑部邮箱 ,2004年07期
- 【分类号】TP301
- 【被引频次】9
- 【下载频次】116