|
Volumn 5484 LNCS, Issue , 2009, Pages 117-122
|
Discrete particle swarm optimization for multiple destination routing problems
|
Author keywords
Multiple destination routing problems; Particle swarm optimization (PSO); Steiner tree problem.
|
Indexed keywords
COMPLEX PROBLEMS;
DISCRETE PARTICLE SWARM OPTIMIZATION;
FAST CONVERGENCE;
FASTER CONVERGENCE;
GA-BASED ALGORITHM;
GLOBAL SEARCH ABILITY;
GLOBAL SEARCH ALGORITHM;
MULTIPLE DESTINATION ROUTING PROBLEMS;
MULTIPLE DESTINATIONS;
NP COMPLETE;
STEINER TREE PROBLEM.;
COMPUTER SCIENCE;
CONVERGENCE OF NUMERICAL METHODS;
HEURISTIC ALGORITHMS;
HEURISTIC METHODS;
LEARNING ALGORITHMS;
PARTICLE SWARM OPTIMIZATION (PSO);
|
EID: 67650685261
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-642-01129-0_15 Document Type: Conference Paper |
Times cited : (19)
|
References (7)
|