文件名称:MTSP_non_GA
介绍说明--下载内容均来自于网络,请自行研究使用
本文研究的多旅行商问题是:满足三角不等式的赋权完全图上的一个双目标优化问题。文中首先
运用系统科学中的“吸引子”概念对问题求解的算法机理作了新的分析探讨,在此基础上提出了一种求解该
问题的近似算法思想,并设计了算法。实例分析表明,这种颇为新颖处理方法是非常有效的。-In this paper, the multi-traveling salesman problem is: to meet the triangle inequality enabling complete graph on a bi-objective optimization problem. The paper first application of systems science in the " attractor" concept of the problem-solving algorithm that gives a new analysis of the mechanism to explore, on this basis proposes a similar algorithm for solving the problem of thought, and design of the algorithm. Case analysis shows that this is rather novel approach is very effective.
运用系统科学中的“吸引子”概念对问题求解的算法机理作了新的分析探讨,在此基础上提出了一种求解该
问题的近似算法思想,并设计了算法。实例分析表明,这种颇为新颖处理方法是非常有效的。-In this paper, the multi-traveling salesman problem is: to meet the triangle inequality enabling complete graph on a bi-objective optimization problem. The paper first application of systems science in the " attractor" concept of the problem-solving algorithm that gives a new analysis of the mechanism to explore, on this basis proposes a similar algorithm for solving the problem of thought, and design of the algorithm. Case analysis shows that this is rather novel approach is very effective.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
一种求解多旅行商问题的新型算法.pdf