Computing the set of Epsilon-efficient solutions in multiobjective space mission design

Oliver Schütze, Massimiliano Vasile, Carlos A. Coello Coello

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose.
LanguageEnglish
Pages53-70
Number of pages18
JournalJournal of Aerospace Computing, Information, and Communication
Volume8
Issue number3
DOIs
Publication statusPublished - Mar 2011

Fingerprint

Asteroids
Evolutionary algorithms
Earth (planet)
Trajectories

Keywords

  • computing
  • space mission design
  • linear velocity

Cite this

@article{e5f3a18ab2d74e85bc77927c76251434,
title = "Computing the set of Epsilon-efficient solutions in multiobjective space mission design",
abstract = "In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose.",
keywords = "computing, space mission design, linear velocity",
author = "Oliver Sch{\"u}tze and Massimiliano Vasile and {Coello Coello}, {Carlos A.}",
year = "2011",
month = "3",
doi = "10.2514/1.46478",
language = "English",
volume = "8",
pages = "53--70",
journal = "Journal of Aerospace Information Systems",
issn = "2327-3097",
number = "3",

}

Computing the set of Epsilon-efficient solutions in multiobjective space mission design. / Schütze, Oliver; Vasile, Massimiliano; Coello Coello, Carlos A.

In: Journal of Aerospace Computing, Information, and Communication , Vol. 8, No. 3, 03.2011, p. 53-70.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Computing the set of Epsilon-efficient solutions in multiobjective space mission design

AU - Schütze, Oliver

AU - Vasile, Massimiliano

AU - Coello Coello, Carlos A.

PY - 2011/3

Y1 - 2011/3

N2 - In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose.

AB - In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose.

KW - computing

KW - space mission design

KW - linear velocity

UR - http://www.aiaa.org/content.cfm?pageid=318&pubid=127&volume=8&issue=3&etoc=1

U2 - 10.2514/1.46478

DO - 10.2514/1.46478

M3 - Article

VL - 8

SP - 53

EP - 70

JO - Journal of Aerospace Information Systems

T2 - Journal of Aerospace Information Systems

JF - Journal of Aerospace Information Systems

SN - 2327-3097

IS - 3

ER -