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

On the detection of nearly optimal solutions in the context of single-objective space mission design problems

Schutze, O. and Lara, A. and Coello Coello, Carlos A. and Vasile, Massimiliano (2011) On the detection of nearly optimal solutions in the context of single-objective space mission design problems. Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, 225 (11). pp. 1229-1242. ISSN 0954-4100

[img]
Preview
PDF
Vasile_M_On_the_detection_of_nearly_otimal_solutions_in_the_context_of_cingel_objective_space_mission_design_problems_Nov_2011.pdf - Preprint

Download (971kB) | Preview

Abstract

When making decisions, having multiple options available for a possible realization of the same project can be advantageous. One way to increase the number of interesting choices is to consider, in addition to the optimal solution x*, also nearly optimal or approximate solutions; these alternative solutions differ from x* and can be in different regions – in the design space – but fulfil certain proximity to its function value f(x*). The scope of this article is the efficient computation and discretization of the set E of e–approximate solutions for scalar optimization problems. To accomplish this task, two strategies to archive and update the data of the search procedure will be suggested and investigated. To make emphasis on data storage efficiency, a way to manage significant and insignificant parameters is also presented. Further on, differential evolution will be used together with the new archivers for the computation of E. Finally, the behaviour of the archiver, as well as the efficiency of the resulting search procedure, will be demonstrated on some academic functions as well as on three models related to space mission design.