0
喜欢
0
书签
声明论文
A new hybrid heuristic approach for solving large traveling salesman problem   
摘  要:   This paper presents a new metaheuristic approach called ACOMAC algorithm for solving the traveling salesman problem (TSP). We introduce multiple ant clans' concept from parallel genetic algorithm to search solution space utilizing various islands to avoid local minima ...
发  表:   Information Sciences  2004

论文统计图
共享有4个版本
 [展开全部版本] 

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