Algorithms: their complexity and efficiency (2nd ed.)
Algorithms: their complexity and efficiency (2nd ed.)
Almost all k-colorable graphs are easy to color
Journal of Algorithms
An O(n0.4)-approximation algorithm for 3-coloring
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The greedy coloring is a bad probabilistic algorithm
Journal of Algorithms
Proceedings of the fourth international conference on Genetic algorithms
Proceedings of the fourth international conference on Genetic algorithms
New methods to color the vertices of a graph
Communications of the ACM
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic algorithms with multi-parent recombination
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
GA-easy and GA-hard Constraint Satisfaction Problems
Constraint Processing, Selected Papers
Evolutionary Computation
Weighting for godot: learning heuristics for GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Coloration Neighbourhood Search With Forward Checking
Annals of Mathematics and Artificial Intelligence
UEGO, an Abstract Clustering Technique for Multimodal Global Optimization
Journal of Heuristics
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
An Experimental Investigation of Iterated Local Search for Coloring Graphs
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Message Routing and Scheduling in Optical Multistage Networks Using Simulated Annealing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
An Immunological Approach to Combinatorial Optimization Problems
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Graph Colouring by Maximal Evidence Edge Adding
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Adapting the Fitness Function in GP for Data Mining
Proceedings of the Second European Workshop on Genetic Programming
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
A Fast and Simple Local Search for Graph Coloring
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Comparison of Genetic Programming Variants for Data Classification
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Genetic algorithms and timetabling
Advances in evolutionary computing
Improving crossover operator for real-coded genetic algorithms using virtual parents
Journal of Heuristics
Metaheuristics can solve sudoku puzzles
Journal of Heuristics
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Discrete Applied Mathematics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A partitioned portfolio insurance strategy by a relational genetic algorithm
Expert Systems with Applications: An International Journal
Computers and Operations Research
Combinatorial optimization in system configuration design
Automation and Remote Control
CIXL2: a crossover operator for evolutionary algorithms based on population features
Journal of Artificial Intelligence Research
A conflict based SAW method for constraint satisfaction problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Evolutionary computing for the satisfiability problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
A relation-based genetic algorithm for partitioning problems with applications
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Multi-objective Genetic Algorithms for grouping problems
Applied Intelligence
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
New order-based crossovers for the graph coloring problem
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A clonal selection algorithm for coloring, hitting set and satisfiability problems
WIRN'05 Proceedings of the 16th Italian conference on Neural Nets
Application of the grouping genetic algorithm to university course timetabling
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
A partitioned portfolio insurance strategy by relational genetic algorithm
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
A genetic algorithm to minimize chromatic entropy
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A hybrid artificial bee colony algorithm for graph 3-coloring
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
International Journal of Applied Metaheuristic Computing
Solving graph coloring problem by fuzzy clustering-based genetic algorithm
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Computational Optimization and Applications
CHECKCOL: Improved local search for graph coloring
Journal of Discrete Algorithms
| Hi-index | 0.00 |
This paper presents the results of an experimentalinvestigation on solving graph coloring problems with EvolutionaryAlgorithms (EAs). After testing different algorithm variants weconclude that the best option is an asexual EA using order-basedrepresentation and an adaptation mechanism that periodically changesthe fitness function during the evolution. This adaptive EA isgeneral, using no domain specific knowledge, except, of course, fromthe decoder (fitness function). We compare this adaptive EA to apowerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topologyand edge density. The results show that the adaptive EA is superiorto the Grouping (GA) and outperforms DSatur on the hardest probleminstances. Furthermore, it scales up better with the problem sizethan the other two algorithms and indicates a linear computationalcomplexity.