433 search results - page 23 / 87 » Dynamic-probabilistic particle swarms |
ESWA
2010
13 years 6 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
ASIAMS
2008
IEEE
14 years 2 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
GPEM
2006
13 years 7 months ago
2006
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...