[1]张银明.货郎担问题的新解法及其算法设计[J].华侨大学学报(自然科学版),1995,16(4):444-450.[doi:10.11830/ISSN.1000-5013.1995.04.0444]
　Zhang Yinming.A New Solution of Travelling Salesman Problem and the Design of Its Algorithm[J].Journal of Huaqiao University(Natural Science),1995,16(4):444-450.[doi:10.11830/ISSN.1000-5013.1995.04.0444]
点击复制

货郎担问题的新解法及其算法设计()
分享到：

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

卷:
第16卷
期数:
1995年第4期
页码:
444-450
栏目:
出版日期:
1995-10-20

文章信息/Info

Title:
A New Solution of Travelling Salesman Problem and the Design of Its Algorithm
作者:
张银明
华侨大学电子工程系
Author(s):
Zhang Yinming
关键词:
运筹学;  货郎担问题;  元素判别值;  算法设计
Keywords:
operation research;  travelling salesman problem;  element discrimination value;  algorithm design
分类号:
O302
DOI:
10.11830/ISSN.1000-5013.1995.04.0444
摘要:
货郎担问题是运筹学中的一个著名命题,目前使用分技定界法及动态规划方法求解.本文介绍使用元素判别值进行求解的新方法及其算法设计和程序实现,它比现行方法简易有效.
Abstract:
As a famous proposition in operation research,travelling salesman problem is solved by branch bound method and the method of dynamic programming at present.The author proposes a new method of element discrimination value with its algorithm design and prog

相似文献/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(4):297.[doi:10.11830/ISSN.1000-5013.1997.03.0297]
[2]杨四海.TSP的等价解及其对免疫遗传算法的干扰[J].华侨大学学报(自然科学版),2007,28(1):27.[doi:10.3969/j.issn.1000-5013.2007.01.008]
　YANG Si-hai.Equivalent Solutions of TSP and Its Interference on Immune-Genetic Algorithm[J].Journal of Huaqiao University(Natural Science),2007,28(4):27.[doi:10.3969/j.issn.1000-5013.2007.01.008]

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