Computing approximate solutions of scalar optimization problems and applications in space mission design

In many applications it can be advantageous for the decision maker to have multiple options available for a possible realization of the project. One way to increase the number of interesting choices is in certain cases to consider in addition to the optimal solution x∗ also nearly optimal or approximate solutions which differ in the design space from x∗ by a certain value. In this paper we address the efficient computation and discretization of the set E of ∊-approximate solutions for scalar optimization problems. For this we will suggest two strategies to archive and update the data coming from the generation process of the search procedure, and will use Differential Evolution coupled with the new archivers for the computation of E. Finally, we will demonstrate the behavior of the archiver empirically on some academic functions as well as on two models related to space mission design.

[1]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[2]  P. John Clarkson,et al.  A Species Conserving Genetic Algorithm for Multimodal Function Optimization , 2002, Evolutionary Computation.

[3]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[4]  Massimiliano Vasile,et al.  Preliminary Design of Low-Thrust Multiple Gravity-Assist Trajectories , 2006 .

[5]  E. Talbi,et al.  Approximating the -Efficient Set of an MOP with Stochastic Search Algorithms , 2007 .

[6]  Carlos A. Coello Coello,et al.  Approximating the epsilon -Efficient Set of an MOP with Stochastic Search Algorithms , 2007, MICAI.

[7]  Michael Cupples,et al.  Interplanetary Mission Design Using Differential Evolution , 2007 .

[8]  Carlos A. Coello Coello,et al.  Computing finite size representations of the set of approximate solutions of an MOP with stochastic search algorithms , 2008, GECCO '08.

[9]  Javier E. Vitela,et al.  A real-coded niching memetic algorithm for continuous multimodal function optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  Massimiliano Vasile,et al.  Approximate Solutions in Space Mission Design , 2008, PPSN.

[11]  Carlos A. Coello Coello,et al.  Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP , 2008, ArXiv.

[12]  Marco Laumanns,et al.  Convergence of stochastic search algorithms to finite size pareto set approximations , 2008, J. Glob. Optim..

[13]  Massimiliano Vasile,et al.  A hybrid multiagent approach for global trajectory optimization , 2009, J. Glob. Optim..

[14]  Massimiliano Vasile,et al.  A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[15]  Edmondo Minisci,et al.  Analysis of Some Global Optimization Algorithms for Space Trajectory Design , 2010 .

[16]  Massimiliano Vasile,et al.  On the Preliminary Design of Multiple Gravity-Assist Trajectories , 2011, ArXiv.