物流配送网络环境中移动代理路径寻优  

Searching optimal route of mobile agents in logistics network of distribution

作　　者：许毅[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430063

出　　处：《计算机工程与应用》2011年第8期7-10,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60672137);教育部博士点基金项目(No.200804971030);湖北省自然科学基金(No.2008CDB347)~~

摘　　要：将蚁群算法的基本原理用到物流配送网最短路径搜索中,对降低配送成本有重要意义。针对物流配送网带约束的路由选择问题,分析了自然界中蚂蚁卓越的选路行为,提出了一种基于ant-like移动代理的路径选择算法(ORA)。该算法利用ant-like移动代理采集物流配送网络中各节点的详细信息,以网络延迟和费用为QoS参数,建立了一个满足延迟约束达到费用最小化模型;同时采用多个ant-like代理选径策略来求路径最优解,以缩短路由重构的时间,延长了网络的生存时间。分析和仿真实验结果都证明该算法是有效的。The basic theory of ant colony algorithm is applied to shortest path search in the logistics network of distribution for reducing the cost of logistic distribution.This paper introduces ant’s excellent site-hunting behavior for the problems of constrained routing in the logistics network of distribution firstly.It presents the Optimizing Routing Algorithm（ORA） by using ant-like agents.The information of all mobile nodes is collected by ant-like agents in logistics network of distribution.The delay and cost between any two nodes of network are set to QoS parameters.A minimum model with the expectation of cost and delay value is presented.A multiple ant-like agent strategy is adopted to reduce the time consumption of rerouting and to extend the survival time of network.Analyses and simulation results prove the validity of the proposed algorithm.

关 键 词：物流配送 路径优化 蚁群算法 移动代理 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]