A Structure-Driven Genetic Algorithm for Graph Coloring

2021 ◽  
Vol 25 (3) ◽  
Author(s):  
José Carlos Aguilar-Canepa ◽  
Rolando Menchaca-Mendez ◽  
Ricardo Menchaca-Mendez ◽  
Jesus García
Keyword(s):  
Genetic Algorithm ◽  
Graph Coloring

scholarly journals Computing strong metric dimension of some special classes of graphs by genetic algorithms

2008 ◽  
Vol 18 (2) ◽  
pp. 143-151 ◽  
Author(s):  
Jozef Kratica ◽  
Vera Kovacevic-Vujcic ◽  
Mirjana Cangalovic
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Graph Coloring ◽  
Crew Scheduling ◽  
Metric Dimension ◽  
Hard Problem ◽  
Genetic Operators ◽  
Strong Metric Dimension ◽  
Np Hard Problem ◽  
Special Classes

In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem. This represents the first attempt to solve this problem heuristically. We report experimental results for the two special classes of ORLIB test instances: crew scheduling and graph coloring.

Sign in / Sign up

Export Citation Format

Share Document