摘要
介绍了一种求解旅行商问题的新算法"最小调整法",给出了该算法求解旅行商问题的具体步骤以及有效性证明,对算法的复杂性及近似程度进行了分析.最后通过典型算例进行了检验说明.与经典算法相比,新算法体现了简单易行的特点,对求解旅行商问题具有一定的启发意义.
This paper introduced a new algorithm ＇the least adjustment method＇ for traveling salesman problem. The specific steps were given, the effectiveness of the algorithm was proved, and the complexity and the degree of approximation for the algorithm were analyzed. Finally, the typical examples were given to test and illustrate the algorithm. The algorithm is simple compared with the classic algorithms , and has instructive significance to traveling salesman problem.
出处
《经济数学》
2012年第4期1-7,共7页
Journal of Quantitative Economics
基金
教育部哲学社会科学研究重大课题攻关项目(12JZD025)
国家自然科学基金项目(70902062
70901016
71271045)
辽宁省教育科学"十二五"规划课题(JG12DB079
JG12DB086)
东北财经大学教学研究项目(YY12014)资助
关键词
旅行商问题
最小调整法
算法有效性
traveling salesman problem
the least adjustment method
the analysis of the effectiveness
