Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
23,661
result(s) for
"evolutionary algorithms"
Sort by:
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
This paper proposes an improved epsilon constraint-handling mechanism and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of feasible to total solutions in the current population. In order to evaluate the performance of MOEA/D-IEpsilon, a new set of CMOPs with two and three objectives is designed, having large infeasible regions (relative to the feasible regions), and they are called LIR-CMOPs. Then, the 14 benchmarks, including LIR-CMOP1-14, are used to test MOEA/D-IEpsilon and four other decomposition-based CMOEAs, including MOEA/D-Epsilon, MOEA/D-SR, MOEA/D-CDP and CMOEA/D. The experimental results indicate that MOEA/D-IEpsilon is significantly better than the other four CMOEAs on all of the test instances, which shows that MOEA/D-IEpsilon is more suitable for solving CMOPs with large infeasible regions. Furthermore, a real-world problem, namely the robot gripper optimization problem, is used to test the five CMOEAs. The experimental results demonstrate that MOEA/D-IEpsilon also outperforms the other four CMOEAs on this problem.
Journal Article
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
Evolutionary Computation for Expensive Optimization: A Survey
Expensive optimization problem (EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation (EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.
Journal Article
Genetic algorithms: theory, genetic operators, solutions, and applications
A genetic algorithm (GA) is an evolutionary algorithm inspired by the natural selection and biological processes of reproduction of the fittest individual. GA is one of the most popular optimization algorithms that is currently employed in a wide range of real applications. Initially, the GA fills the population with random candidate solutions and develops the optimal solution from one generation to the next. The GA applies a set of genetic operators during the search process: selection, crossover, and mutation. This article aims to review and summarize the recent contributions to the GA research field. In addition, the definitions of the GA essential concepts are reviewed. Furthermore, the article surveys the real-life applications and roles of GA. Finally, future directions are provided to develop the field.
Journal Article
Investigations of Machining Characteristics in the Upgraded MQL-Assisted Turning of Pure Titanium Alloys Using Evolutionary Algorithms
Environmental protection is the major concern of any form of manufacturing industry today. As focus has shifted towards sustainable cooling strategies, minimum quantity lubrication (MQL) has proven its usefulness. The current survey intends to make the MQL strategy more effective while improving its performance. A Ranque–Hilsch vortex tube (RHVT) was implemented into the MQL process in order to enhance the performance of the manufacturing process. The RHVT is a device that allows for separating the hot and cold air within the compressed air flows that come tangentially into the vortex chamber through the inlet nozzles. Turning tests with a unique combination of cooling technique were performed on titanium (Grade 2), where the effectiveness of the RHVT was evaluated. The surface quality measurements, forces values, and tool wear were carefully investigated. A combination of analysis of variance (ANOVA) and evolutionary techniques (particle swarm optimization (PSO), bacteria foraging optimization (BFO), and teaching learning-based optimization (TLBO)) was brought into use in order to analyze the influence of the process parameters. In the end, an appropriate correlation between PSO, BFO, and TLBO was investigated. It was shown that RHVT improved the results by nearly 15% for all of the responses, while the TLBO technique was found to be the best optimization technique, with an average time of 1.09 s and a success rate of 90%.
Journal Article
Application of state-of-the-art multiobjective metaheuristic algorithms in reliability-based design optimization: a comparative study
Multiobjective reliability-based design optimization (RBDO) is a research area, which has not been investigated in the literatures comparing with single-objective RBDO. This work conducts an exhaustive study of fifteen new and popular metaheuristic multiobjective RBDO algorithms, including non-dominated sorting genetic algorithm II, differential evolution for multiobjective optimization, multiobjective evolutionary algorithm based on decomposition, multiobjective particle swarm optimization, multiobjective flower pollination algorithm, multiobjective bat algorithm, multiobjective gray wolf optimizer, multiobjective multiverse optimization, multiobjective water cycle optimizer, success history-based adaptive multiobjective differential evolution, success history-based adaptive multiobjective differential evolution with whale optimization, multiobjective salp swarm algorithm, real-code population-based incremental learning and differential evolution, unrestricted population size evolutionary multiobjective optimization algorithm, and multiobjective jellyfish search optimizer. In addition, the adaptive chaos control method is employed for the above-mentioned algorithms to estimate the probabilistic constraints effectively. This comparative analysis reveals the critical technologies and enormous challenges in the RBDO field. It also offers new insight into simultaneously dealing with the multiple conflicting design objectives and probabilistic constraints. Also, this study presents the advantage and future development trends or incurs the increased challenge of researchers to put forward an effective multiobjective RBDO algorithm that assists the complex engineering system design.
Journal Article
An Empirical Study of Cluster-Based MOEA/D Bare Bones PSO for Data Clustering
Previously, cluster-based multi or many objective function techniques were proposed to reduce the Pareto set. Recently, researchers proposed such techniques to find better solutions in the objective space to solve engineering problems. In this work, we applied a cluster-based approach for solution selection in a multiobjective evolutionary algorithm based on decomposition with bare bones particle swarm optimization for data clustering and investigated its clustering performance. In our previous work, we found that MOEA/D with BBPSO performed the best on 10 datasets. Here, we extend this work applying a cluster-based approach tested on 13 UCI datasets. We compared with six multiobjective evolutionary clustering algorithms from the existing literature and ten from our previous work. The proposed technique was found to perform well on datasets highly overlapping clusters, such as CMC and Sonar. So far, we found only one work that used cluster-based MOEA for clustering data, the hierarchical topology multiobjective clustering algorithm. All other cluster-based MOEA found were used to solve other problems that are not data clustering problems. By clustering Pareto solutions and evaluating new candidates against the found cluster representatives, local search is introduced in the solution selection process within the objective space, which can be effective on datasets with highly overlapping clusters. This is an added layer of search control in the objective space. The results are found to be promising, prompting different areas of future research which are discussed, including the study of its effects with an increasing number of clusters as well as with other objective functions.
Journal Article
Optimizing connection weights in neural networks using the whale optimization algorithm
The learning process of artificial neural networks is considered as one of the most difficult challenges in machine learning and has attracted many researchers recently. The main difficulty of training a neural network is the nonlinear nature and the unknown best set of main controlling parameters (weights and biases). The main disadvantages of the conventional training algorithms are local optima stagnation and slow convergence speed. This makes stochastic optimization algorithm reliable alternative to alleviate these drawbacks. This work proposes a new training algorithm based on the recently proposed whale optimization algorithm (WOA). It has been proved that this algorithm is able to solve a wide range of optimization problems and outperform the current algorithms. This motivated our attempts to benchmark its performance in training feedforward neural networks. For the first time in the literature, a set of 20 datasets with different levels of difficulty are chosen to test the proposed WOA-based trainer. The results are verified by comparisons with back-propagation algorithm and six evolutionary techniques. The qualitative and quantitative results prove that the proposed trainer is able to outperform the current algorithms on the majority of datasets in terms of both local optima avoidance and convergence speed.
Journal Article
An adaptive differential evolution with combined strategy for global numerical optimization
Differential evolution (DE) is a simple yet powerful evolutionary algorithm for numerical optimization. However, the performance of DE significantly relies on its mutation operator and control parameters (scaling factor and crossover rate). In this paper, we propose a novel DE variant by introducing a series of combined strategies into DE, called CSDE. Specifically, in CSDE, to obtain a proper balance between global exploration ability and local exploitation ability, we adopt two mutation operators with different characteristics to produce the mutant vector, and provide a mechanism based on their own historical success rate to coordinate the two adopted mutation operators. Moreover, we combine a periodic function based on one modulo operation, an individual-independence macro-control function and an individual-dependence function based on individual’s fitness value information to adaptively produce scaling factor and crossover rate. To verify the effectiveness of the proposed CSDE, comparison experiments contained seven other state-of-the-art DE variants are tested on a suite of 30 benchmark functions and four real-world problems. The simulation results demonstrate that CSDE achieves the best overall performance among the eight DE variants.
Journal Article