蚁群算法在物流配送路径优化问题上的应用

Application of Ant Colony Algorithm in Optimization of Logistics Distribution Routing Problem

物流配送路径优化是现代物流配送服务的关键环节之一,是近年来物流控制优化中的研究热点,需要一个快速而有效的求解算法。为此,构建了物流配送路径优化问题的数学模型,通过对基本蚁群算法中的选择策略和信息素挥发速度的改进,提出一种新的蚁群算法,克服基本蚁群算法搜索时间长、易陷入局部最优解等缺陷,将其用于求解一类运输调度问题,实验发现算法有效。

Vehicle Routing Problem （VRP） optimization is a very important problem in modern logistics service, which are researched on the logisticmanagement recently. It needs solving by a fast and effective algorithm. To deal with this need, constructs a new mathematic model of logistics VRP proposes an improved algorithm based on the original ant colony algorithm to solve a kind of VRP, and some limitations of the original ant colony algorithm are success-fully overcome. The experimental result indicates the algorithm is effective.