Tendencias de la inteligencia computacional

This article presents those results derived from a systematic review of the literature focused on the recognition of computational intelligence worldwide. The methodological development was constituted in four different facets: - the elaboration of search equations, - the verification of the quality and relevance of the documents, - the elaboration of schemes for the recognition of the trends, - the investigation of confluences and differences. 55 articles from the Scopus® and Web of Science® databases were examined in VOSviewer® software for the construction and visualization of bibliometric networks and term concurrence; resulting in machine learning, classification, artificial intelligence, feature selection, algorithm classification, neural networks, intelligent systems among others. This study yields results from various fields of evolutionary learning for data collection to provide new and diverse faster applications, allowing data optimization and new prediction strategies or tools.  Este artículo expone aquellos resultados derivados de una revisión sistemática de literatura enfocada al reconocimiento de la inteligencia computacional a nivel mundial. Se constituyó el desarrollo metodológico en cuatro diferentes facetas: - la elaboración de ecuaciones de búsqueda, - la comprobación de la calidad y pertinencia de los documentos, - la elaboración de esquemas para el reconocimiento de las tendencias, - la investigación de confluencias y diferencias. Se examinaron 55 artículos procedentes de las bases de datos de Scopus® y Web of Science®, en el software VOSviewer® para la construcción y visualización de redes bibliométricas y concurrencia de términos; dando como resultado Aprendizaje automático, Clasificación, Inteligencia artificial, Selección de características, Clasificación de algoritmos, Redes neuronales, Sistemas inteligentes entre otras. Este estudio arroja resultados de diversos campos de aprendizaje evolutivo para la recopilación de datos para brindar nuevas y diversas aplicaciones más vertiginosas, permitiendo una optimización de datos y nuevas estrategias u herramientas de predicción

A decomposition-based multiobjective evolutionary algorithm with angle-based adaptive penalty

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.A multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem (MOP) into a number of scalar optimization subproblems and optimizes them in a collaborative manner. In MOEA/D, decomposition mechanisms are used to push the population to approach the Pareto optimal front (POF), while a set of uniformly distributed weight vectors are applied to maintain the diversity of the population. Penalty-based boundary intersection (PBI) is one of the approaches used frequently in decomposition. In PBI, the penalty factor plays a crucial role in balancing convergence and diversity. However, the traditional PBI approach adopts a fixed penalty value, which will significantly degrade the performance of MOEA/D on some MOPs with complicated POFs. This paper proposes an angle-based adaptive penalty (AAP) scheme for MOEA/D, called MOEA/D-AAP, which can dynamically adjust the penalty value for each weight vector during the evolutionary process. Six newly designed benchmark MOPs and an MOP in the wastewater treatment process are used to test the effectiveness of the proposed MOEA/D-AAP. Comparison experiments demonstrate that the AAP scheme can significantly improve the performance of MOEA/D

MOEA/D-Based Probabilistic PBI Approach for Risk-Based Optimal Operation of Hybrid Energy System with Intermittent Power Uncertainty

The stochastic nature of intermittent energy resources has brought significant challenges to the optimal operation of the hybrid energy systems. This article proposes a probabilistic multiobjective evolutionary algorithm based on decomposition (MOEA/D) method with two-step risk-based decision-making strategy to tackle this problem. A scenario-based technique is first utilized to generate a stochastic model of the hybrid energy system. Those scenarios divide the feasible domain into several regions. Then, based on the MOEA/D framework, a probabilistic penalty-based boundary intersection (PBI) with gradient descent differential evolution (GDDE) algorithm is proposed to search the optimal scheme from these regions under different uncertainty budgets. To ensure reliable and low risk operation of the hybrid energy system, the Markov inequality is employed to deduce a proper interval of the uncertainty budget. Further, a fuzzy grid technique is proposed to choose the best scheme for real-world applications. The experimental results confirm that the probabilistic adjustable parameters can properly control the uncertainty budget and lower the risk probability. Further, it is also shown that the proposed MOEA/D-GDDE can significantly enhance the optimization efficiency.National Natural Science Fund; National Natural Science Key Fund

A convergence and diversity guided leader selection strategy for many-objective particle swarm optimization

Recently, particle swarm optimizer (PSO) is extended to solve many-objective optimization problems (MaOPs) and becomes a hot research topic in the field of evolutionary computation. Particularly, the leader particle selection (LPS) and the search direction used in a velocity update strategy are two crucial factors in PSOs. However, the LPS strategies for most existing PSOs are not so efficient in high-dimensional objective space, mainly due to the lack of convergence pressure or loss of diversity. In order to address these two issues and improve the performance of PSO in high-dimensional objective space, this paper proposes a convergence and diversity guided leader selection strategy for PSO, denoted as CDLS, in which different leader particles are adaptively selected for each particle based on its corresponding situation of convergence and diversity. In this way, a good tradeoff between the convergence and diversity can be achieved by CDLS. To verify the effectiveness of CDLS, it is embedded into the PSO search process of three well-known PSOs. Furthermore, a new variant of PSO combining with the CDLS strategy, namely PSO/CDLS, is also presented. The experimental results validate the superiority of our proposed CDLS strategy and the effectiveness of PSO/CDLS, when solving numerous MaOPs with regular and irregular Pareto fronts (PFs)

A localized decomposition evolutionary algorithm for imbalanced multi-objective optimization

Multi-objective evolutionary algorithms based on decomposition (MOEA/Ds) convert a multi-objective optimization problem (MOP) into a set of scalar subproblems, which are then optimized in a collaborative manner. However, when tackling imbalanced MOPs, the performance of most MOEA/Ds will evidently deteriorate, as a few solutions will replace most of the others in the evolutionary process, resulting in a significant loss of diversity. To address this issue, this paper suggests a localized decomposition evolutionary algorithm (LDEA) for imbalanced MOPs. A localized decomposition method is proposed to assign a local region for each subproblem, where the inside solutions are associated and the solution update is restricted inside (i.e., solutions are only replaced by offspring within the same local region). Once off-spring are generated within an originally empty region, the best one is reserved for this subproblem to extend diversity. Meanwhile, the subproblem with the largest number of associated solutions will be found and one of its associated solutions with the worst aggregated value will be removed. Moreover, to speed up convergence for each subproblem while balancing the population's diversity, LDEA only evolves the best-associated solution in each subproblem and correspondingly tailors two decomposition methods in the environmental selection. When compared to nine competitive MOEAs, LDEA has shown the advantages in tackling two benchmark sets of imbalanced MOPs, one benchmark set of balanced yet complicated MOPs, and one real-world MOP

Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm

A decomposition approach decomposes a multiobjective optimization problem into a number of scalar objective optimization subproblems. It plays a key role in decomposition-based multiobjective evolutionary algorithms. However, many widely used decomposition approaches, originally proposed for mathematical programming algorithms, may not be very suitable for evolutionary algorithms. To help decomposition-based multiobjective evolutionary algorithms balance the population diversity and convergence in an appropriate manner, this letter proposes to impose some constraints on the subproblems. Experiments have been conducted to demonstrate that our proposed constrained decomposition approach works well on most test instances. We further propose a strategy for adaptively adjusting constraints by using information collected from the search. Experimental results show that it can significantly improve the algorithm performance