Convergence in Probability on a Big Class of Time-Variant Evolutionary Algorithms

2019 ◽  
Vol 33 (06) ◽  
pp. 1959018
Author(s):  
Ming Chen ◽  
Yunwen Lei ◽  
Lixin Ding ◽  
Zhao Tong
Keyword(s):  
Global Convergence ◽  
Evolutionary Algorithms ◽  
Markov Chains ◽  
General Class ◽  
State Of The Art ◽  
General Theorem ◽  
Convergence In Probability ◽  
Simulation Experiments ◽  
Concrete Case ◽  
Mild Conditions

Motivated by the growing popularity of time-variant evolutionary algorithms (EAs) in solving practical problems, this paper uses spectral analyses to study convergence in probability for a general class of time-variant EAs which can be asymptotically described by reducible Markov chains with multiple aperiodic recurrent classes, covering many existing concrete case studies as specific instantiations. We provide a universal yet easily checkable characteristic for time-variant EAs satisfying global convergence, by introducing the asymptotical elitism and asymptotical monotonicity. To illustrate the effectiveness of our result, we consider four specific EAs with distinct asymptotical behavior, and recover, under even mild conditions, the state-of-the-art result as simple applications of our general theorem. Besides, simulation experiments further verify these results.

scholarly journals Development of Multiple Behaviors in Evolving Robots

Robotics ◽  
2020 ◽  
Vol 10 (1) ◽  
pp. 1
Author(s):  
Victor Massagué Respall ◽  
Stefano Nolfi
Keyword(s):  
Evolutionary Algorithms ◽  
State Of The Art ◽  
Evolutionary Robotics ◽  
The Other ◽  
Evolutionary Strategies ◽  
Multiple Behaviors ◽  
Pareto Fronts ◽  
Expected Fitness

We investigate whether standard evolutionary robotics methods can be extended to support the evolution of multiple behaviors by forcing the retention of variations that are adaptive with respect to all required behaviors. This is realized by selecting the individuals located in the first Pareto fronts of the multidimensional fitness space in the case of a standard evolutionary algorithms and by computing and using multiple gradients of the expected fitness in the case of a modern evolutionary strategies that move the population in the direction of the gradient of the fitness. The results collected on two extended versions of state-of-the-art benchmarking problems indicate that the latter method permits to evolve robots capable of producing the required multiple behaviors in the majority of the replications and produces significantly better results than all the other methods considered.

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

Genetic Diversity as an Objective in Multi-Objective Evolutionary Algorithms

2003 ◽  
Vol 11 (2) ◽  
pp. 151-167 ◽  
Author(s):  
Andrea Toffolo ◽  
Ernesto Benini
Keyword(s):  
Genetic Diversity ◽  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Selection Pressure ◽  
Evaluation Method ◽  
State Of The Art ◽  
Search Space ◽  
Test Problems ◽  
Multi Objective ◽  
Diversity Evaluation

A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity Evaluation Method (GeDEM), which considers a distance-based measure of genetic diversity as a real objective in fitness assignment. This provides a dual selection pressure towards the exploitation of current non-dominated solutions and the exploration of the search space. We also introduce a new multi-objective evolutionary algorithm, the Genetic Diversity Evolutionary Algorithm (GDEA), strictly designed around GeDEM and then we compare it with other state-of-the-art algorithms on a well-established suite of test problems. Experimental results clearly indicate that the performance of GDEA is top-level.

scholarly journals A RESTful middleware for AI controlled sensors, actuators and smart devices

2019 ◽  
Vol 11 (7) ◽  
pp. 2963-2986 ◽  
Author(s):  
Nikos Dipsis ◽  
Kostas Stathis
Keyword(s):  
Smart Home ◽  
Learning Algorithm ◽  
State Of The Art ◽  
Smart Devices ◽  
Machine Learning Algorithm ◽  
Concrete Case ◽  
Domain Specific ◽  
Sensor Actuator ◽  
Current State

