Distributed Collective Adaptation Applied to a Hard Combinatorial Optimization Problem   [CA] [CO] [OP]

by

Haynes, T.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the 1999 ACM Symposium on Applied Computing (Conference proceedings), 1999, p. 339-343
Keywords:genetic algorithms, genetic programming
Abstract:
We use collective memory to [CM] integrate weak and strong search heuristics to [SH] find cliques in FC, a family of graphs. We construct FC such that pruning partial solutions will be ineffective. Each weak heuristic maintains a local cache of the collective memory. [CM] We examine the impact on the distributed search of the distribution of the collective memory, [CM] the search algorithms, [SA] and our family of graphs. We find the distributed search performs better than the individual searches, even though the space of partial solutions is combinatorial.
Notes:
(GA track)
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{Haynes:1999:DCAa,
  author =       "Thomas Haynes",
  title =        "Distributed Collective Adaptation Applied to a Hard
                 Combinatorial Optimization Problem",
  booktitle =    "Proceedings of the 1999 ACM Symposium on Applied
                 Computing",
  year =         "1999",
  editor =       "Janice Carroll and Hisham Haddad and Dave Oppenheim
                 and Barrett Bryant and Gary B. Lamont",
  pages =        "339--343",
  publisher =    "ACM Press",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://adept.cs.twsu.edu/~thomas/mpi.ps",
  abstract =     "We use collective memory to integrate weak and strong
                 search heuristics to find cliques in FC, a family of
                 graphs. We construct FC such that pruning partial
                 solutions will be ineffective. Each weak heuristic
                 maintains a local cache of the collective memory. We
                 examine the impact on the distributed search of the
                 distribution of the collective memory, the search
                 algorithms, and our family of graphs. We find the
                 distributed search performs better than the individual
                 searches, even though the space of partial solutions is
                 combinatorial.",
  notes =        "(GA track)",
}