基于改进蚁群算法服装运输车辆路径优化研究  

On the Vehicle Routing Optimization of Clothing Transportation Based on Improved Ant Colony Algorithm

作　　者：贾祥素[1] 吴菁[1] 

机构地区：[1]浙江纺织服装职业技术学院

出　　处：《浙江纺织服装职业技术学院学报》2013年第3期68-72,共5页Journal of Zhejiang Fashion Institute of Technology

基　　金：浙江纺织服装职业技术学院科研课题[项目编号:2009-2C-002]

摘　　要：蚁群算法是已经成功应用到TSP等多种组合优化案例中,但算法存在容易早熟、收敛速度慢等缺点。以服装运输车辆路径规划问题为研究对象,结合服装时效性强的特点,对传统蚁群算法信息素更新规则及信息素挥发系数进行相应改进,旨在优化配送路线,降低配送成本、增加企业效益。Ant colony algorithm has been successfully applied to many combinatorial optimization cases such as TSP problem, but the algorithm has some disadvantages such as early-maturing and slow convergence. With the vehicle routing planning problem of clothing transportation as the research object, and combining the char- acteristics of garment timeliness, correspondent improvements have been made on the pheromone updating rule and the pheromone evaporation coefficient of traditional ant colony algorithm in order to optimize the dis- tribution route, reduce the distribution costs and increase the benefits of enterprises.

关 键 词：蚁群算法 车辆路径问题 旅行商问题 信息 

分 类 号：U27[机械工程—车辆工程]