Optimization with stochastic algorithms has become a relevant approach, specially, in problems with complex search spaces. Due to the stochastic nature of these algorithms, the assessment and comparison is not straightforward. Several performance measures have been proposed to overcome this difficulty. In this work, the use of performance profiles and an analysis integrating a trade-off between accuracy and precision are carried out for the comparison of two stochastic algorithms. Traditionally, performance profiles are used to compare deterministic algorithms. This methodology is applied in the comparison of two stochastic algorithms - genetic algorithms and simulated annealing. The results highlight the advantages and drawback...
Stochastic optimization algorithms have been growing rapidly in popularity over the last decade or t...
A new class of algorithms is introduced and analyzed for bound and linearly constrained optimization...
Benchmarks are important for comparing performance of optimisation algorithms, but we can select ins...
This paper proposes a statistical methodology for comparing the performance of stochastic optimizati...
Optimization with stochastic algorithms has become a relevant research field. Due to its stochastic ...
Reporting the results of optimization algorithms in evolutionary computation is a challenging task w...
Abstract This paper shows that, in case of an econometric model with a high sensitivity to data, usi...
In the present paper some metrics for evaluating the performance of evolutionary algorithms are cons...
Theoretical analyses of stochastic search algorithms, albeit few, have always existed since these al...
When a Genetic Algorithm (GA), or in general a stochastic algorithm, is employed in a statistical pr...
This paper proposes a statistical methodology for comparing the performance of evolutionary computat...
This paper theoretically compares the performance of simulated annealing and evolutionary algorithms...
Despite the continuous advancement of Evolutionary Algorithms (EAs) and their numerous successful ap...
Considering parameter optimization tasks, a fundamental advantage of the genetic algorithm lies in i...
In the literature there exist several stochastic methods for solving NP-hard optimization problems a...
Stochastic optimization algorithms have been growing rapidly in popularity over the last decade or t...
A new class of algorithms is introduced and analyzed for bound and linearly constrained optimization...
Benchmarks are important for comparing performance of optimisation algorithms, but we can select ins...
This paper proposes a statistical methodology for comparing the performance of stochastic optimizati...
Optimization with stochastic algorithms has become a relevant research field. Due to its stochastic ...
Reporting the results of optimization algorithms in evolutionary computation is a challenging task w...
Abstract This paper shows that, in case of an econometric model with a high sensitivity to data, usi...
In the present paper some metrics for evaluating the performance of evolutionary algorithms are cons...
Theoretical analyses of stochastic search algorithms, albeit few, have always existed since these al...
When a Genetic Algorithm (GA), or in general a stochastic algorithm, is employed in a statistical pr...
This paper proposes a statistical methodology for comparing the performance of evolutionary computat...
This paper theoretically compares the performance of simulated annealing and evolutionary algorithms...
Despite the continuous advancement of Evolutionary Algorithms (EAs) and their numerous successful ap...
Considering parameter optimization tasks, a fundamental advantage of the genetic algorithm lies in i...
In the literature there exist several stochastic methods for solving NP-hard optimization problems a...
Stochastic optimization algorithms have been growing rapidly in popularity over the last decade or t...
A new class of algorithms is introduced and analyzed for bound and linearly constrained optimization...
Benchmarks are important for comparing performance of optimisation algorithms, but we can select ins...