DDS: Difference between revisions

From BlueM
Jump to navigation Jump to search
m (Umbenennung EVO.NET -> BlueM.Opt)
Line 2: Line 2:


==Beschreibung==
==Beschreibung==
'''Dynamically Dimensioned Search''' (DDS) is an n-dimensional continuous global optimization algorithm by {{:Literatur:Tolson-Shoemaker_2007}}.
'''Dynamically Dimensioned Search''' (DDS) is an n-dimensional continuous global optimization algorithm by {{:Literatur:Tolson-Shoemaker_2007}}. DDS does not allow multi-objective optimizations. Multithreading is not supported either.


<blockquote>
<blockquote>

Revision as of 03:28, 30 June 2009

EVO.png BlueM.Opt | Download | Usage | Development

Beschreibung

Dynamically Dimensioned Search (DDS) is an n-dimensional continuous global optimization algorithm by Tolson & Shoemaker (2007)[1]. DDS does not allow multi-objective optimizations. Multithreading is not supported either.

DDS is designed for calibration problems with many parameters, requires no algorithm parameter tuning, and automatically scales the search to find good solutions within the maximum number of user-specified function (or model) evaluations. As a result, DDS is ideally suited for computationally expensive optimization problems such as distributed watershed model calibration.[1]

Erforderliche Eingabedateien

Literaturangaben

  1. ↑ 1.0 1.1 Tolson, B. A., and C. A. Shoemaker (2007): Dynamically dimensioned search algorithm for computationally efficient watershed model calibration, Water Resources Research 43, W01413, doi:10.1029/2005WR004723.
Retrieved from "https://wiki.bluemodel.org/index.php?title=DDS&oldid=6463"