Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs

DOI10.1007/BF02430368MaRDI QIDQ1922632zbMATH OpenOpenAlexFDO

Authors D. G. Costa, Alain Hertz, Olivier Dubuis

Publication date 1995

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02430368

zbMATH Keywords

\(q\)-stability numberchromatic numbercoloring problemsevolutionary procedureoptimization problemssequential methods

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Mathematical economics (91B99)

Recommendations

• Hybrid evolutionary algorithms for graph coloring
• scientific article; zbMATH DE number 1342294
• Two novel evolutionary formulations of the graph coloring problem
• Graph coloring with adaptive evolutionary algorithms
• Evolutionary Computation in Combinatorial Optimization

Cites work

• A user's guide to tabu search
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
• An exact algorithm for the maximum stable set problem
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• Evolution algorithms in combinatorial optimization
• Genetic algorithms: Foundations and applications
• Genetic and hybrid algorithms for graph coloring
• scientific article; zbMATH DE number 3769673 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 714533 (Why is no real title available?)
• scientific article; zbMATH DE number 1082103 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Minimax relations for the partial q-colorings of a graph
• New methods to color the vertices of a graph
• Optimization by simulated annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Polynomially solvable cases for the maximum stable set problem
• Scatter search and star-paths: Beyond the genetic metaphor
• Simulated annealing: A tool for operational research
• Some experiments with simulated annealing for coloring graphs
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• Using tabu search techniques for graph coloring

Cited in

(12)

• What is my objective function?
• A variable neighborhood search for graph coloring.
• A framework for the description of evolutionary algorithms
• Coloring large graphs based on independent set extraction
• Metaheuristics: A bibliography
• An adaptive memory algorithm for the k-coloring problem
• An improved ant colony optimisation heuristic for graph colouring
• A survey of local search methods for graph coloring
• A graph coloring approach to the deployment scheduling and unit assignment problem
• scientific article; zbMATH DE number 1342294 (Why is no real title available?)
• Adaptive memory programming: a unified view of metaheuristics
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Describes a project that uses

Uses Software

• TABARIS

This page was built for publication: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922632)