Almost all k-colorable graphs are easy to color
Journal of Algorithms
New methods to color the vertices of a graph
Communications of the ACM
Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
Graph Coloring with Adaptive Evolutionary Algorithms
Journal of Heuristics
An Adaptive Mutation Scheme for a Penalty-Based Graph-Colouring GA
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A New Genetic Local Search Algorithm for Graph Coloring
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Phase-Transition Niche for Evolutionary Algorithms in Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Extensions to a Memetic Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Some Observations about GA-Based Exam Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A multistage evolutionary algorithm for the timetable problem
IEEE Transactions on Evolutionary Computation
Graph Colouring by Maximal Evidence Edge Adding
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
An Evolutionary Algorithm for Solving the School Time-Tabling Problem
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Computers and Operations Research
A memetic algorithm for course timetabling
Proceedings of the 13th annual conference on Genetic and evolutionary computation
New order-based crossovers for the graph coloring problem
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
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
Information Sciences: an International Journal
Quotient geometric crossovers and redundant encodings
Theoretical Computer Science
Genetic programming for auction based scheduling
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Semantic components for timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Feature selection in a fuzzy student sectioning algorithm
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
International Journal of Applied Metaheuristic Computing
Course timetabling using evolutionary operators
Applied Soft Computing
A particle swarm optimizer for grouping problems
Information Sciences: an International Journal
| Hi-index | 0.00 |
It has frequently been reported that pure genetic algorithms for graph colouring are in general outperformed by more conventional methods. There is every reason to believe that this is mainly due to the choice of an unsuitable encoding of solutions. Therefore, an alternative representation, based on the grouping character of the graph colouring problem, was chosen. Furthermore, a fitness function defined on the set of partitions of vertices, guiding the Grouping Genetic Algorithm well in the search, was developed. This algorithm has been applied to a choice of hard-to-colour graph examples, with good results. It has also been extended to the application to real-world timetabling problems. As a by-product, phase transition regions of a class of randomly generated graphs have been located.