Paper Info
Title
Gravitational Swarm Approach for Graph Coloring.
Abstract
We introduce a new nature inspired algorithm to solve the Graph Coloring Problem (GCP): the Gravitational Swarm. The Swarm is composed of agents that act individually, but that can solve complex computational problems when viewed as a whole. We formulate the agent's behavior to solve the GCP. Agents move as particles in the gravitational field defined by some target objects corresponding to graph node colors. Knowledge of the graph to be colored is encoded in the agents as friend-or-foe information. We discuss the convergence of the algorithm and test it over well-known benchmarking graphs, achieving good results in a reasonable time.
Year
DOI
Venue
2011
10.1007/978-3-642-24094-2_11
Studies in Computational Intelligence
Field
DocType
Volume
Convergence (routing),Particle swarm optimization,Mathematical optimization,Computational problem,Swarm behaviour,Gravitational field,Swarm intelligence,Theoretical computer science,Greedy coloring,Mathematics,Graph coloring
Conference
387
ISSN
Citations 
PageRank 
1860-949X
4
0.40
References 
Authors
11
2
Name
Order
Citations
PageRank
Israel Rebollo Ruiz1184.33
Manuel Graña Romay2411157.98