Preliminary spacecraft design by means of structured-chromosome genetic algorithms

Gentile, Lorenzo and Filippi, Gianluca and Minisci, Edmondo and Vasile, Massimiliano and Bartz-Beielstein, Thomas; (2020) Preliminary spacecraft design by means of structured-chromosome genetic algorithms. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, GBR. ISBN 9781728169309

[thumbnail of Gentile-etal-IEEE-WCCI-2020-Preliminary-spacecraft-design-by-means-of-Structured-chromosome]
Preview
Text (Gentile-etal-IEEE-WCCI-2020-Preliminary-spacecraft-design-by-means-of-Structured-chromosome)
Gentile_etal_IEEE_WCCI_2020_Preliminary_spacecraft_design_by_means_of_Structured_chromosome.pdf
Accepted Author Manuscript

Download (732kB)| Preview

    Abstract

    This paper presents a new methodology for complex system design by means of optimisation techniques. Within the Model-based Engineering approach, optimisation algorithms are used to explore optimal solutions of highly coupled and nonlinear systems. In such scenario, the optimal technology has to be identified and its settings have to be optimised. Relying on optimisation strategies for both the challenges brings to complex mixed-variable problem formulations involving continuous, integer and categorical parameters. Furthermore, part of the parameters are required only if certain technologies are adopted, bringing to variable-size formulations that standard optimisers cannot manage. Therefore, the proposed methodology relies on the use of variable-size mixed-variable global optimiser Structured-Chromosome Genetic Algorithm (SCGA). The advantages of this new method are shown by applying it for solving a space system preliminary design. In particular, two variants have been implemented distinguished by two different levels of complexity. To better appreciate the proposed approach, the same problems have been reformulated to be treated by a well known and appreciated optimiser in the field of spacecraft design, Multi– Population Adaptive Inflationary Differential Evolution Algorithm (MP–AIDEA). The final results of the two approaches are compared and commented.

    ORCID iDs

    Gentile, Lorenzo, Filippi, Gianluca, Minisci, Edmondo ORCID logoORCID: https://orcid.org/0000-0001-9951-8528, Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465 and Bartz-Beielstein, Thomas;