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

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 ϵ–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.

[1]  Massimiliano Vasile,et al.  Computing approximate solutions of scalar optimization problems and applications in space mission design , 2010, IEEE Congress on Evolutionary Computation.

[2]  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).

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

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

[5]  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.

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

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

[8]  Masao Iwamatsu,et al.  Locating All the Global Minima Using Multi-Species Particle Swarm Optimizer: The Inertia Weight and The Constriction Factor Variants , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

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

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

[12]  Massimiliano Vasile,et al.  An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization , 2011, IEEE Transactions on Evolutionary Computation.

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

[14]  Xiaodong Li,et al.  Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization , 2004, GECCO.

[15]  Marco Laumanns,et al.  Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms , 2010, Evolutionary Computation.

[16]  Xiaodong Li,et al.  Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology , 2010, IEEE Transactions on Evolutionary Computation.

[17]  De-Shuang Huang,et al.  Multi-sub-swarm particle swarm optimization algorithm for multimodal function optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Andries Petrus Engelbrecht,et al.  Locating multiple optima using particle swarm optimization , 2007, Appl. Math. Comput..

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

[20]  Antonina Starita,et al.  Particle swarm optimization for multimodal functions: a clustering approach , 2008 .

[21]  Kalyanmoy Deb,et al.  A Bi-criterion Approach to Multimodal Optimization: Self-adaptive Approach , 2010, SEAL.

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

[23]  Lei Peng,et al.  Optimization of the Earth-Moon low energy transfer with differential evolution based on uniform design , 2010, IEEE Congress on Evolutionary Computation.