Memetic Strategies for Global Trajectory Optimisation

Vasile, M. and Minisci, E. (2009) Memetic Strategies for Global Trajectory Optimisation. In: Advances in Computation and Intelligence, Proceedings. Series: Lecture Notes in Computer Science (5821). Springer-Verlag: Berlin, pp. 180-190. ISBN 978-3-642-04842-5

Full text not currently available from Enlighten.

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.

Item Type:Book Sections
Additional Information:4th International Symposium on Intelligence Computation and Applications, Huangshi, PEOPLES R CHINA, OCT 23-25, 2009 Series ISSN: 0302-9743
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Minisci, Dr Edmondo and Vasile, Dr Massimiliano
Authors: Vasile, M., and Minisci, E.
College/School:College of Science and Engineering > School of Engineering > Aerospace Sciences
Publisher:Springer-Verlag
ISBN:978-3-642-04842-5

University Staff: Request a correction | Enlighten Editors: Update this record