Evolutionary Computation Meets Multiagent Systems for Better Solving Optimization Problems

Author(s):  
Vinicius Renan de Carvalho ◽  
Jaime Simão Sichman
Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 864
Author(s):  
Qingzheng Xu ◽  
Na Wang ◽  
Lei Wang ◽  
Wei Li ◽  
Qian Sun

Traditional evolution algorithms tend to start the search from scratch. However, real-world problems seldom exist in isolation and humans effectively manage and execute multiple tasks at the same time. Inspired by this concept, the paradigm of multi-task evolutionary computation (MTEC) has recently emerged as an effective means of facilitating implicit or explicit knowledge transfer across optimization tasks, thereby potentially accelerating convergence and improving the quality of solutions for multi-task optimization problems. An increasing number of works have thus been proposed since 2016. The authors collect the abundant specialized literature related to this novel optimization paradigm that was published in the past five years. The quantity of papers, the nationality of authors, and the important professional publications are analyzed by a statistical method. As a survey on state-of-the-art of research on this topic, this review article covers basic concepts, theoretical foundation, basic implementation approaches of MTEC, related extension issues of MTEC, and typical application fields in science and engineering. In particular, several approaches of chromosome encoding and decoding, intro-population reproduction, inter-population reproduction, and evaluation and selection are reviewed when developing an effective MTEC algorithm. A number of open challenges to date, along with promising directions that can be undertaken to help move it forward in the future, are also discussed according to the current state. The principal purpose is to provide a comprehensive review and examination of MTEC for researchers in this community, as well as promote more practitioners working in the related fields to be involved in this fascinating territory.


1996 ◽  
Vol 4 (1) ◽  
pp. 1-32 ◽  
Author(s):  
Zbigniew Michalewicz ◽  
Marc Schoenauer

Evolutionary computation techniques have received a great deal of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a significant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently have several methods been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; however, these methods have several drawbacks, and the experimental results on many test cases have been disappointing. In this paper we (1) discuss difficulties connected with solving the general nonlinear programming problem; (2) survey several approaches that have emerged in the evolutionary computation community; and (3) provide a set of 11 interesting test cases that may serve as a handy reference for future methods.


2020 ◽  
Vol 10 (6) ◽  
pp. 2012
Author(s):  
An-Jui Li ◽  
Abdoulie Fatty ◽  
I-Tung Yang

Generally, in geotechnical engineering, back analyses are used to investigate uncertain parameters. Back analyses can be undertaken by considering known conditions, such as failure surfaces, displacements, and structural performances. Many geotechnical problems have irregular solution domains, with the objective function being non-convex, and may not be continuous functions. As such, a complex non-linear optimization function is typically required for most geotechnical problems to attain a better understanding of these uncertainties. Therefore, particle swarm optimization (PSO) and a genetic algorithm (GA) are utilized in this study to facilitate in back analyses mainly based on upper bound finite element limit analysis method. These approaches are part of evolutionary computation, which is appropriate for solving non-linear global optimization problems. By using these techniques with upper-bound finite element limit analysis (UB-FELA), two case studies showed that the results obtained are reasonable and reliable while maintaining a balance between computational time and accuracy.


2011 ◽  
Vol 1 (1) ◽  
Author(s):  
S. Salcedo-Sanz ◽  
B. Saavedra-Moreno ◽  
A. Paniagua-Tineo ◽  
L. Prieto ◽  
A. Portilla-Figueras

AbstractThis paper presents a mini-review of the main works recently published about optimal wind turbines layout in wind farms. Specifically, we focus on discussing articles where evolutionary computation techniques have been applied, since this computational framework has obtained very good results in different formulations of the problem. A summary of the main concepts needed to face the problem are also included in the article, such as a basic wake model and several cost models and objective functions previously used in the literature. This review includes works published in the most significant journals and international conferences, and it gives a brief remark of the optimization models proposed and the implemented algorithms, so it can be useful for readers who want to be quickly introduced in this research area.


Author(s):  
Monica Chis

This chapter aims to present a part of the computer science literature in which the evolutionary computation techniques, optimization techniques and other bio-inspired techniques are used to solve different search and optimization problems in the area of software engineering.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Erik Cuevas ◽  
Jorge Gálvez ◽  
Salvador Hinojosa ◽  
Omar Avalos ◽  
Daniel Zaldívar ◽  
...  

System identification is a complex optimization problem which has recently attracted the attention in the field of science and engineering. In particular, the use of infinite impulse response (IIR) models for identification is preferred over their equivalent FIR (finite impulse response) models since the former yield more accurate models of physical plants for real world applications. However, IIR structures tend to produce multimodal error surfaces whose cost functions are significantly difficult to minimize. Evolutionary computation techniques (ECT) are used to estimate the solution to complex optimization problems. They are often designed to meet the requirements of particular problems because no single optimization algorithm can solve all problems competitively. Therefore, when new algorithms are proposed, their relative efficacies must be appropriately evaluated. Several comparisons among ECT have been reported in the literature. Nevertheless, they suffer from one limitation: their conclusions are based on the performance of popular evolutionary approaches over a set of synthetic functions with exact solutions and well-known behaviors, without considering the application context or including recent developments. This study presents the comparison of various evolutionary computation optimization techniques applied to IIR model identification. Results over several models are presented and statistically validated.


Sign in / Sign up

Export Citation Format

Share Document