![]() |
Volumn 1, Issue , 2010, Pages 497-500
|
An effective hybrid ant colony algorithm for solving the traveling salesman problem
|
Author keywords
Ant colony optimization (ACO); Minimum spanning tree (MST); Traveling salesman problem (TSP)
|
Indexed keywords
ACO ALGORITHMS;
ANT COLONIES;
ANT COLONY ALGORITHMS;
ANT-COLONY OPTIMIZATION;
COMBINATORIAL OPTIMIZATION PROBLEMS;
COMPUTING SPEED;
HIGHER EFFICIENCY;
HYBRID ALGORITHMS;
MINIMUM SPANNING TREES;
OPTIMAL PATHS;
OPTIMIZATION STRATEGY;
SEARCH RANGE;
TRAVELING SALESMAN;
COMBINATORIAL OPTIMIZATION;
COMPUTER SIMULATION;
GLOBAL OPTIMIZATION;
HEURISTIC ALGORITHMS;
PARALLEL ARCHITECTURES;
PROBLEM SOLVING;
TREES (MATHEMATICS);
TRAVELING SALESMAN PROBLEM;
|
EID: 77955813478
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICICTA.2010.731 Document Type: Conference Paper |
Times cited : (8)
|
References (8)
|