Sciweavers

21 search results - page 2 / 5
» A parallel evolutionary algorithm for unconstrained binary q...
Sort
View
PPSN
2010
Springer
13 years 3 months ago
A Study of Multi-parent Crossover Operators in a Memetic Algorithm
Using unconstrained binary quadratic programming problem as a case study, we investigate the role of multi-parent crossover operators within the memetic algorithm framework. We eva...
Yang Wang, Zhipeng Lü, Jin-Kao Hao
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 9 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
PPSN
1998
Springer
13 years 9 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
MP
2010
163views more  MP 2010»
13 years 1 days ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
13 years 10 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom