[1]张银明.元素判别值分配法在求解TSP问题中的应用[J].华侨大学学报(自然科学版),2002,23(2):191-197.[doi:10.3969/j.issn.1000-5013.2002.02.018]
　Zhang Yinming.Application of the Allocation of Element Discrimination Value to the Solution of Traveling Salesman Problem[J].Journal of Huaqiao University(Natural Science),2002,23(2):191-197.[doi:10.3969/j.issn.1000-5013.2002.02.018]
点击复制

元素判别值分配法在求解TSP问题中的应用()
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第23卷
期数:
2002年第2期
页码:
191-197
栏目:
出版日期:
2002-04-20

文章信息/Info

Title:
Application of the Allocation of Element Discrimination Value to the Solution of Traveling Salesman Problem
文章编号:
1000-5013(2002)02-0191-07
作者:
张银明
华侨大学信息科学与工程学院 泉州362011
Author(s):
Zhang Yinming
College of Info. Sci. & Eng., Huaqiao Univ., 362011, Quanzhou
关键词:
旅行商问题;  元素判别值分配法;  运筹学;  调运问题
Keywords:
traveling salesman problem;  allocation of element discrimination value;  operational research;  transportation dispatching
分类号:
O221
DOI:
10.3969/j.issn.1000-5013.2002.02.018
文献标志码:
A
摘要:
针对旅行商 (TSP)问题的求解,研究出一种完全不同于现行方法的求解新途径 .该方法基于元素判别值的分配,其值是一个元素可调配和被选择的权值,是经综合计算的 .因此,可作为元素调配或选择的依据 .使用它求解 TSP问题时,只需一次分配可获最方案,无需调整
Abstract:
For solving traveling salesman problem(TSP), a new method quite different from the one commonly use is worked out. The method is based upon the allocation of element discrimination value. The value is a weighted value, of which the element is allocable and chosen and is comprehensively computed. Consequently, this new method will serve as a basis for the allocation and the ehoice of element. In case the method is used for solving TSP, it needs only once allocation to get optimal plan and needs not any adjustment.

参考文献/References:

[1] 张银明. 调运问题的新解法—元素判别值分配法的研究与实现 [J]. 华侨大学学报(自然科学版), 1994(4):447-453.
[2] 张银明. 元素判别值分配法及其算法设计 [J]. 计算机工程与应用, 1995(6):25-31.
[3] 张银明, 张谋东. 调运、指派和货郎担问题的通用解法的研究—算法设计及其程序实现 [J]. 计算机工程与应用, 1996(1):26-31.
[4] 邢文训, 谢金星. 现代优化计算方法 [M]. 北京:清华大学出版社, 1990.79-102.
[5] 吴文江, 袁仪方. 实用数学规划 [M]. 北京:机械工业出版社, 1993.175-233.

相似文献/References:

[1]张银明.运筹学分配问题的新解法及其算法设计和程序实现[J].华侨大学学报(自然科学版),1997,18(3):297.[doi:10.11830/ISSN.1000-5013.1997.03.0297]
　Zhang Yinming.A New Solution to Allocation Problem in Operational Research and Its Algorithm Design and Program Execution[J].Journal of Huaqiao University(Natural Science),1997,18(2):297.[doi:10.11830/ISSN.1000-5013.1997.03.0297]
[2]张银明.最小Hamilton圈问题的求解新方法[J].华侨大学学报(自然科学版),2003,24(2):194.[doi:10.3969/j.issn.1000-5013.2003.02.016]
　Zhang Yinming.A New Method for Solving Problem of Minimal Hamilton Circle[J].Journal of Huaqiao University(Natural Science),2003,24(2):194.[doi:10.3969/j.issn.1000-5013.2003.02.016]
[3]张银明.单向Hamilton最优通路的求解新方法及其算法设计[J].华侨大学学报(自然科学版),2003,24(3):314.[doi:10.3969/j.issn.1000-5013.2003.03.018]
　Zhang Yinming.A New Method for Solving One-Way Hamilton Best Path and Its Algorithm Design[J].Journal of Huaqiao University(Natural Science),2003,24(2):314.[doi:10.3969/j.issn.1000-5013.2003.03.018]
[4]徐强,宋海洲,田朝薇.解TSP问题的蚁群算法及其收敛性分析[J].华侨大学学报(自然科学版),2011,32(5):588.[doi:10.11830/ISSN.1000-5013.2011.05.0588]
　XU Qiang,SONG Hai-zhou,TIAN Zhao-wei.Convergence Analysis of the Ant Colony Algorithm for Solving TSP[J].Journal of Huaqiao University(Natural Science),2011,32(2):588.[doi:10.11830/ISSN.1000-5013.2011.05.0588]

更新日期/Last Update: 2014-03-23