多目标旅行商问题竞争决策算法

doi:10.3778/j.issn.1002-8331.2009.34.005

计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (34): 13-16.DOI: 10.3778/j.issn.1002-8331.2009.34.005

多目标旅行商问题竞争决策算法

宁爱兵¹，熊小华^1，2，马良¹

1.上海理工大学管理学院，上海 200093
2.上海第二工业大学计算机与信息学院，上海 201209

收稿日期:2009-09-03 修回日期:2009-10-12 出版日期:2009-12-01 发布日期:2009-12-01
通讯作者: 宁爱兵

Competitive decision algorithm for multi-objective traveling salesman problem

NING Ai-bing¹，XIONG Xiao-hua^1，2，MA Liang¹

1.School of Management，University of Shanghai for Science and Technology，Shanghai 200093，China
2.College of Computer and Information，Shanghai Second Polytechnic University，Shanghai 201209，China

Received:2009-09-03 Revised:2009-10-12 Online:2009-12-01 Published:2009-12-01
Contact: NING Ai-bing

摘要/Abstract

摘要： 竞争决策算法是在分析大自然生物世界特别是人类的各种竞争机制和决策原理的基础上，利用竞争造就优化、决策左右结果的特性来到达优化目的的新型寻优算法。给出了用竞争决策算法求解多目标旅行商问题的算法，经过大量数据测试和验证，获得了较好的结果。

关键词: 竞争决策算法, 多目标旅行商问题, 竞争力函数, 决策函数, 资源交换规则, 竞争决策均衡

Abstract: Competitive decision algorithm is a new optimization algorithm based on the analysis of the mechanism of natural competitions and the principle of decision.It uses the characteristics that competition builds optimisation and the result of competition hinges on decision.In this paper，a competitive decision algorithm for multi-objective traveling salesman problem is provided.Use this algorithm to solve many instances of multi-objective traveling salesman problem and computational result results in good performances.

Key words: competitive decision algorithm, multi-objective traveling salesman problem, competitive force function, decision function, resources exchange rule, competitive decision equilibrium

中图分类号:

TP301.6

宁爱兵¹，熊小华^1，2，马良¹. 多目标旅行商问题竞争决策算法[J]. 计算机工程与应用, 2009, 45(34): 13-16.

NING Ai-bing¹，XIONG Xiao-hua^1，2，MA Liang¹. Competitive decision algorithm for multi-objective traveling salesman problem[J]. Computer Engineering and Applications, 2009, 45(34): 13-16.

[1]	何永梅，宁爱兵，彭大江，尚春剑，张惠珍. 软容量限制设施选址问题的竞争决策算法[J]. 计算机工程与应用, 2019, 55(3): 50-54.
[2]	周文谊1，王吉源2. 高斯隶属度优化的超分辨率随机森林学习算法[J]. 计算机工程与应用, 2016, 52(23): 208-212.
[3]	熊小华1，宁爱兵2. 最小比率生成树的竞争决策算法[J]. 计算机工程与应用, 2012, 48(28): 47-51.
[4]	朱云飞1，2，蔡自兴1，袁琦钊2，郑金华2. 求解多目标旅行商问题的混合遗传算法[J]. 计算机工程与应用, 2011, 47(7): 52-56.
[5]	金婷婷，王波，宁爱兵. 最小顶点覆盖问题的竞争决策算法[J]. 计算机工程与应用, 2011, 47(1): 32-34.
[6]	宁爱兵,马良. 0/1背包问题竞争决策算法[J]. 计算机工程与应用, 2008, 44(3): 14-16.

多目标旅行商问题竞争决策算法

Competitive decision algorithm for multi-objective traveling salesman problem

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics