作　　者： ; ; ;

机构地区： 华南理工大学理学院数学与应用数学系

出　　处： 《计算机集成制造系统》 2005年第4期572-576,共5页

摘　　要： 利用最大-最小策略,最大最小蚂蚁算法减小了蚂蚁算法陷入局部陷阱的可能性。基于对最大最小信息素策略和信息素更新方式的改进,结合快速产生初始解的算法,提出了一种新方法。把该方法应用于有时间窗车辆路径问题,试验结果表明该算法是有效的。 Max-Min Ant System (MMAS) reduced the possibility of ant system being dropped into the local trap via Max-Min strategy. By improved Max-Min pheromone strategy and the way of updating pheromone,an improved algorithm was proposed by based on the traditional algorithm which gave initial results fast. The proposed algorithm was applied to the Vehicle Routing Problem with Time Window(VRPTW). The experiment results indicates that the new algorithm is effective.

关 键 词： 蚂蚁算法 车辆路径问题 时间窗

领　　域： [理学] [理学]