基于C-W节约算法的TSP教学辅助系统研究与设计  

Research on Teaching Assistance System of TSP Based on Clark-Wright Saving Algorithm

作　　者：杨凌杰[1] 李静[1] 

机构地区：[1]南京农业大学工学院,南京210031

出　　处：《微计算机应用》2008年第9期22-26,共5页Microcomputer Applications

基　　金：南京农业大学SRT项目(0715A15);南京农业大学青年科技创新基金(KJ06028)

摘　　要：旅行商问题(TSP,Traveling Salesman Problem)属于组合优化领域中一个典型的NP-Hard问题,在许多方面都有着广泛的运用,现已经有诸多的算法被提出以解决这个问题,但是其在教学演示上有较大的难度。为了提高教学质量,本文深入研究一种较为成熟的节约算法,同时设计该算法的教学软件系统,达到了对该问题的分步演示及可视化,改善了教学方法。Traveling Salesman Problem, which has widely application in many aspects, is a typical NP - Hard problem of the combinatorial optimization problems. Nowadays, so many Algorithms have been put forward to solve this problem, but it already has a greater ditficulty in the teaching demonstration. In order to improve the teaching quality, this article works on C - W algorithm and designs the teaching assistant system about this algorithm. This system is helpful for the improvement of teaching quality.

关 键 词：C-W节约算法 旅行商问题 多媒体教学 计算机辅助教育 教学改革 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]