2180 search results - page 171 / 436 » Comparing bio-inspired algorithms in constrained optimizatio... |
128
Voted
SAC
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
110
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The objectives of this paper are to describe a steady-state version of the Age-Layered Population Structure (ALPS) Evolutionary Algorithm (EA) and to compare it against other GAs ...
104
Voted
IJCAI
1989
15 years 4 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
151
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
140
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...