Abstract The numerous applications of internet of things (IoT) and sensor networks combined with specialized devices used in each has led to a proliferation of domain specific middleware, which in turn creates interoperability issues between the corresponding architectures and the technologies used. But what if we wanted to use a machine learning algorithm to an IoT application so that it adapts intelligently to changes of the environment, or enable a software agent to enrich with artificial intelligence (AI) a smart home consisting of multiple and possibly incompatible technologies? In this work we answer these questions by studying a framework that explores how to simplify the incorporation of AI capabilities to existing sensor-actuator networks or IoT infrastructures making the services offered in such settings smarter. Towards this goal we present eVATAR+, a middleware that implements the interactions within the context of such integrations systematically and transparently from the developers’ perspective. It also provides a simple and easy to use interface for developers to use. eVATAR+ uses JAVA server technologies enhanced by mediator functionality providing interoperability, maintainability and heterogeneity support. We exemplify eVATAR+ with a concrete case study and we evaluate the relative merits of our approach by comparing our work with the current state of the art.

scholarly journals Evolutionary algorithms, swarm intelligence methods, and their applications in water resources engineering: a state-of-the-art review

2020 ◽  
Vol 3 (1) ◽  
pp. 135-188 ◽  
Author(s):  
M. Janga Reddy ◽  
D. Nagesh Kumar
Keyword(s):  
Water Resources ◽  
Evolutionary Algorithms ◽  
Swarm Intelligence ◽  
Water Resource ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
State Of The Art ◽  
Real Life ◽  
Distribution Networks ◽  
Water Resources Engineering

Abstract During the last three decades, the water resources engineering field has received a tremendous increase in the development and use of meta-heuristic algorithms like evolutionary algorithms (EA) and swarm intelligence (SI) algorithms for solving various kinds of optimization problems. The efficient design and operation of water resource systems is a challenging task and requires solutions through optimization. Further, real-life water resource management problems may involve several complexities like nonconvex, nonlinear and discontinuous functions, discrete variables, a large number of equality and inequality constraints, and often associated with multi-modal solutions. The objective function is not known analytically, and the conventional methods may face difficulties in finding optimal solutions. The issues lead to the development of various types of heuristic and meta-heuristic algorithms, which proved to be flexible and potential tools for solving several complex water resources problems. This paper provides a review of state-of-the-art methods and their use in planning and management of hydrological and water resources systems. It includes a brief overview of EAs (genetic algorithms, differential evolution, evolutionary strategies, etc.) and SI algorithms (particle swarm optimization, ant colony optimization, etc.), and applications in the areas of water distribution networks, water supply, and wastewater systems, reservoir operation and irrigation systems, watershed management, parameter estimation of hydrological models, urban drainage and sewer networks, and groundwater systems monitoring network design and groundwater remediation. This paper also provides insights, challenges, and need for algorithmic improvements and opportunities for future applications in the water resources field, in the face of rising problem complexities and uncertainties.

WHAT DO QUANTILE REGRESSIONS IDENTIFY FOR GENERAL STRUCTURAL FUNCTIONS?

2014 ◽  
Vol 31 (5) ◽  
pp. 1102-1116 ◽  
Author(s):  
Yuya Sasaki
Keyword(s):  
Partial Derivative ◽  
General Class ◽  
Weighted Average ◽  
Causal Effects ◽  
Quantile Regressions ◽  
Conditional Quantile ◽  
Mild Conditions ◽  
Structural Functions ◽  
Partial Effects

This paper shows what quantile regressions identify for general structural functions. Under fairly mild conditions, the quantile partial derivative identifies a weighted average of heterogeneous structural partial effects among the subpopulation of individuals at the conditional quantile of interest. This result justifies the use of quantile regressions as means of measuring heterogeneous causal effects for a general class of structural functions with multiple unobservables.

Hyperspectral complex-domain image denoising: cube complex-domain BM3D (CCDBM3D) algorithm

