| 回溯法解决"城市推销员"问题 |
| |
| 引用本文： | 刘金花.回溯法解决"城市推销员"问题[J].新余高专学报,2005,10(2):90-92. |
| |
| 作者姓名： | 刘金花 |
| |
| 作者单位： | 新余高等专科学校,计算机与信息工程系,江西,新余,338031 |
| |
| 摘 要： | 回溯法是一种选优搜索法,按选优条件向前搜索,以达到目标。但当探索到某一步时,发现原先选择并不优或达不到目标,就退回一步重新选择。采用算法设计的基本方法--回溯法解决城市推销员问题是一种行之有效而且节省内存空间的方法。
|
| 关 键 词： | 回溯法 带权图 解空间树 最小权 |
| 文章编号： | 1008-6765(2005)02-0090-03 |
| 修稿时间： | 2005年3月1日 |
Solving the problem of "city salespersons" by back tracking |
| |
| LIU Jin-hua.Solving the problem of "city salespersons" by back tracking[J].Journal of XinYu College,2005,10(2):90-92. |
| |
| Authors: | LIU Jin-hua |
| |
| Abstract: | The back tracking method is a kind of optimum-seeking retrieval method by which forward retrieval is done according to the optimum-seeking condition to arrive at the goal. When we find that the previous selection is not optimum or can not meet our goal, we return for reselection. The back tracking method for solving the problem of "city salespersons" is an effective and internal memory-saving method. |
| |
| Keywords: | Back tracking Weighted graph Solution space tree Minimum weight |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
