摘要
针对旅行商问题,利用竞争决策算法的通用模型,给出了一种基于竞争决策思想,能求解大规模和超大规模TSP问题的快速求解方法,经过大量数据测试和验证,获得了较好的结果。
Based on the competitive decision algorithm (a brand-new optimization idea) and according to its general model, this paper proposes a quick competitive decision algorithm for solving large-scale and super large-scale travelling salesman problem. By using the new algorithm, it solves some STSP instances and compares these solutions with the best known solutions published, that results in good performances.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第9期23-26,共4页
Computer Engineering
基金
国家自然科学基金资助项目(70471065)
上海市教委重点学科建设资助项目
关键词
TSP
竞争决策算法
竞争力函数
决策函数
Traveling salesman problem(TSP)
Competitive decision algorithm(CDA)
Competitive force function
Decision function