2020 ◽  
Vol 2020 (10) ◽  
pp. 179-1-179-7
Author(s):  
Vladimir Katkovnik ◽  
Mykola Ponomarenko ◽  
Karen Egiazarian ◽  
Igor Shevkunov ◽  
Peter Kocsis
Keyword(s):  
Image Denoising ◽  
High Efficiency ◽  
State Of The Art ◽  
Block Matching ◽  
Complex Domain ◽  
Simulation Experiments ◽  
Cube Complex ◽  
Spatial Dimensions ◽  
Phase Amplitude ◽  
Complex Valued

We consider hyperspectral phase/amplitude imaging from hyperspectral complex-valued noisy observations. Block-matching and grouping of similar patches are main instruments of the proposed algorithms. The search neighborhood for similar patches spans both the spectral and 2D spatial dimensions. SVD analysis of 3D grouped patches is used for design of adaptive nonlocal bases. Simulation experiments demonstrate high efficiency of developed state-of-the-art algorithms.

scholarly journals Evolutionary Manytasking Optimization Based on Symbiosis in Biocoenosis

2019 ◽  
Vol 33 ◽  
pp. 4295-4303 ◽  
Author(s):  
Rung-Tzuo Liaw ◽  
Chuan-Kang Ting
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Benchmark Problems ◽  
Good Estimator ◽  
Multiple Tasks ◽  
Effectiveness And Efficiency ◽  
Evolutionary Multitasking

Evolutionary multitasking is a significant emerging search paradigm that utilizes evolutionary algorithms to concurrently optimize multiple tasks. The multi-factorial evolutionary algorithm renders an effectual realization of evolutionary multitasking on two or three tasks. However, there remains room for improvement on the performance and capability of evolutionary multitasking. Beyond three tasks, this paper proposes a novel framework, called the symbiosis in biocoenosis optimization (SBO), to address evolutionary many-tasking optimization. The SBO leverages the notion of symbiosis in biocoenosis for transferring information and knowledge among different tasks through three major components: 1) transferring information through inter-task individual replacement, 2) measuring symbiosis through intertask paired evaluations, and 3) coordinating the frequency and quantity of transfer based on symbiosis in biocoenosis. The inter-task individual replacement with paired evaluations caters for estimation of symbiosis, while the symbiosis in biocoenosis provides a good estimator of transfer. This study examines the effectiveness and efficiency of the SBO on a suite of many-tasking benchmark problems, designed to deal with 30 tasks simultaneously. The experimental results show that SBO leads to better solutions and faster convergence than the state-of-the-art evolutionary multitasking algorithms. Moreover, the results indicate that SBO is highly capable of identifying the similarity between problems and transferring information appropriately.

scholarly journals A Credibility Score Algorithm for Malicious Data Detection in Urban Vehicular Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 496
Author(s):  
Bartłomiej Płaczek ◽  
Marcin Bernas ◽  
Marcin Cholewa
Keyword(s):  
Vehicular Networks ◽  
State Of The Art ◽  
Negative Impact ◽  
Green Light ◽  
Traffic Signals ◽  
Signalized Intersection ◽  
Traffic Signal Control ◽  
Data Detection ◽  
Simulation Experiments ◽  
Improved Accuracy

This paper introduces a method to detect malicious data in urban vehicular networks, where vehicles report their locations to road-side units controlling traffic signals at intersections. The malicious data can be injected by a selfish vehicle approaching a signalized intersection to get the green light immediately. Another source of malicious data are vehicles with malfunctioning sensors. Detection of the malicious data is conducted using a traffic model based on cellular automata, which determines intervals representing possible positions of vehicles. A credibility score algorithm is introduced to decide if positions reported by particular vehicles are reliable and should be taken into account for controlling traffic signals. Extensive simulation experiments were conducted to verify effectiveness of the proposed approach in realistic scenarios. The experimental results show that the proposed method detects the malicious data with higher accuracy than compared state-of-the-art methods. The improved accuracy of detecting malicious data has enabled mitigation of their negative impact on the performance of traffic signal control.

Sign in / Sign up

Export Citation Format

Share Document