IEEE Congress on Evolutionary Computation 2010
DOI: 10.1109/cec.2010.5586406
|View full text |Cite
|
Sign up to set email alerts
|

ABC, a new performance tool for algorithms solving dynamic optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…where G is the total number of generations and the pA 1 (x) and pA 2 (x) are the functions (for algorithms A1 and A2) that are to be replaced with a measure of population quality including average best of generation, offline performance value, offline error value [1]. ABC value can be positive and negative, where a negative value indicates that algorithm A1 performs better than A2 for a minimization problem.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…where G is the total number of generations and the pA 1 (x) and pA 2 (x) are the functions (for algorithms A1 and A2) that are to be replaced with a measure of population quality including average best of generation, offline performance value, offline error value [1]. ABC value can be positive and negative, where a negative value indicates that algorithm A1 performs better than A2 for a minimization problem.…”
Section: Resultsmentioning
confidence: 99%
“…As our last experiment, we consider the area between curves (ABC) metric [1], which is a new metric that quantifies the distance between the performance curves of each pair of algorithms. It is the difference of area below performance curves, which is calculated with the trapezoidal method for consecu- …”
Section: Resultsmentioning
confidence: 99%
“…Contrarily to this pattern, the area between curves (ABC) [62] is a behavior-based metric that does not require any assumptions about optimal solutions. This is illustrated in Figure 1, which depicts the performance fronts of two dynamic optimizers (left-most plots).…”
Section: Assessing the Anytime Behavior Of A Dynamic Optimizermentioning
confidence: 99%
“…They are: final-quality based and behaviorbased measures. However, both of them have been indiscriminately assessed concerning number of iterations, function evaluations, or solutions generated [25,21,7,22,1,2,18]. The rationale behind these resource consumption measures his understanding by how much algorithms are able to improve solutions within a given iteration, or after a fixed number of function evaluations/solutions generated.…”
Section: Experimental Studymentioning
confidence: 99%