Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts

Quite a few studies on real-world applications of multi-objective optimization reported that their Pareto sets and Pareto fronts form a topological simplex. Such a class of problems was recently named the simple problems, and their Pareto set and Pareto front were observed to have a gluing structure similar to the faces of a simplex. This paper gives a theoretical justification for that observation by proving the gluing structure of the Pareto sets/fronts of subproblems of a simple problem. The simplicity of standard benchmark problems is studied.Comment: 10 pages, accepted at GECCO'17 as a poster paper (2 pages

Optimizing segment routing using evolutionary computation

Segment Routing (SR) combines the simplicity of Link-State routing protocols with the flexibility of Multiprotocol Label Switching (MPLS). By decomposing forwarding paths into segments, identified by labels, SR improves Traffic Engineering (TE) and enables new solutions for the optimization of network resources utilization. This work proposes an Evolutionary Computation approach that enables Path Computation Element (PCE) or Software-defined Network (SDN) controllers to optimize label switching paths for congestion avoidance while using at the most three labels to configure each label switching path.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT Fundac¸˜ao para a Ciˆencia e Tecnologia within the Project Scope: UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio

Self-Organizing Maps for Pattern Recognition in Design of Alloys

A combined experimental\u2013computational methodology for accelerated design of AlNiCo-type permanent magnetic alloys is presented with the objective of simultaneously extremizing several magnetic properties. Chemical concentrations of eight alloying elements were initially generated using a quasirandom number generator so as to achieve a uniform distribution in the design variable space. It was followed by manufacture and experimental evaluation of these alloys using an identical thermo-magnetic protocol. These experimental data were used to develop meta-models capable of directly relating the chemical composition with desired macroscopic properties of the alloys. These properties were simultaneously optimized to predict chemical compositions that result in improvement of properties. These data were further utilized to discover various correlations within the experimental dataset by using several concepts of artificial intelligence. In this work, an unsupervised neural network known as selforganizing maps was used to discover various patterns reported in the literature. These maps were also used to screen the composition of the next set of alloys to be manufactured and tested in the next iterative cycle. Several of these Pareto-optimized predictions out-performed the initial batch of alloys. This approach helps significantly reducing the time and the number of alloys needed in the alloy development process

Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

A multi-objective optimization algorithm based on self-organizing maps applied to wireless power transfer systems

In this work, a new multi-objective population-based optimization algorithm is presented and tested. In this contribution, the concepts of fast non-dominating sorting and density estimation using the crowding distance are used to create a multi-objective optimization algorithm based on previous work, which is a single objective evolutionary optimization algorithm based on self-organizing maps (SOMs). The SOMs paradigm introduces a strong collaboration between neighbors solutions that improves exploitation. Furthermore, the representative power of the SOMs enhances the exploration and diversification. A state of the art benchmark approach is used to evaluate the performance of the proposed algorithm, obtaining positive results. The test problem uses an analytical model of an inductively coupled wireless power transfer system (WPT). The objective is to optimize the WPT model characteristics in order to allow simultaneous data and power transfer between the coils. The WPT design approach uses more degrees of freedom than existing techniques leading to a number of solutions where both the power signals and the data signal can coexist on the same physical channel achieving good figures of merit

An adaptive and modular framework for evolving deep neural networks

Santos, F. J. J. B., Gonçalves, I., & Castelli, M. (2023). Neuroevolution with box mutation: An adaptive and modular framework for evolving deep neural networks. Applied Soft Computing, 147(November), 1-15. [110767]. https://doi.org/10.1016/j.asoc.2023.110767 --- Funding: This work is funded by national funds through the FCT - Foundation for Science and Technology, I.P., within the scope of the projects CISUC - UID/CEC/00326/2020, UIDB/04152/2020 - Centro de Investigação em Gestão de Informação (MagIC)/NOVA IMS, and by European Social Fund, through the Regional Operational Program Centro 2020 .The pursuit of self-evolving neural networks has driven the emerging field of Evolutionary Deep Learning, which combines the strengths of Deep Learning and Evolutionary Computation. This work presents a novel method for evolving deep neural networks by adapting the principles of Geometric Semantic Genetic Programming, a subfield of Genetic Programming, and Semantic Learning Machine. Our approach integrates evolution seamlessly through natural selection with the optimization power of backpropagation in deep learning, enabling the incremental growth of neural networks’ neurons across generations. By evolving neural networks that achieve nearly 89% accuracy on the CIFAR-10 dataset with relatively few parameters, our method demonstrates remarkable efficiency, evolving in GPU minutes compared to the field standard of GPU days.publishersversionpublishe