A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem

  title={A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem},
  author={Petrică C. Pop and Bin Hu and G{\"u}nther R. Raidl},
In this paper we propose a memetic algorithm (MA) for the partition graph coloring problem. Given a clustered graph G = (V,E), the goal is to find a subset V * i¾? V that contains exactly one node for each cluster and a coloring for V * so that in the graph induced by V *, two adjacent nodes have different colors and the total number of used colors is minimal. In our MA we use two distinct solution representations, one for the genetic operators and one for the local search procedure, which are… 
An Ant Algorithm for the Partition Graph Coloring Problem
The computational results show that compared to a state-of-the-art algorithms, the ACO algorithm achieves solid results in very short run-times.
The Complexity of the Partition Coloring Problem
The complexity status of the Partition Coloring Problem is shown with three parameters: the number of colors, thenumber of parts of the partition, and the maximum size of each part of the partitions.
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis
An integer linear programming formulation for the Generalized Minimum Branch Vertices problem is proposed, the dimension of the polytope is derived, the trivial inequalities are studied and two new classes of valid inequalities are introduced, that are proved to be facet-defining.
Constructing operating theatre schedules using partitioned graph colouring techniques
The results show that the utilisation of post-operative beds can be increased, whilst the number of cancellations can be decreased, which may ultimately lead to greater patient throughput and reduced waiting times.
Theory and Applications of Models of Computation: 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings
It is proved that any infinite Rogers prsemilattice is dense and does not have minimal elements, and the reducibility ≤ among punctual numberings, which gives rise to upper semilattices of degrees, which are called Rogers pr-se Milattices.
Memetic Algorithms for Business Analytics and Data Science: A Brief Survey
This chapter reviews applications of Memetic Algorithms in the areas of business analytics and data science and gives emphasis to the large number of applications in business and consumer analytics that were published between January 2014 and May 2018.


A memetic algorithm for graph coloring
A Memetic Algorithm for the Partition Graph Coloring Problem
This paper analyzes the complexity for some special graph classes obtained by considering classical network design problems on a clustered graph where the original problem’s feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes.
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = lQ1,…,Qqr is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
This work considers two approaches for solving the classical minimum vertex coloring problem, constraint programming and column generation, and extends the solution approaches to a generalization of the problem known as the minimum vertex graph multicoloring problem, where a given number of colors has to be assigned to each vertex.
A Column Generation Approach for Graph Coloring
This work uses a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree to solve small to moderate size problems quickly.
Coloring by tabu branch and bound
An adaptive depth procedure for coloring a graph that combines elements of tabu search and branch and bound, and employs a concept of color conditioned dependency to permit shrinking of the graph at appropriate stages to assure optimality.
Selective Graph Coloring in Some Special Classes of Graphs
This paper considers the selective graph coloring problem, and investigates the complexity status of this problem in various classes of graphs.
A Branch-and-Cut Algorithm for the Partition Coloring Problem
Let G = (V,E) be an undirected graph, where E is the set of edges and V is the set of vertices. Furthermore, let Q = {Q1, . . . , Qq} be a partition of V into q subsets such that Q1 ∪ . . .∪Qq = V