Article

Stepwise Adaption of Weights with Refinement and Decay on Constraint Satisfaction Problems

09/2002;
Source: CiteSeer

ABSTRACT Adaptive fitness functions have led to very successful evolutionary algorithms (EA) for various types of constraint satisfaction problems (CSPs). In this paper we consider one particular fitness function adaptation mechanism, the so called Stepwise Adaption of Weights (SAW). We compare algorithm variants including two penalty systems and we experiment with extensions of the SAW mechanism utilizing a refinement function and a decay function. Experiments are executed on binary CSP instances generated by a recently proposed method (method E).

1 Bookmark
 · 
85 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: There are several evolutionary approaches for solving ran- dom binary CSPs. In most of these strategies we nd a complex use of information regarding the problem at hand. Here we present a hybrid GRASP-Evolutionary Algorithm that outperforms previous approaches in terms of eectiv eness and compares well in terms of eciency . Our algorithm is conceptual and simple, featuring a GRASP-like mechanism for genotype-to-phenotype mapping; moreover, it faces the problem as a search for an optimal variable ordering, a novel approach within this framework. Therefore, we provide a nice algorithm that harnesses gen- erality while boosting performance.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: ter verkrijging van de graad Doctor aan de Vrije Universiteit Amsterdam, op gezag van de rector magnificus prof.dr. T. Sminia, in het openbaar te verdedigen ten overstaan van de promotiecommissie van de faculteit der Exacte Wetenschappen op donderdag 24 november 2005 om 13.45 uur in de aula van de universiteit, De Boelelaan 1105 door Bartolomeus Gerardus Wilhelmus Craenen geboren te Den Helder
    Computer Science, VU University Amsterdam, 11/2005, Degree: PhD, Supervisor: A.E. Eiben
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: There are several evolutionary approaches for solving ran-dom binary Constraint Satisfaction Problems (CSPs). In most of these strategies we find a complex use of informa-tion regarding the problem at hand. Here we present a hy-brid Evolutionary Algorithm that outperforms previous ap-proaches in terms of effectiveness and compares well in terms of efficiency. Our algorithm is conceptual and simple, fea-turing a GRASP-like (GRASP stands for Greedy Random-ized Adaptive Search Procedure) mechanism for genotype-to-phenotype mapping, and without considering any specific knowledge of the problem. Therefore, we provide a simple algorithm that harnesses generality while boosting perfor-mance.

Full-text (2 Sources)

Download
73 Downloads
Available from
May 29, 2014