摘要
文章建立了城市车辆配送的多旅行商问题(MTSP)模型,设计了一个新的遗传算法,用2Opt算子改进解的总距离,用贪心交叉算子提供变异功能,计算实例表明了该算法的有效性。
A MTSP model of cities vehicle logistic tour is constructed.A new genetic algorithm is designed to solve the MTSP model.The total distance is improved by2Opt and the mutation functional is provided by crossover.The case study and numerical experiment shows that the new algorithm is very efficient and effective.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第22期38-39,47,共3页
Computer Engineering and Applications
基金
国家自然科学基金资助项目(编号:60073057)
