Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
6,947
result(s) for
"Evolutionary computation."
Sort by:
A survey on evolutionary computation for complex continuous optimization
Complex continuous optimization problems widely exist nowadays due to the fast development of the economy and society. Moreover, the technologies like Internet of things, cloud computing, and big data also make optimization problems with more challenges including Many-dimensions, Many-changes, Many-optima, Many-constraints, and Many-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many-objective optimization problems, constrained optimization problems, and expensive optimization problems in practical applications. The evolutionary computation (EC) algorithms are a kind of promising global optimization tools that have not only been widely applied for solving traditional optimization problems, but also have emerged booming research for solving the above-mentioned complex continuous optimization problems in recent years. In order to show how EC algorithms are promising and efficient in dealing with the 5-M complex challenges, this paper presents a comprehensive survey by proposing a novel taxonomy according to the function of the approaches, including reducing problem difficulty, increasing algorithm diversity, accelerating convergence speed, reducing running time, and extending application field. Moreover, some future research directions on using EC algorithms to solve complex continuous optimization problems are proposed and discussed. We believe that such a survey can draw attention, raise discussions, and inspire new ideas of EC research into complex continuous optimization problems and real-world applications.
Journal Article
Fire Hawk Optimizer: a novel metaheuristic algorithm
This study proposes the Fire Hawk Optimizer (FHO) as a novel metaheuristic algorithm based on the foraging behavior of whistling kites, black kites and brown falcons. These birds are termed Fire Hawks considering the specific actions they perform to catch prey in nature, specifically by means of setting fire. Utilizing the proposed algorithm, a numerical investigation was conducted on 233 mathematical test functions with dimensions of 2–100, and 150,000 function evaluations were performed for optimization purposes. For comparison, a total of ten different classical and new metaheuristic algorithms were utilized as alternative approaches. The statistical measurements include the best, mean, median, and standard deviation of 100 independent optimization runs, while well-known statistical analyses, such as Kolmogorov–Smirnov, Wilcoxon, Mann–Whitney, Kruskal–Wallis, and Post-Hoc analysis, were also conducted. The obtained results prove that the FHO algorithm exhibits better performance than the compared algorithms from literature. In addition, two of the latest Competitions on Evolutionary Computation (CEC), such as CEC 2020 on bound constraint problems and CEC 2020 on real-world optimization problems including the well-known mechanical engineering design problems, were considered for performance evaluation of the FHO algorithm, which further demonstrated the superior capability of the optimizer over other metaheuristic algorithms in literature. The capability of the FHO is also evaluated in dealing with two of the real-size structural frames with 15 and 24 stories in which the new method outperforms the previously developed metaheuristics.
Journal Article
Evolutionary computation for unmanned aerial vehicle path planning: a survey
Unmanned aerial vehicle (UAV) path planning aims to find the optimal flight path from the start point to the destination point for each aerial vehicle. With the rapid development of UAV technology, UAVs are required to tackle missions in increasingly complex environments. Consequently, UAV path planning encounters more challenges, causing traditional deterministic algorithms to struggle to find the optimal path within a certain time. Evolutionary computation (EC) is a series of nature-inspired methodologies and algorithms, which have shown effectiveness and efficiency in solving many complex optimization problems in real-world applications. Recently, EC algorithms have been effectively applied in UAV path planning and have shown encouraging performance in obtaining high-quality solutions. Therefore, it is crucial to review the related research experience and literature in the field of using EC for UAV path planning. This paper presents a comprehensive survey to showcase the existing studies on EC in UAV path planning, especially in complex environments. The paper first proposes a novel taxonomy to categorize the relevant studies into three different categories according to the complex environmental properties of the application scenarios. These environmental properties include complex search space, complex time control, and complex optimization objectives. Then, the EC algorithms for UAV path planning in these complex environments are further systematically surveyed as constrained search space and large-scale search space in complex search space, dynamic UAV path planning and multi-UAV concurrent path planning in complex time control, and expensive objective and multiple objectives in complex optimization objectives. Finally, some potential future research directions for applying EC algorithms to UAV path planning are presented and discussed.
Journal Article
Multi-Task Optimization and Multi-Task Evolutionary Computation in the Past Five Years: A Brief Review
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.
Journal Article
The application of evolutionary computation in generative adversarial networks (GANs): a systematic literature survey
As a subfield of deep learning (DL), generative adversarial networks (GANs) have produced impressive generative results by applying deep generative models to create synthetic data and by performing an adversarial training process. Nevertheless, numerous issues related to the instability of training need to be urgently addressed. Evolutionary computation (EC), using the corresponding paradigm of biological evolution, overcomes these problems and improves evolutionary-based GANs’ ability to deal with real-world applications. Therefore, this paper presents a systematic literature survey combining EC and GANs. First, the basic theories of GANs and EC are analyzed and summarized. Second, to provide readers with a comprehensive view, this paper outlines the recent advances in combining EC and GANs after detailed classification and introduces each of them. These classifications include evolutionary GANs and their variants, GANs with evolutionary strategies and differential evolution, GANs combined with neuroevolution, evolutionary GANs related to different optimization problems, and applications of evolutionary GANs. Detailed information on the evaluation metrics, network structures, and comparisons of these models is presented in several tables. Finally, future directions and possible perspectives for further development are discussed.
Journal Article
Optimal Path Planning Generation for Mobile Robots using Parallel Evolutionary Artificial Potential Field
In this paper, we introduce the concept of Parallel Evolutionary Artificial Potential Field (PEAPF) as a new method for path planning in mobile robot navigation. The main contribution of this proposal is that it makes possible controllability in complex real-world sceneries with dynamic obstacles if a reachable configuration set exists. The PEAPF outperforms the Evolutionary Artificial Potential Field (EAPF) proposal, which can also obtain optimal solutions but its processing times might be prohibitive in complex real-world situations. Contrary to the original Artificial Potential Field (APF) method, which cannot guarantee controllability in dynamic environments, this innovative proposal integrates the original APF, evolutionary computation and parallel computation for taking advantages of novel processors architectures, to obtain a flexible path planning navigation method that takes all the advantages of using the APF and the EAPF, strongly reducing their disadvantages. We show comparative experiments of the PEAPF against the APF and the EAPF original methods. The results demonstrate that this proposal overcomes both methods of implementation; making the PEAPF suitable to be used in real-time applications.
Journal Article
Artificial intelligence-based methods for protein structure prediction: a survey
Protein structure prediction (PSP) is a meaningful problem that has drawn worldwide attention, where various artificial intelligence (AI) techniques, such as evolutionary computation (EC)-based and neural networks (NNs)-based methods, have been applied to PSP and have obtained promising results in recent years. Considering the rapid and significant advances of AI-based methods for PSP, it is vital to make a survey on this progress to summarize the existing research experience and to provide guidelines for further development of related research fields. With these aims, a broad survey of AI-based methods for solving PSP problems is provided in this article. First, EC-based PSP methods are reviewed, which are organized by three key steps involved in using EC-based methods for PSP. Second, NNs-based PSP methods are reviewed. More specifically, typical NNs-based methods to predict protein structural features are described and state-of-the-art NNs-based methods with end-to-end architecture and attention mechanism are reviewed. Third, the accuracy, interpretability, accessibility, and ethical challenges of AI-based methods are discussed. Last, the future directions including hybrid AI paradigm, protein language models, and the prediction of protein complexes and biomolecular interactions are given, and the conclusion is drawn. This survey is expected to draw attention, raise discussions, and inspire new ideas in the wonderful interdisciplinary field of biology and AI.
Journal Article