### 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 language | English (US) |
---|---|

Title of host publication | GECCO 2006 - Genetic and Evolutionary Computation Conference |

Publisher | Association for Computing Machinery |

Pages | 19-26 |

Number of pages | 8 |

ISBN (Print) | 1595931864, 9781595931863 |

DOIs | |

State | Published - 2006 |

Event | 8th Annual Genetic and Evolutionary Computation Conference 2006 - Seattle, WA, United States Duration: Jul 8 2006 → Jul 12 2006 |

### Publication series

Name | GECCO 2006 - Genetic and Evolutionary Computation Conference |
---|---|

Volume | 1 |

### Other

Other | 8th Annual Genetic and Evolutionary Computation Conference 2006 |
---|---|

Country | United States |

City | Seattle, WA |

Period | 7/8/06 → 7/12/06 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

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

## Cite this

*GECCO 2006 - Genetic and Evolutionary Computation Conference*(pp. 19-26). (GECCO 2006 - Genetic and Evolutionary Computation Conference; Vol. 1). Association for Computing Machinery. https://doi.org/10.1145/1143997.1144001