Current Status of the EMOO Repository, Including Current and Future Research Trends

In this talk, Ill present some statistics of the EMOO repository (delta.cs.cinvestav.mx/~ccoello/EMOO/), emphasizing some of the trends that have been detected in terms of basic research and applications of multi-objective evolutionary algorithms. For example, Ill discuss the remarkable increase in PhD theses related to EMOO, as well as the number of journal papers and exposure of the area in evolutionary computation conferences. Finally, some (potential) future research trends will also be discussed

A Study of the Combination of Variation Operators in the NSGA-II Algorithm

Multi-objective evolutionary algorithms rely on the use of variation operators as their basic mechanism to carry out the evolutionary process. These operators are usually fixed and applied in the same way during algorithm execution, e.g., the mutation probability in genetic algorithms. This paper analyses whether a more dynamic approach combining different operators with variable application rate along the search process allows to improve the static classical behavior. This way, we explore the combined use of three different operators (simulated binary crossover, differential evolution’s operator, and polynomial mutation) in the NSGA-II algorithm. We have considered two strategies for selecting the operators: random and adaptive. The resulting variants have been tested on a set of 19 complex problems, and our results indicate that both schemes significantly improve the performance of the original NSGA-II algorithm, achieving the random and adaptive variants the best overall results in the bi- and three-objective considered problems, respectively.UNIVERSIDAD DE MÁLAGA. CAMPUS DE EXCELENCIA INTERNACIONAL ANDALUCÍA TEC

Artificial Immune System for Solving Global Optimization Problems

In this paper, we present a novel model of an artificial immune system (AIS), based on the process that suffers the T-Cell. The proposed model is used for global optimization problems. The model operates on four populations: Virgins, Effectors (CD4 and CD8) and Memory. Each of them has a different role, representation and procedures. We validate our proposed approach with a set of test functions taken from the specialized literature, we also compare our results with the results obtained by different bio-inspired approaches and we statistically analyze the results gotten by our approach.Fil: Aragon, Victoria Soledad. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo En Inteligencia Computacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico San Luis; ArgentinaFil: Esquivel, Susana C.. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional; ArgentinaFil: Coello Coello, Carlos A.. CINVESTAV-IPN; Méxic

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

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

Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP

Recently, a framework for the approximation of the entire set of $\epsilon$-efficient solutions (denote by $E_\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such an algorithm produces -- under mild assumptions on the process to generate new candidate solutions --a sequence of archives which converges to $E_{\epsilon}$ in the limit and in the probabilistic sense. The result, though satisfactory for most discrete MOPs, is at least from the practical viewpoint not sufficient for continuous models: in this case, the set of approximate solutions typically forms an $n$-dimensional object, where $n$ denotes the dimension of the parameter space, and thus, it may come to perfomance problems since in practise one has to cope with a finite archive. Here we focus on obtaining finite and tight approximations of $E_\epsilon$, the latter measured by the Hausdorff distance. We propose and investigate a novel archiving strategy theoretically and empirically. For this, we analyze the convergence behavior of the algorithm, yielding bounds on the obtained approximation quality as well as on the cardinality of the resulting approximation, and present some numerical results

A new memetic strategy for the numerical treatment of multi-objective optimization problems

In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry of the directional cones of such optimization problems, and is capable both of moving toward and along the (local) Pareto set depending on the distance of the current iterate toward this set. Next, we give one possible way of integrating this local search procedure into a given EMO algorithm result-ing in a novel memetic strategy. Finally, we present some numerical results on some well-known benchmark problems indicating the strength of both the local search strategy as well as the new hybrid approach

On the automatic design of multi‑objective particle swarm optimizers: experimentation and analysis.

Research in multi-objective particle swarm optimizers (MOPSOs) progresses by proposing one new MOPSO at a time. In spite of the commonalities among different MOPSOs, it is often unclear which algorithmic components are crucial for explaining the performance of a particular MOPSO design. Moreover, it is expected that different designs may perform best on different problem families and identifying a best overall MOPSO is a challenging task. We tackle this challenge here by: (1) proposing AutoMOPSO, a flexible algorithmic template for designing MOPSOs with a design space that can instantiate thousands of potential MOPSOs; and (2) searching for good-performing MOPSO designs given a family of training problems by means of an automatic configuration tool (irace). We apply this automatic design methodology to generate a MOPSO that significantly outperforms two state-of-the-art MOPSOs on four well-known bi-objective problem families. We also identify the key design choices and parameters of the winning MOPSO by means of ablation. FAutoMOPSO is publicly available as part of the jMetal framework.Funding for open access charge: Universidad de Málaga / CBU

MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms

We examine the model-building issue related to multi-objective estimation of distribution algorithms (MOEDAs) and show that some of their, as yet overlooked, characteristics render most current MOEDAs unviable when addressing optimization problems with many objectives. We propose a novel model-building growing neural gas (MB-GNG) network that is specially devised for properly dealing with that issue and therefore yields a better performance. Experiments are conducted in order to show from an empirical point of view the advantages of the new algorithm.assigned to this paper for their comments and suggestions. They helped to substantially improve the paper. They also wish to thank Prof. Elisenda Molina for her assistance in the preparation of the manuscript. LM, JG, AB and JMM were supported by projects CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM CONTEXTS S2009/TIC-1485 and DPS2008-07029- C02-02. CACC was supported by CONACyT project 103570.Publicad