2009
DOI: 10.1007/s10898-009-9477-0
|View full text |Cite
|
Sign up to set email alerts
|

The oracle penalty method

Abstract: Constrained optimization, Global optimization, Penalty function, Stochastic metaheuristic, Ant colony optimization, MIDACO-Solver, Mixed integer nonlinear programming (MINLP),

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
63
0
1

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 101 publications
(64 citation statements)
references
References 22 publications
0
63
0
1
Order By: Relevance
“…Stability studies of the solutions have been performed, which show this optimization method provides most often with local maxima. Better rejection rates may be obtained, for example, by using a global optimization based on the Ant algorithm [48]. We tested it on a a small subset of variables, which yielded promising results.…”
Section: Nimentioning
confidence: 99%
“…Stability studies of the solutions have been performed, which show this optimization method provides most often with local maxima. Better rejection rates may be obtained, for example, by using a global optimization based on the Ant algorithm [48]. We tested it on a a small subset of variables, which yielded promising results.…”
Section: Nimentioning
confidence: 99%
“…The evolutionary algorithm within MIDACO is based on the ant colony optimization metaheuristic for continuous search domains proposed by Socha and Dorigo [26] and was extended to mixed-integer domains by Schlueter et al in [17]. For constrained optimization problems the algorithm applies the Oracle Penalty Method which was introduced in Schlueter and Gerdts [18]. While the MIDACO algorithm is conceptually designed as general black-box solver, it has proven its effectiveness especially on challenging interplanetary space trajectory design problems (see Schlueter [21]), where it holds several best known record solutions on benchmarks provided by the European Space Agency [5].…”
Section: Midaco Algorithmmentioning
confidence: 99%
“…To treat four constraints efficiently, we employ the oracle penalty method [10] in which penalty is dynamically controlled. This method allows us to avoid the situation that the penalty becomes overwhelmingly dominant in F. …”
Section: A Problem Settingmentioning
confidence: 99%