121 search results - page 2 / 25 » SAT-decoding in evolutionary algorithms for discrete constra... |
PPSN
1998
Springer
13 years 9 months ago
1998
Springer
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
ICTAI
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...