Approximate solutions in space mission design

Tools

Schütze, Oliver and Vasile, Massimiliano and Coello Coello, Carlos A.; (2008) Approximate solutions in space mission design. In: Proceedings of the 10th international conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, 5199 . Springer-Velag, Berlin, Heidelberg, DEU, pp. 805-814. ISBN 9783540876991 (https://doi.org/10.1007/978-3-540-87700-4_80)

[thumbnail of Vasile M et al - Approximate solutions in space mission design Sep 2008] PDF. Filename: Vasile_M_et_al_Approximate_solutions_in_space_mission_design_Sep_2008.pdf
Final Published Version
Restricted to Registered users only
Download (1MB) | Request a copy

Abstract

In this paper, we address multi-objective space mission design problems. We argue that it makes sense from the practical point of view to consider in addition to the 'optimal' trajectories (in the Pareto sense) also approximate or nearly optimal solutions since this can lead to a significant larger variety for the decision maker. For this, we suggest a novel MOEA which is a modification of the well-known NSGA-II algorithm equipped with a recently proposed archiving strategy which aims for the storage of the set of approximate solution of a given MOP. Using this algorithm we will examine several space missions and demonstrate the benefit of the novel approach.

ORCID iDs

Schütze, Oliver, Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465 and Coello Coello, Carlos A.;
CORE (COnnecting REpositories)