A New Ant Supervised-PSO Variant Applied to Traveling Salesman Problem

HIS, pp. 87-101, 2015.

被引用9|引用|浏览1|来源
EI

摘要

The Traveling Salesman Problem (TSP) is one of the standard test problems often used for benchmarking of discrete optimization algorithms. Several meta-heuristic methods, including ant colony optimization (ACO), particle swarm optimization (PSO), bat algorithm, and others, were applied to the TSP in the past. Hybrid methods are generally ...更多

代码

数据

您的评分 :
0

 

标签
评论