| 基于快速下界估算的瓶颈旅行商问题竞争决策算法 |
| |
| 引用本文： | 宁爱兵,马良.基于快速下界估算的瓶颈旅行商问题竞争决策算法[J].上海理工大学学报,2005,27(3):223-228. |
| |
| 作者姓名： | 宁爱兵 马良 |
| |
| 作者单位： | 上海理工大学,管理学院,上海,200093;上海理工大学,管理学院,上海,200093 |
| |
| 基金项目： | 国家自然科学基金资助项目(70471065)，上海市教委重点学科建设资助项目 |
| |
| 摘 要： | 利用数学推导和证明得出了一个瓶颈旅行商问题下界快速估算法，在此基础上利用竞争决策算法(新型优化思想)的通用模型，给出了一种瓶颈旅行商问题的竞争决策算法，经过大量数据测试和验证，并将求解结果与下界相比较，部分结果与下界相同．
|
| 关 键 词： | 瓶颈旅行商问题 竞争决策算法 下界 竞争力函数 决策函数 |
| 文章编号： | 1007-6735(2005)03-0223-06 |
| 修稿时间： | 2004年5月15日 |
Solving bottleneck travelling salesman problem with competitive decision algorithm based on quick lower bound estimation |
| |
| NING Ai-bing,MA Liang.Solving bottleneck travelling salesman problem with competitive decision algorithm based on quick lower bound estimation[J].Journal of University of Shanghai For Science and Technology,2005,27(3):223-228. |
| |
| Authors: | NING Ai-bing MA Liang |
| |
| Abstract: | Based on mathematical inference and proof, a quick algorithm for estimating the lower bound of bottleneck travelling salesman problem (BTSP) is proposed. Based on the quick lower bound algorithm for BTSP and the general model of the competitive decision algorithm (a novel optimization idea),a quick competitive decision algorithm for solving BTSP is then presented.Series of numerical examples of BTSP are tested and their solutions are compared with the lower bound. Parts of the solutions are equal to the lower bound. |
| |
| Keywords: | bottleneck travelling salesman problem competitive decision algorithm lower bound competitive force function decision function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海理工大学学报》浏览原始摘要信息 |
|
点击此处可从《上海理工大学学报》下载全文 |
