Sciweavers

697 search results - page 5 / 140
» Improving EAs for Sequencing Problems
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Elitist generational genetic chromodynamics - a new radii-based evolutionary algorithm for multimodal optimization
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
Catalin Stoean, Mike Preuss, Ruxandra Gorunescu, D...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 9 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
PPSN
2010
Springer
13 years 6 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 2 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
EVOW
2005
Springer
14 years 1 months ago
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Ev...
Robert Cleary, Michael O'Neill