Abstract
In the present paper some metrics for evaluating the performance of evolutionary algorithms are considered. The capabilities of two different optimisation approaches are compared on three test cases, represented by the optimisation
of orbital transfer trajectories. The complexity of the problem of ranking stochastic algorithms by means of quantitative indices is analyzed by means of a large sample of runs, so as to derive statistical properties of the indices in order to evaluate their usefulness in understanding the actual algorithm capabilities
and their possible intrinsic limitations in providing reliable information.
of orbital transfer trajectories. The complexity of the problem of ranking stochastic algorithms by means of quantitative indices is analyzed by means of a large sample of runs, so as to derive statistical properties of the indices in order to evaluate their usefulness in understanding the actual algorithm capabilities
and their possible intrinsic limitations in providing reliable information.
Original language | English |
---|---|
Title of host publication | IEEE Congress on Evolutionary Computation |
Publisher | IEEE |
Pages | 350-357 |
Volume | 1-5 |
DOIs | |
Publication status | Published - 18 May 2009 |
Event | IEEE Congress on Evolutionary Computation - Trondheim, Norway Duration: 18 May 2009 → 21 May 2009 |
Publication series
Name | IEEE Congress on Evolutionary Computation |
---|
Conference
Conference | IEEE Congress on Evolutionary Computation |
---|---|
Country/Territory | Norway |
City | Trondheim |
Period | 18/05/09 → 21/05/09 |
Keywords
- evolutionary algorithms
- orbital transfer trajectories
- orbit transfer manoeuvres