Sciweavers

121 search results - page 1 / 25
» SAT-decoding in evolutionary algorithms for discrete constra...
Sort
View
CEC
2007
IEEE
13 years 11 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
13 years 10 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
13 years 9 months ago
Biogeography-based optimization with blended migration for constrained optimization problems
Biogeography-based optimization (BBO) is a new evolutionary algorithm based on the science of biogeography. We propose two extensions to BBO. First, we propose blended migration. ...
Haiping Ma, Dan Simon
CEC
2009
IEEE
13 years 11 months ago
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
CEC
2009
IEEE
13 years 9 months ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...