Best practices for comparing optimization algorithms

Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. W...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization and engineering Ročník 18; číslo 4; s. 815 - 848
Hlavní autoři: Beiranvand, Vahid, Hare, Warren, Lucet, Yves
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2017
Springer Nature B.V
Témata:
Algorithms
Benchmarks
Control
Engineering
Environmental Management
Financial Engineering
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Optimization algorithms
Systems Theory
Optimization algorithms
Benchmarking
Algorithm comparison
Software
Metric
Timing
Performance
Guidelines
Testing
ISSN:1389-4420, 1573-2924
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide suggestions for each step of the comparison process and highlight the pitfalls to avoid when evaluating the performance of optimization algorithms. We also discuss various methods of reporting the benchmarking results. Finally, some suggestions for future research are presented to improve the current benchmarking process.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-4420
1573-2924
DOI:10.1007/s11081-017-9366-1