An agent-based algorithm for generalized graph colorings

Thang N. Bui, Thanh Vu H. Nguyen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. Using a standard method for preprocessing the input, the same algorithm can also be used to solve the Multicoloring and Bandwidth Multicoloring problems. In the algorithm a number of agents, called ants, each of which colors a portion of the graph, collaborate to obtain a coloring of the entire graph. This coloring is then further improved by a local optimization algorithm. Experimental results on a set of benchmark graphs for these generalized coloring problems show that this algorithm performs very well compared to other heuristic approaches.

Original languageEnglish (US)
Title of host publicationGECCO 2006 - Genetic and Evolutionary Computation Conference
PublisherAssociation for Computing Machinery
Pages19-26
Number of pages8
ISBN (Print)1595931864, 9781595931863
DOIs
StatePublished - 2006
Event8th Annual Genetic and Evolutionary Computation Conference 2006 - Seattle, WA, United States
Duration: Jul 8 2006Jul 12 2006

Publication series

NameGECCO 2006 - Genetic and Evolutionary Computation Conference
Volume1

Other

Other8th Annual Genetic and Evolutionary Computation Conference 2006
Country/TerritoryUnited States
CitySeattle, WA
Period7/8/067/12/06

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

Dive into the research topics of 'An agent-based algorithm for generalized graph colorings'. Together they form a unique fingerprint.

Cite this