Dynamic strategy based parallel ant colony optimization on GPUs for TSPs

Metaheuristics are a type of approximate optimization algorithms for solving hard and complex problems in science and engineering[1].They can be defined as algorithm templates that can be easily adapted to solve specific optimization problems.Motivated by search behavior,most researchers divide meta...

Full description

Saved in:
Bibliographic Details
Published inScience China. Information sciences Vol. 60; no. 6; pp. 256 - 258
Main Authors Zhou, Yi, He, Fazhi, Qiu, Yimin
Format Journal Article
LanguageEnglish
Published Beijing Science China Press 01.06.2017
Springer Nature B.V
Subjects
Algorithms
Ant colony optimization
Cities
Computer Science
Construction
Efficiency
GPU
Highlight
Information Systems and Communication Service
Optimization
优化问题
工程问题
并行
旅行商问题
求解
蚁群算法
近似算法
068102
Online AccessGet full text
ISSN1674-733X
1869-1919
DOI10.1007/s11432-015-0594-2

Cover

More Information
Summary:Metaheuristics are a type of approximate optimization algorithms for solving hard and complex problems in science and engineering[1].They can be defined as algorithm templates that can be easily adapted to solve specific optimization problems.Motivated by search behavior,most researchers divide metaheuristics into two classes：trajectory-based and population-based[1].
Bibliography:11-5847/TP
Metaheuristics are a type of approximate optimization algorithms for solving hard and complex problems in science and engineering[1].They can be defined as algorithm templates that can be easily adapted to solve specific optimization problems.Motivated by search behavior,most researchers divide metaheuristics into two classes：trajectory-based and population-based[1].
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-015-0594-2