Adaptive Penalties for Evolutionary Graph Coloring

  title={Adaptive Penalties for Evolutionary Graph Coloring},
  author={Agoston E. Eiben and J. K. van der Hauw},
  booktitle={Artificial Evolution},
  • A. Eiben, J. Hauw
  • Published in Artificial Evolution 1 October 1997
  • Computer Science
In this paper we consider a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW) and show its working on graph coloring problems. SAW-ing technically belongs to the penalty function based approaches and amounts to modifying the penalty function during the search. We show that it has a twofold benefit. First, it proves to be rather insensitive to its technical parameters, thereby providing a general, problem independent way to handle constrained problems… 

A Study of Evaluation Functions for the Graph K-Coloring Problem

A new evaluation function for the well-known graph K-coloring problem is introduced that takes into account not only the number of conflicting vertices, but alsoherent information related to the structure of the graph.

Comparing evolutionary algorithms on binary constraint satisfaction problems

This paper presents a concise overview and an extensive performance comparison of all these EAs for solving constraint satisfaction problems (CSP) on a systematically generated test suite of random binary CSPs using a theoretical model based on a random problem instance generator.

Test problems and representations for graph evolution

This study fills in a gap in the literature by presenting two scalable families of benchmark functions that are matching the eccentricity sequences of graphs, the second is locating graphs that are relatively easy to color non-optimally.

Solving Temporal Constraint Satisfaction Problems with Heuristic Based Evolutionary Algorithms

The results show that heuristics do not promise better performance for solving TCSPs and the basic genetic algorithm and microgenetic iterative descendant are the most effective ones.

A New Crossover for Solving Constraint Satisfaction Problems

This paper proposes a novel crossover specifically designed for solving CSPs, which enables the solving of large and hard problem instances and is able to compete with the efficient MAC-based Abscon 109 solver for random problem instances.

New Low Cost and Undedicated Genetic Operators title

The mutation and cross-over operators are, with selection, the foundation of genetic algorithms. We show in this paper, some possibilities offered by these operators. Having explained the specificity

A New Parallel GA-Based Method for Constraint Satisfaction Problems

This work proposes a novel crossover specifically designed for solving CSPs including Temporal C SPs (TCSPs), which enables the solving of large and hard problem instances and is able to compete with the efficient MAC-based Abscon 109 solver for random problem instances.

SAWing on symmetry

The behavior of mutation-based evolutionary algorithms on highly symmetric binary constraint satisfaction problems is investigated with empirical methods and it is observed that SAWing has little effect when the local optima of the symmetric problems are not very strong.

Chapter 10 How to Handle Constraints with Evolutionary Algorithms

The conclusion is reached that EAs can be effective constraint solvers when knowledge about the constraints is incorporated either into the genetic operators, in the fitness function, or in repair mechanisms.

Evolutionary Computation and Constraint Satisfaction

This chapter focuses on the combination of evolutionary computation techniques and constraint satisfaction problems (CSP s) and an important prelude to the work covered here as it advocates itself as an alternative approach to programming.



Graph Coloring with Adaptive Evolutionary Algorithms

The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances and scales up better with the problem size than the other two algorithms.

Solving 3-SAT by GAs adapting constraint weights

  • A. EibenJ.K. van der Hauw
  • Computer Science
    Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
  • 1997
This paper presents a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW), and applies it for solving the 3-SAT problem, and proves that the SAW mechanism substantially increases GA performance.

Exploring the k-colorable landscape with Iterated Greedy

  • J. CulbersonF. Luo
  • Mathematics, Computer Science
    Cliques, Coloring, and Satisfiability
  • 1993
This work introduces several heuristics for generating new permutations that are fast when implemented and eeective in reducing the coloring number and explores the areas of diiculty in probabilistic graph space under several parameterizations.

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization. Simulated annealing

Almost All k-Colorable Graphs are Easy to Color

  • J. Turner
  • Mathematics, Computer Science
    J. Algorithms
  • 1988

The Greedy Coloring Is a Bad Probabilistic Algorithm

  • L. Kucera
  • Mathematics, Computer Science
    J. Algorithms
  • 1991

New methods to color the vertices of a graph

An exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs and the new heuristic methods, the classical methods, and the exact method are compared.

Intelligent Structural Operators for the k-way Graph Partitioning Problem

A parallel genetic algorithm for the graph partitioning problem is presented which combines general heuris tic algorithms with techniques that are described in evolution theory In the parallel

An application of graph coloring to printed circuit testing

Under certain assumptions on the possible types of short circuits, the structure of line-of-sight graphs is analyzed and it is shown that a well-known and efficient algorithm can be used to color them with a small number of colors.

Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems

This work presents three strategies that dramatically improve GSAT's performance on formulas with a high degree of asymmetry, thereby significantly extending the applicability of the GSAT algorithm.