Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
From MaRDI portal
Publication:2377173
DOI10.1007/s10589-012-9496-5zbMath1270.05039arXiv1301.0939MaRDI QIDQ2377173
Marjan Mernik, Iztok Fister, Bogdan Filipič
Publication date: 28 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0939
local search; evolutionary algorithms; constraint satisfaction; self-adaptation; graph 3-coloring; heuristic genotype-phenotype mapping; neutral survivor selection operator; swap local search heuiristic
90C59: Approximation methods and heuristics in mathematical programming
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- An introduction to timetabling
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Variable space search for graph coloring
- A memetic algorithm for graph coloring
- A randomised 3-colouring algorithm
- Graph coloring with adaptive evolutionary algorithms
- Improving heuristics for the frequency assignment problem
- On a graph-theoretical model for cyclic register allocation
- A variable neighborhood search for graph coloring.
- Neutrality and self-adaptation
- Future paths for integer programming and links to artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A graph-based hyper-heuristic for educational timetabling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An adaptive memory algorithm for the \(k\)-coloring problem
- A survey of local search methods for graph coloring
- A Metaheuristic Approach for the Vertex Coloring Problem
- A survey on vertex coloring problems
- Almost all k-colorable graphs are easy to color
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An application of graph coloring to printed circuit testing
- New methods to color the vertices of a graph
- Bag rationalisation for a food manufacturer
- Graph Colorings
- Chromatic Scheduling and the Chromatic Number Problem
- Introduction to evolutionary computing
