基于动态扫描和蚂蚁算法的物流配送网络优化研究  

Study on the Optimization of Logistics Distribution Network Based on Dynamic Sweep and Ant Algorithm

作　　者：李志威[1] 张旭梅[1] 

机构地区：[1]重庆大学经济与工商管理学院,重庆400044

出　　处：《管理工程学报》2006年第4期9-12,共4页Journal of Industrial Engineering and Engineering Management

基　　金：国家自然科学基金资助项目(70272043)

摘　　要：本文在对动态扫描和蚂蚁算法研究的基础上,针对蚂蚁算法在求解大规模物流配送问题中存在的不足,利用动态扫描方法在区域选择方面的实用性和蚂蚁算法在局部优化方面的优点,提出综合两种方法的混合算法,并进行了实验计算。计算结果表明,混合算法获得了较满意的效果。On the basis of the study of dynamic sweep and Ant Algorithm, aim to solve the weakness of ant algorithm in large-scale optimization of logistics distribution network and make use of the practicability in area search of Dynamic sweep and the superiority in local optimization of Ant Algorithm, this paper presents a hybrid algorithm which is the combination of dynamic sweep and Ant Algorithm and makes some experimental computations, The computational results demonstrate that the hybrid algorithm can effectively solve logistics distribution problem,

关 键 词：动态扫描 蚂蚁算法 物流配送 路径优化 

分 类 号：F270.7[经济管理—企业管理]