Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?

No abstract is available for this paper.

• Publication year

  2005

• Venue

  IEEE Congress on Evolutionary Computation

• Publication date

  2005-12-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/CEC.2005.1554930
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Solving constraint satisfaction problems with evolutionary algorithms

  2005cited by this paper
• Comparing evolutionary algorithms on binary constraint satisfaction problems

  2003cited by this paper
• Advances in Computational Intelligence

  2003cited by this paper
• A genetic local search algorithm for random binary constraint satisfaction problems

  2000cited by this paper
• SAW-ing EAs: adapting the fitness function for solving constrained problems

  1999cited by this paper
• On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems

  1998cited by this paper
• Graph Coloring with Adaptive Evolutionary Algorithms

  1998cited by this paper
• Random Constraint Satisfaction: Theory Meets Practice

  1998cited by this paper
• Evolutionary algorithms in theory and practice

  1997cited by this paper
• Adaptive Penalties for Evolutionary Graph Coloring

  1997cited by this paper
• Random Constraint Satisfaction: A More Accurate Picture

  1997cited by this paper
• Combining Constraint Processing and Genetic Algorithms for Constraint Satisfaction Problems

  1997cited by this paper
• Genetic algorithm involving coevolution mechanism to search for effective genetic information

  1997cited by this paper
• Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP

  1996cited by this paper
• Evolutionary Algorithms in Theory and Practice

  1996cited by this paper
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• Evolution and optimum seeking

  1995cited by this paper
• Solving constraint satisfaction problems using genetic algorithms

  1994cited by this paper
• Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm

  1994cited by this paper
• Co-evolutionary Constraint Satisfaction

  1994cited by this paper
• The Phase Transition and the Mushy Region in Constraint Satisfaction Problems

  1994cited by this paper
• Foundations of constraint satisfaction

  1993cited by this paper
• On the Expressiveness of Networks with Hidden Variables

  1990cited by this paper
• Tree Clustering for Constraint Networks

  1989cited by this paper
• GRAPHICAL EVOLUTION An Introduction to the Theory of Random Graphs (Wiley-Interscience Series in Discrete Mathematics)

  1987cited by this paper
• Graphical evolution: an introduction to the theory of random graphs

  1985cited by this paper
• Artificial Intelligence through Simulated Evolution

  1966cited by this paper
• Random Constraint Satisfaction a More Accurate Picture

  year unknowncited by this paper

• Meta-optimization of multi-objective population-based algorithms using multi-objective performance metrics

  2019cites this paper
• A Hybrid Evolutionary Algorithm for Maximizing Satisfiability in Temporal or Spatial Qualitative Constraints

  2018cites this paper
• Evolutionary Computation and Constraint Satisfaction

  2015cites this paper
• A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems

  2015cites this paper
• A novel heuristic memetic clustering algorithm

  2013cites this paper
• A new CSP graph-based representation for Ant Colony Optimization

  2013cites this paper
• Heuristics in dynamic scheduling: a practical framework with a case study in elevator dispatching

  2012cites this paper