A Multilevel k-way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{langham:1999:AMPAFEMCAC,

• author = "A. E. Langham and P. W. Grant",
• title = "A Multilevel k-way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies",
• booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference",
• year = "1999",
• editor = "Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith",
• volume = "2",
• pages = "1602--1608",
• address = "Orlando, Florida, USA",
• publisher_address = "San Francisco, CA 94104, USA",
• month = "13-17 " # jul,
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming, ACO, real world applications, ant systems",
• ISBN = "1-55860-611-4",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/RW-715.pdf",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/RW-715.ps",
• size = "7 pages",
• abstract = "The self–organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for resources. Using Genetic Programming, a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of the global environment corresponding to a good partition. Multiple colonies allows for simultaneous k-way partitioning which can provide better partitions than current algorithms which are based on recursive bisection.",
• notes = "GECCO-99 A joint meeting of the eighth international conference on genetic algorithms (ICGA-99) and the fourth annual genetic programming conference (GP-99)",

}

Genetic Programming entries for A E Langham Phil W Grant

Citations