基于蚁群算法求解物流订单派送问题

Solving appoint order form job problem based on ant colony system

针对物流信息平台中的订单派送问题,研究了订单派送的单向性和路径最优特性,构建了路径选择模型,对费用最少和时间最短的双目标优化函数进行了分析,将基本蚁群算法进行了改进。通过对局部信息素进行外界人为的干扰,从而影响整个网络选择,使得路径选择全局最优,解决了基本算法在求解最短路径中计算时间长的问题。模拟结果表明,计算速度提高了30%。

This paper studied the unilateralism and the most optimal route of appoint order form job, constructed the route selection model, lucubrated the expense and the time shortest double goals optimization function with the improved basic ant colony system. Through carrying the outside artificial disturbance on the partial information element, the entire network selection was determined to cause the way choice fits for the overall position, the basic algorithm problem of long time numeration which appeared in the solution most short-path can be solved. The simulation results show that the calculating speed can be improved 30%. 1 tab, 1 fig, 10 refs.