Sciweavers

187 search results - page 2 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
CEC
2008
IEEE
14 years 1 months ago
Dynamic adaptation and multiobjective concepts in a particle swarm optimizer for constrained optimization
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Jorge Isacc Flores-Mendoza, Efrén Mezura-Mo...
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 18 days ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
CEC
2005
IEEE
14 years 22 days ago
Ecology-inspired evolutionary algorithm using feasibility-based grouping for constrained optimization
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
Ming Yuchi, Jong-Hwan Kim
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 19 days ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan