Conference Paper

Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?

Napier Univ., Edinburgh, UK
DOI: 10.1109/CEC.2005.1554930 Conference: Evolutionary Computation, 2005. The 2005 IEEE Congress on, Volume: 3
Source: IEEE Xplore

ABSTRACT We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component to their performance by comparing the hybrid EAs with their "de-evolutionarised" variants. The experiments show that "de-evolutionarising" can increase performance, in some cases doubling it. Considering that the problem domain and the algorithms are arbitrarily selected from the "memetic niche", it seems likely that the same effect occurs for other problems and algorithms. Therefore, our conclusion is that after designing and building a memetic algorithm, one should perform a verification by comparing this algorithm with its "de-evolutionarised" variant.

Download full-text


Available from: Bart Craenen, Jun 18, 2015
1 Follower
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Tesis Univ. Granada. Departamento de Ciencias de la Computación e Inteligencia Artificial. Leída el 5 de octubre de 2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Constraint Satisfaction Problems (CSP) have been widely studied in several research areas like Artificial Intelligence or Operational Research due their complexity and industrial interest. From previous research areas, heuristic (informed) search methods have been particularly active looking for feasible approaches. One of the critical problems to work with CSP is related to the exponential growth of computational resources needed to solve even the simplest problems. This paper presents a new efficient CSP graph-based representation to solve CSP by using Ant Colony Optimization (ACO) algorithms. This paper presents also a new heuristic (called Oblivion Rate), that have been designed to improve the current state-of-the-art in the application of ACO algorithms on these domains. The presented graph construction provides a strong reduction in both, the number of connections and the number of nodes needed to model the CSP. Also, the new heuristic is used to reduce the number of pheromones in the system (allowing to solve problems with an increasing complexity). This new approach has been tested, as case study, using the classical N-Queens Problem. Experimental results show how the new approach works in both, reducing the complexity of the resulting CSP graph and solving problems with increasing complexity through the utilization of the Oblivion Rate.
    Evolutionary Computation (CEC), 2013 IEEE Congress on; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, in spite of its mediocre average performance can occasionally lead to excellent results.
    Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore; 01/2007