Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Approximate solutions in space mission design

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, Berlin, pp. 805-814. ISBN 9783540876991

[img] PDF (Vasile M et al - Approximate solutions in space mission design Sep 2008)
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 from the Strathclyde author

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.