运输调度问题是一类复杂的组合优化问题,是近年来物流控制优化中的研究热点。通过对基本蚁群算法中的选择策略和信息素挥发速度的改进,提出了一种新的蚁群算法,克服了基本蚁群算法搜索时间长、易陷入局部最优解等缺陷,将其用于求解一类运输调度问题,实验发现算法有效,并且对于规模越大的问题,相对其它算法有更优的解。
Vehicle routing problems (VRP) are a kind of combinatorial optimization problems, which are research in the logistic management recently. An improved algorithm based on the original ant colony algorithm is put forward to solve a kind of VRP, and some limitations of the original ant colony algorithm are successfully overcome. The experimental result indicates the algorithm is effective, and compared with other algorithms, the larger the dimension is, the better the result is.