This paper presents a personal account of the author's 35 years "adventure" with evolutionary Computation-from the first encounter in 1988 and many years of academic research through to working full-time...
详细信息
This paper presents a personal account of the author's 35 years "adventure" with evolutionary Computation-from the first encounter in 1988 and many years of academic research through to working full-time in business-successfully implementing evolutionary algorithms for some of the world's largest corporations. The paper concludes with some observations and insights.
Multi-objective evolutionary algorithms (MOEAs) have been the subject of a large research effort over the past two decades. Traditionally, theseMOEAs have been seen as monolithic units, and their study was focused on ...
详细信息
In grassland-based dairy systems, determining how to rotate the cows among fields for grazing, how much concentrate to supply and the correct stocking rate to be used are important decisions that impact on the efficie...
详细信息
ISBN:
(纸本)9781728188645
In grassland-based dairy systems, determining how to rotate the cows among fields for grazing, how much concentrate to supply and the correct stocking rate to be used are important decisions that impact on the efficiency of the system. Considering the presence of conflictive objectives, a multi-objective approach is therefore the natural way of facing the problem. Due to the computational difficulty of finding the full solution set (the Pareto front) of multi-objective models, it is usually necessary to employ algorithms giving a good approximation of this set. In particular, a number of multi-objective evolutionary algorithms with different characteristics have been proposed in the general optimization literature;but there is no current study of which is the most appropriate one for feed resource allocation in dairy systems. In this work, we present the performance evaluation of four multi-objective evolutionary algorithms to generate an approximation of the Pareto front of the feed resource allocation problem in dairy systems. Two classical genetic algorithms (NSGA-II and SPEA-2) and two differential evolution (DE) algorithms (GDE-3 and a Pareto-based DE) were used. To evaluate the algorithms, two experiments based on scenarios constructed from real data were performed. The comparison took into account running times, objective function values attained, Pareto front comparisons, and approximation quality measures based on four different metrics. From the results we conclude that the SPEA-2 is the algorithm that obtains the best quality performance for the problem under study, but also the slowest one, opening a future work opportunity of improving its computational performance.
In most of distributed evolutionary algorithms (DEAs), migration interval is used to decide the frequent of migration. Nevertheless, a predetermined interval cannot match the dynamic situation of evolution. Consequent...
详细信息
This paper presents neuro-augmented vision for evolutionary robotics (NAVER), which aims to address the two biggest challenges in camera-equipped robot evolutionary controllers. The first challenge is that camera imag...
详细信息
This paper presents neuro-augmented vision for evolutionary robotics (NAVER), which aims to address the two biggest challenges in camera-equipped robot evolutionary controllers. The first challenge is that camera images typically require many inputs from the controller, which greatly increases the complexity of optimising the search space. The second challenge is that evolutionary controllers often cannot bridge the reality gap between simulation and the real world. This method utilises a variational autoencoder to compress the camera image into smaller input vectors that are easier to manage, while still retaining the relevant information of the original image. Automatic encoders are also used to remove unnecessary details from real-world images, in order to better align with images generated by simple visual simulators. NAVER is used to evolve the controller of a robot, which only uses camera inputs to navigate the maze based on visual cues and avoid collisions. The experimental results indicate that the controller evolved in simulation and transferred to the physical robot, where it successfully performed the same navigation task. The controller can navigate the maze using only visual information. The controller responds to visual cues and changes its behaviour accordingly. NAVER has shown great potential as it has successfully completed (so far) the most complex vision-based task controller in evolutionary robotics literature.
Bilevel evolutionary algorithms (BLEAs) are a plausible approach for bilevel optimization. However, these algorithms require many fitness evaluations (FEs) and might become unusable if the fitness evaluations are comp...
详细信息
Bilevel evolutionary algorithms (BLEAs) are a plausible approach for bilevel optimization. However, these algorithms require many fitness evaluations (FEs) and might become unusable if the fitness evaluations are computationally expensive. Therefore, reducing the number of FEs is crucial for designing a BLEA for expensive bilevel optimization (EBLOP). The surrogate-assisted optimization and knowledge transfer mechanisms used in BLEAs have been proven to reduce the number of FEs. This paper proposes a surrogate-assisted bilevel improved multioperator differential evolution algorithm (SA-BL-IMODE), which integrates a classification model-based assisted preselection and environment selection strategy (CPES) for EBLOP. In CPES, promising candidate solutions are prescreened by a classification model, filtering out some unpromising candidate solutions without performing FEs, thus improving the algorithm's performance. Moreover, the classification model also assists environment selection by directly discarding the unpromising offspring solutions before FEs are performed, thus reducing the number of FEs in each iteration. Additionally, an enhanced direct neighbor solution transfer (EDST) mechanism is proposed to identify and utilize the interactions between upper-level and lower-level variables for acquiring knowledge, improving knowledge quality, and reducing the number of FEs further. Experimental studies on two test suite benchmark problems are conducted, and the proposed method is compared with nine state-of-the-art algorithms. The experimental results demonstrate the effectiveness of the proposed mechanisms and show that SA-BL-IMODE has a significant advantage over existing algorithms for expensive bilevel optimization.
An Optimal power flow (OPF) is non-linear and constrained multi-objective problem. OPF problems are expensive and evolutionary algorithms (EAs) are computationally complex to obtain uniformly distributed and global Pa...
详细信息
An Optimal power flow (OPF) is non-linear and constrained multi-objective problem. OPF problems are expensive and evolutionary algorithms (EAs) are computationally complex to obtain uniformly distributed and global Pareto front (PF). Therefore, here, hybrid two-phase algorithm integrated with parameter less constraint technique is applied to solve OPF problem. Proposed technique combines single and multi-objective EAs to find better convergence and evenly distributed PF. For the validation and effectiveness of proposed algorithm, various conflicting objective functions are formulated and implemented on IEEE 30 and 300-bus network. Each case is independently run twenty times. Hyper volume indicator technique is employed to find the best PF, and the best-compromised solution is obtained by using fuzzy decision-making technique. Recently, maximum integration of wind and solar power is highly encouraged. Complexity of OPF is increased with the integration of uncertain renewable energy resources. Hence, 30-bus test system is modified by replacing some conventional generators with the wind and solar generation. Uncertainties in wind, solar and load demand are modelled by appropriate probability distribution functions. Simulation results show that the proposed method can find the near global PF of highly complex problems subject to satisfying all the operational constraints.
Multi-objective optimization problems in many real-world applications are characterized by computationally or economically expensive objectives, which cannot provide sufficient function evaluations for evolutionary al...
详细信息
Multi-objective optimization problems in many real-world applications are characterized by computationally or economically expensive objectives, which cannot provide sufficient function evaluations for evolutionary algorithms to converge. Thus, a variety of surrogate models have been employed to provide much more virtual evaluations. Most existing surrogate models are essentially regressors or classifiers, which may suffer from low reliability in the approximation of complex objectives. In this paper, we propose a novel surrogate-assisted evolutionary algorithm, which employs a surrogate model to conduct pairwise comparisons between candidate solutions, rather than directly predicting solutions' fitness values. In comparison to regression and classification models, the proposed pairwise comparison based model can better balance between positive and negative samples, and may be directly used, reversely used, or ignored according to its reliability in model management. As demonstrated by the experimental results on abundant benchmark and real-world problems, the proposed surrogate model is more accurate than popular surrogate models, leading to performance superiority over state-of-the-art surrogate models.
In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data's great dim...
详细信息
In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data's great dimensionality and complexity, the processing and interpretation of large-scale genomic data present major challenges. In order to overcome these difficulties, this research suggests a novel Intelligent Mutation-Based evolutionary Optimization Algorithm (IMBOA) created particularly for applications in genomics and precision medicine. In the proposed IMBOA, the mutation operator is guided by genome-based information, allowing for the introduction of variants in candidate solutions that are consistent with known biological processes. The algorithm's combination of Differential Evolution with this intelligent mutation mechanism enables effective exploration and exploitation of the solution space. Applying a domain-specific fitness function, the system evaluates potential solutions for each generation based on genomic correctness and fitness. The fitness function directs the search toward ideal solutions that achieve the problem's objectives, while the genome accuracy measure assures that the solutions have physiologically relevant genomic properties. This work demonstrates extensive tests on diverse genomics datasets, including genotype-phenotype association studies and predictive modeling tasks in precision medicine, to verify the accuracy of the proposed approach. The results demonstrate that, in terms of precision, convergence rate, mean error, standard deviation, prediction, and fitness cost of physiologically important genomic biomarkers, the IMBOA consistently outperforms other cutting-edge optimization methods.
The Design Optimisation (DO) of Complex Systems is often a multidisciplinary task and involves multiple conflicting objectives and design constraints, where conventional methods cannot solve efficiently. This paper pr...
详细信息
暂无评论