Jump to content

Great deluge algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 01:29, 9 October 2006 (moved Great Deluge Algorithm to Great Deluge algorithm: downcasing per conventions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Great Deluge algorithm is an general algorithm applied to optimization problems. It is similar in many ways to hill-climbing and simulated annealing algorithms.

References

  • Gunter Dueck: "New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel", Technical report, IBM Germany, Heidelberg Scientific Center, 1990.
  • Gunter Dueck: "New Optimization Heuristics The Great Deluge Algorithm and the Record-to-Record Travel", Journal of Computational Physics, Volume 104, Issue 1, p. 86-92, 1993

See also