Sciweavers

2694 search results - page 245 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 12 months ago
An effective use of crowding distance in multiobjective particle swarm optimization
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
Carlo R. Raquel, Prospero C. Naval Jr.
LCN
1997
IEEE
15 years 10 months ago
The Optimal Virtual Path Design of ATM Networks
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
Zhigang Qin, Tetiana Lo, Felix F. Wu
TEC
2010
203views more  TEC 2010»
15 years 1 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
ESCIENCE
2006
IEEE
16 years 15 days ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus
CEC
2008
IEEE
16 years 28 days ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...