改进的蚁群算法在物流配送路径问题求解中的应用  

Improved Ant Colony Algorithm in Physical Distribution Routing Problem Solution

作　　者：杨瑞臣[1] 郝海燕[1] 

机构地区：[1]承德石油高等专科学校数理系,河北承德067000

出　　处：《承德石油高等专科学校学报》2009年第2期53-56,共4页Journal of Chengde Petroleum College

摘　　要：对蚁群算法的可见度、信息素浓度更新规则及参数等进行有针对性改进,加入了容量及节约值的影响因素,在迭代中只对部分最优路线进行浓度更新,应用swap法对路径深入调整,实验表明,方法具有更好的搜索效果、更快的搜索速度以及良好的稳定性。The paper improves the ant colony algorithm in three aspects such as visibility,trail update and parameters.The capacity and saving are used and only a part of trail is updated which is in the better routing.The paper uses swap to adjust the got routings.The examples indicate that the improved algorithm is more accurate,faster,and more reliable.

关 键 词：物流配送 蚁群算法 SWAP 

分 类 号：O224[理学—运筹学与控制论]