DDS: Difference between revisions
Jump to navigation
Jump to search
m (category) |
|||
| Line 17: | Line 17: | ||
<references/> | <references/> | ||
[[Kategorie:BlueM.Opt | [[Kategorie:BlueM.Opt]] | ||
Latest revision as of 04:04, 22 January 2018
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
- OPT-Datei
- MOD-Datei
- ZIE-Datei
- CON-Datei (werden Constraints bei DDS überhaupt berücksichtigt? -- Froehlich 10:45, 17. Dez. 2008 (UTC))