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.
VasileM.De PascaleP.Preliminary design of multiple gravity-assist trajectories. J. Spacecraft Rockets, 2006, 43(4), 5–22.
2.
Vasile, M., Minisci, E., and Locatelli, M. A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems. In Proceedings of the 2009 IEEE Congress on Evolutionary computation (CEC 2009), Trondheim, 18–21 May 2009, pp. 2340–2347.
3.
OldsA. D.KlueverC. A.CupplesM. L.Interplanetary mission design using differential evolution. J. Spacecraft Rockets, 2007, 44(5), 1060–1070.
4.
Peng, L., Wang, Y. Z., Dai, G. M., Chang, Y. M., and Chen, F. J. Optimization of the Earth-Moon low energy transfer with differential evolution based on uniform design. In Proceedings of the 2010 IEEE Congress on Evolutionary computation (CEC 2010), Barcelona, 18–23 July 2010, pp. 1–8.
5.
Schütze, O., Coello Coello, C. A., and Talbi, E.-G. Approximating the ϵ-efficient set of an MOP with stochastic search algorithms. In Mexican International Conference on Artificial intelligence (MICAI 2007) (Eds A. Gelbukh and A. F. Kuri Morales), Agnascaliontes, Mexico, 4–10 November 2007, pp. 128–138 (Springer-Verlag, Berlin/Heidelberg).
6.
SchützeO.Coello CoelloC. A.TantarE.TalbiE.-G.Computing finite size representations of the set of approximate solutions of an mop with stochastic search algorithms. 2008, Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), Atlanta, Georgia, USA, 12–16 July (ACM, New York, USA) 713–720.
7.
Schütze, O., Vasile, M., and Coello Coello, C. A. Approximate solutions in space mission design. In Proceedings of the 10th International Conference on Parallel problem solving from nature (PPSN 2008), Dortmund, Germany, 13–17 September 2008, pp. 805–814.
8.
Schütze, O., Lara, A., Coello Coello, C. A., and Vasile, M. Computing approximate solutions of scalar optimisation problems and applications in spacemission design. In Proceedings of the 2010 IEEE Congress on Evolutionary computation (CEC '10), Barcelona, Spain, 18–23 July 2010, pp. 1654–1661.
9.
LiJ.-P.BalazsM. E.ParksG. T.ClarksonP. J.A species conserving genetic algorithmformultimodal function optimization. Evolut. Comput., 2002, 10(3), 207–234.
10.
Li, X. Adaptively choosing neighbourhood bests using species in a particle swarm optimizer for multimodal function optimization. In Proceedings of the Conference on Genetic and evolutionary computation (GECCO '04), Seatle, USA, 1 June 2004, pp. 105–116 (Springer-Verlag).
11.
Iwamatsu, M. Locating all the global minima using multi-species particle swarm optimizer: The inertia weight and the constriction factor variants. In Proceedings of the 2006 IEEE Congress on Evolutionary computation (CEC '06), Vancouver, Canada, 16–21 July 2006, pp. 816–822.
12.
ZhangJ.HuangD.-S.LiuK.-H.Multi-sub-swarm particle swarm optimization algorithm for multimodal function optimization. Proceedings of the 2007 IEEE Congress on Evolutionary computation (CEC '07), Singapore, 25–28 September 20073215–3220.
13.
BritsR.EngelbrechtA. P.van den BerghF.Locating multiple optima using particle swarm optimization. App. Math. Comput., 2007, 189(2), 1859–1883.
14.
VitelaJ. E.CastañosO.A real-coded niching memetic algorithm for continuous multimodal function optimization. IEEE Congress on Evolutionary computation (CEC 2008), Hong Kong, China, 1–6 June, 20082170–2177.
15.
PassaroA.StaritaA.Particle swarm optimization for multimodal functions: a clustering approach. J. Artif. Evol. Appl., 2008, 8(2), 1–15.
16.
LiX.Niching without niching parameters: Particle swarm optimization using a ring topology. IEEE Trans. Evolut. Comput., February 2010, 14(1), 150–169.
17.
Saha, A. and Deb, K. A bi-criterion approach to multimodal optimization: Self-adaptive approach. In Simulated evolution and learning (Eds K. Deb et al.), vol. 6457, Lecture Notes in Computer Science, 2010, pp. 95–104 (Springer, Berlin/Heidelberg).
18.
VasileM.LocatelliM.A hybrid multiagent approach for global trajectory optimization. J. Global Optim., 2009, 44(4), 461–479.
19.
LaumannsM.ThieleL.DebK.ZitzlerE.Combining convergence and diversity in evolutionarymultiobjective optimization. Evolut. Comput., 2002, 10(3), 263–282.
20.
Schütze, O., Coello Coello, C. A., Tantar, E., and Talbi, E.-G. Computing a finite size representation of the set of approximate solutions of an MOP. INRIA Research Report, Technical Report 6492, 2008.
21.
SchützeO.LaumannsM.Coello CoelloC. A.DellnitzM.TalbiE.-G.Convergence of stochastic search algorithms to finite size Pareto set approximations. J. Global Optim., 2008, 41(4), 559–577.
22.
SchützeO.LaumannsM.TantarE.Coello CoelloC. A.TalbiE.-G.Computing gap free Pareto front approximations with stochastic search algorithms. Evolut. Comput., 2010, 18(1), 65–96.
23.
PriceK. V.StornR. M.LampinenJ. A.Differential evolution: a practical approach to global optimization, 2005 (Springer Verlag.
24.
VasileM.MinisciE.LocatelliM.An inflationary differential evolution algorithm for space trajectory optimization. IEEE Trans. Evolut. Comput. (to appear), .
