摘要
利用数学推导和证明得出了一个瓶颈旅行商问题下界快速估算法,在此基础上利用竞争决策算法(新型优化思想)的通用模型,给出了一种瓶颈旅行商问题的竞争决策算法,经过大量数据测试和验证,并将求解结果与下界相比较,部分结果与下界相同.
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.
出处
《上海理工大学学报》
EI
CAS
北大核心
2005年第3期223-228,共6页
Journal of University of Shanghai For Science and Technology
基金
国家自然科学基金资助项目(70471065)
上海市教委重点学科建设资助项目
关键词
瓶颈旅行商问题
竞争决策算法
下界
竞争力函数
决策函数
bottleneck travelling salesman problem
competitive decision algorithm
lower bound
competitive force function
decision function