Memetic strategies for global trajectory optimisation

Vasile, Massimiliano and Minisci, Edmondo; (2009) Memetic strategies for global trajectory optimisation. In: Advances in Computation and Intelligence. Lecture Notes in Computer Science, 5821 . Springer-Verlag Berlin, Berlin, pp. 180-190. ISBN 978-3-642-04842-5 (https://doi.org/10.1007/978-3-642-04843-2_20)

Full text not available in this repository.Request a copy

Abstract

Some types of space trajectory design problems present highly multimodal, globally non-convex objective functions with a large number of local minima, often nested. This paper proposes some memetic strategies to improve the performance of the basic heuristic of differential evolution when applied to the solution of global trajectory optimisation. In particular, it is often more useful to find families of good solutions rather than a single, globally optimal one. A rigorous testing procedure is introduced to measure the performance of a global optimisation algorithm. The memetic strategies are tested on a standard set of difficult trajectory optimisation problems.

ORCID iDs

Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465 and Minisci, Edmondo ORCID logoORCID: https://orcid.org/0000-0001-9951-8528;
CORE (COnnecting REpositories)