Memetic Algorithm to Solve Graph Coloring Problem
نویسندگان
چکیده
منابع مشابه
Quantum-Inspired Evolutionary Algorithm to Solve Graph Coloring Problem
Graph Coloring Problem (GCP) bears an enormous significance to the researchers in the field of soft computing. In this paper, we demonstrate a Quantum-Inspired Evolutionary Algorithm (QEA) to solve GCP. We use two dimensional arrays of Q-bits called Q-bit individual to produce binary individual. Q-gate operation is applied as a variation operator on Q-bit individuals. In traditional evolutionar...
متن کاملA complete algorithm to solve the graph-coloring problem
The Graph k-Colorability Problem (GCP) is a well known NP-hard problem which consist in finding the k minimum number of colors to paint the vertices of a graph in such a way that any two vertices joined by an edge have always different colors. Many years ago, Simulated Annealing (SA) was used for graph coloring task obtaining good results; however SA is not a complete algorithm and it not alway...
متن کاملModified cuckoo optimization algorithm (MCOA) to solve graph coloring problem
In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...
متن کاملA memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and the number of used colors k is minimized. This paper presents a memetic algorithm (denoted by MACOL) for solving the problem of graph coloring. The proposed MACOL algorithm integrates several distinguished features such ...
متن کاملA Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem
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 ∗ ⊂ 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 soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Theory and Engineering
سال: 2013
ISSN: 1793-8201
DOI: 10.7763/ijcte.2013.v5.817