文献类型：期刊文献

中文题名：蚁群算法在物流配送路径优化中的研究

英文题名：Study on Routing Optimization for Physical Distribution Based on Ant Colony Algorithm

作者：陈建军[1]

机构：[1]绍兴文理学院元培学院

年份：2011

卷号：28

期号：2

起止页码：268

中文期刊名：计算机仿真

外文期刊名：Computer Simulation

收录：CSTPCD、、北大核心2008、CSCD_E2011_2012、北大核心、CSCD

语种：中文

中文关键词：物流配送;蚁群算法;优化

外文关键词：Physical distribution; Ant colony algorithm; Optimization

中文摘要：研究物流配送路径优化问题,提高物流服务质量。针对快速准确送货,传统方法在物流配送路径优化过程,存在搜索时间长,得不到全局最优解,导致物流配送效率低的难题。为了提高物流配送路径优化效率,提出一种蚁群算法的物流配送路径优化算法。该算法首先建立优化物流配送路径的数学模型,然后采用蚁群算法对数学模型进行求解。仿真结果表明,蚁群算法具有较强的全局寻优能力,搜索速快,能够在最短时间找到流配送路径的最优解,是解决物流配送路径优化问题的有效算法。

外文摘要：Physical distribution problems are studied to improve the logistics service quality.Distribution Routing optimization is a NP-hard problem,the traditional method of routing optimization in the physical distribution logistics takes a long time and does not get the global optimal solution,resulting in low efficiency of physical distribution problems.In order to improve the efficiency of physical distribution routing optimization,ant colony algorithm is proposed for logistics distribution path optimization algorithm.Firstly,the mathematical model of the physical distribution routing optimization is established,and then the ant colony algorithm is used to solve this mathematical model.Simulation results show that the ant colony algorithm has strong global search ability and the search speed is fast,especially for finding the optimal solution of physical distribution in the shortest time.It is suitable for physical distribution to solve the routing problem of effective algorithms.