摘要
文章针对求解货郎担问题（ＴＳＰ），给出了一种佳点集遗传算法。通过对ＣＨＮ１４４实例的仿真求解，取得了令人满意的结果，可以看出该算法不仅提高了求解的效率和精度，还有效地避免了“早熟”现象。
In this paper,a good-point set genetic algorithm is applied to the TSP problem. The satisfied emulation results of TSP problem instance which consists of 144 cities of China,are presented to show that the good-point set GA not only improves efficiency and accuracy,but also effectively avoids the prematurity.
出处
《计算机工程与应用》
CSCD
北大核心
2001年第3期83-84,117,共3页
Computer Engineering and Applications
关键词
货郎担问题
佳点集
遗传算法
组合优化
TSP problem, traditional GA, Good-point set GA, combinatorial optimization
