Picture of DNA strand

Pioneering chemical biology & medicinal chemistry through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Pure & Applied Chemistry, based within the Faculty of Science.

Research here spans a wide range of topics from analytical chemistry to materials science, and from biological chemistry to theoretical chemistry. The specific work in chemical biology and medicinal chemistry, as an example, encompasses pioneering techniques in synthesis, bioinformatics, nucleic acid chemistry, amino acid chemistry, heterocyclic chemistry, biophysical chemistry and NMR spectroscopy.

Explore the Open Access research of the Department of Pure & Applied Chemistry. Or explore all of Strathclyde's Open Access research...

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.