Great deluge algorithm: Difference between revisions

Revision as of 19:56, 10 November 2007

Latest revision as of 03:59, 24 October 2022

(8 intermediate revisions by 7 users not shown)

Line 1:

The '''Great Delugedeluge algorithm''' ('''GD''') is a generic algorithm applied to [[Optimization (mathematics)|optimization]] problems. It is similar in many ways to the [[hill-climbing]] and [[simulated annealing]] algorithms.

The algorithm is clearly inspired by the [[simulated annealing]] idea in other optimization algorithms. The name comes from the analogy that in a great deluge a person climbing a hill will try to move up the hill in any direction that does not get his/her feet wet in the hope of finding a way up as the water level rises.

In a typical implementation of the GD, the algorithm usually startstarts with a poor approximation, ''S'', of the optimum solution. A numerical value called the ''badness'' thatis computed based on ''S'' and it measures how undesirable the initial approximation is calculated. The higher the value of ''badness'', the more undesirable is the approximate solution. Another numerical value called the ''tolerance'' is calculated based on a number of factors, often including the initial badness.

A new approximate solution '' S' '', called a neighbour of ''S'', is calculated based on ''S''. The badness of '' S' '', '' b' '', is computed and compared with the tolerance. If '' b' '' is better than tolerance, then the algorithm is recursively restarted with ''S'' : = '' S' '', and ''tolerance'' := ''decay(tolerance)'' where ''decay'' is a function that lowers the tolerance (representing a rise in water levels). If '' b' '' is worse than tolerance, a different neighbour '' S* '' of ''S'' is chosen and the process repeated. If all the neighbours of ''S'' produce worse approximate solutions beyond ''tolerance'', then the algorithm is terminated and ''S'' is put forward as the best approximate solution obtained.

==See also==

* [[:de:Gunter Dueck|de:Gunter Dueck]]

==References==

Line 11 ⟶ 14:

* 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

[[Category:Optimization algorithms and methods]]

==See also==

* [http://de.wikipedia.org/wiki/Gunter_Dueck de:Gunter Dueck]

[[Category:Optimization algorithms]]

{{Optimization algorithms}}

[[de:Sintflutalgorithmus]]