基于自适应蚂蚁算法的动态最优路由选择  

Dynamic optimization routing method based on ant adaptive algorithm

作　　者：丁建立[1] 陈增强[1] 袁著祉[1] 

机构地区：[1]南开大学信息技术与科学学院,天津300071

出　　处：《控制与决策》2003年第6期751-753,757,共4页Control and Decision

基　　金：国家自然科学基金资助项目(60174021);天津自然科学基金重点资助项目(013800711);河南科技攻关基金资助项目(0124140141)

摘　　要：蚂蚁算法具有很强的随机性和自适应性,基于蚂蚁圈模型和MMAS模型构造的自适应蚂蚁算法,将网络的容量限制、流量变化和最短距离结合起来讨论,通过在找到的最短路径上设置障碍物来模拟网络拥塞,找到源结点→日的结点的多条最优路由序列,以便在实际中实时地、自适应地进行动态路由选择。Ant adaptive algorithm is studied based on a globally optimizing ant-cycle of ant colony optimization and Max-Min ant system. It find a short routing (from source-node to purpose-node) consisting of multicast optimization routes through discussing networks flow-based routing and distance vector routing. Networks congestion is simulated through seting an obstacle appears on the shortest path. It is able to choose dynamic routing real-timely and adaptively by routing table.

关 键 词：蚂蚁圈模型 MMAS 自适应蚂蚁算法 动态路由选择 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]