2016
DOI: 10.1007/s10100-016-0455-6
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the quality of online optimization algorithms by discrete event simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 37 publications
0
4
0
Order By: Relevance
“…Simulations allow evaluating the performances of such online algorithms based on multiple criteria. Furthermore, simulations can help with developing better online optimization algorithms for complex dynamic problems [9].…”
Section: Introductionmentioning
confidence: 99%
“…Simulations allow evaluating the performances of such online algorithms based on multiple criteria. Furthermore, simulations can help with developing better online optimization algorithms for complex dynamic problems [9].…”
Section: Introductionmentioning
confidence: 99%
“…Simulation allows evaluating the performance of such online algorithms on multiple criteria. Furthermore, simulation can help developing better online optimization algorithms for complex dynamic problems [9].…”
Section: Introductionmentioning
confidence: 99%
“…Metaheuristic algorithms can be divided into population-based-e.g., genetic algorithms (GA), particle swarm optimization (PSO), or ant colony optimization (ACO)-and single-solution-e.g., tabu search (TS), simulated annealing (SA), or iterated local search (ILS), just to name a few. According to Dunke and Nickel (2017), there are four different combinations of simulation with optimization techniques:…”
mentioning
confidence: 99%