Differential Evolution Dynamic Analysis in the Form of Complex Networks

2016 ◽  
pp. 285-318 ◽  
Author(s):  
Lenka Skanderova ◽  
Ivan Zelinka
Keyword(s):  
Evolutionary Algorithms ◽  
Differential Evolution ◽  
Complex Networks ◽  
Dynamic Analysis ◽  
Evolutionary Algorithm ◽  
Complex Network ◽  
Novel Method

In this work, we investigate the dynamics of Differential Evolution (DE) using complex networks. In this pursuit, we would like to clarify the term complex network and analyze its properties briefly. This chapter presents a novel method for analysis of the dynamics of evolutionary algorithms in the form of complex networks. We discuss the analogy between individuals in populations in an arbitrary evolutionary algorithm and vertices of a complex network as well as between edges in a complex network and communication between individuals in a population. We also discuss the dynamics of the analysis.

On Mutual Relations amongst Evolutionary Algorithm Dynamics and Its Hidden Complex Network Structures

2016 ◽  
pp. 319-342 ◽  
Author(s):  
Ivan Zelinka
Keyword(s):  
Evolutionary Algorithms ◽  
Complex Networks ◽  
Evolutionary Algorithm ◽  
Evolutionary Computation ◽  
Complex Network ◽  
Deterministic Chaos ◽  
Main Idea ◽  
Network Structures ◽  
Research Complex ◽  
Mutual Relations

In this chapter, we do synthesis of three partially different areas of research: complex networks, evolutionary computation and deterministic chaos. Ideas, results and methodologies reported and mentioned here are based on our previous results and experiments. We report here our latest results as well as propositions on further research that is in process in our group (http://navy.cs.vsb.cz/). In order to understand what is the main idea, lets first discuss an overview of the two main areas: complex networks and evolutionary algorithms.

On Mutual Relations amongst Evolutionary Algorithm Dynamics and Its Hidden Complex Network Structures

2016 ◽  
pp. 215-239 ◽  
Author(s):  
Ivan Zelinka
Keyword(s):  
Evolutionary Algorithms ◽  
Complex Networks ◽  
Evolutionary Algorithm ◽  
Evolutionary Computation ◽  
Complex Network ◽  
Deterministic Chaos ◽  
Main Idea ◽  
Network Structures ◽  
Research Complex ◽  
Mutual Relations

In this chapter, we do synthesis of three partially different areas of research: complex networks, evolutionary computation and deterministic chaos. Ideas, results and methodologies reported and mentioned here are based on our previous results and experiments. We report here our latest results as well as propositions on further research that is in process in our group (http://navy.cs.vsb.cz/). In order to understand what is the main idea, lets first discuss an overview of the two main areas: complex networks and evolutionary algorithms.

Multi-objective optimization of all-wheel drive electric formula vehicle for performance and energy efficiency using evolutionary algorithms

2019 ◽  
Vol 234 (5) ◽  
pp. 1472-1479 ◽  
Author(s):  
Tey Jing Yuen ◽  
Rahizar Ramli
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Evolutionary Algorithms ◽  
Differential Evolution ◽  
Evolutionary Algorithm ◽  
Time Frame ◽  
Motor Power ◽  
Multi Objective Optimization ◽  
Pareto Solution ◽  
Multi Objective

A new method based on constraint multi-objective optimization using evolutionary algorithms is proposed to optimize the powertrain design of a battery electric formula vehicle with an all-wheel independent motor drive. The electric formula vehicle has a maximum combined motor power of 80 kW, which is a constraint for delivering maximum vehicle performance with minimal energy consumption. The performance of the vehicle will be simulated and measured against different driving events, that is, acceleration event, autocross event, and endurance event. Each event demands a different aspect of performance to be delivered by the motor. The respective event lap time or energy rating will be measured for performance assessment. In this study, a non-dominated sorting genetic algorithm II and constrained multi-objective evolutionary algorithm based on decomposition by using differential evolution are employed to optimize the motor transmission ratio, motor torque scaling, and downforce scale of both front and rear wheels against the acceleration event to minimize energy consumption and event lap time while constraining the combined motor power of all wheels to not exceed 80 kW. The optimization will be performed through software-in-the-loop between MATLAB and VI-Grade, where the high-fidelity vehicle will be modeled in VI-Grade and optimization algorithms will be implemented on the host in MATLAB. Results show that the non-dominated sorting genetic algorithm II outperforms the constrained multi-objective evolutionary algorithm based on decomposition by using differential evolution in obtaining a wider distributed Pareto solution and converges at a relatively shorter time frame. The optimized results show a promising increase in the performance of the electric formula vehicle in completing those events with the highest combined performance scoring, that is, the lap time of acceleration events improves by 9.18%, that of autocross event improves by 6.1%, and that of endurance event improves by 4.97%, with minimum decrease in energy rating of 32.54%.

Generalized Differential Evolution for Constrained Multi-Objective Optimization

2011 ◽  
pp. 43-75 ◽  
Author(s):  
Saku Kukkonen ◽  
Lampinen Jouni
Keyword(s):  
Evolutionary Algorithms ◽  
Differential Evolution ◽  
Evolutionary Algorithm ◽  
General Purpose ◽  
Optimization Process ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Development Phases ◽  
And Performance ◽  
Generalized Differential

Multi-objective optimization with Evolutionary Algorithms has been gaining popularity recently because its applicability in practical problems. Many practical problems contain also constraints, which must be taken care of during optimization process. This chapter is about Generalized Differential Evolution, which is a general-purpose optimizer. It is based on a relatively recent Evolutionary Algorithm, Differential Evolution, which has been gaining popularity because of its simplicity and good observed performance. Generalized Differential Evolution extends Differential Evolution for problems with several objectives and constraints. The chapter concentrates on describing different development phases and performance of Generalized Differential Evolution but it also contains a brief review of other multi-objective DE approaches. Ability to solve multi-objective problems is mainly discussed, but constraint handling and the effect of control parameters are also covered. It is found that GDE versions, in particular the latest version, are effective and efficient for solving constrained multi-objective problems.

The Multi-Objective Differential Evolutionary Algorithms and its Application in Optimal Allocation of Water Resources

2012 ◽  
Vol 518-523 ◽  
pp. 4093-4096
Author(s):  
Yan Hong Long ◽  
Li Yang Yu
Keyword(s):  
Water Resources ◽  
Evolutionary Algorithms ◽  
Differential Evolution ◽  
Evolutionary Algorithm ◽  
Swarm Intelligence ◽  
Optimal Allocation ◽  
Differential Evolution Algorithm ◽  
Multi Objective ◽  
Evolution Algorithm ◽  
Optimization Search

Abstract: Differential evolution algorithm (differential evolution DE) is a multi-objective evolutionary algorithm based on groups， which instructs optimization search by swarm intelligence produced by co-operation and competition among individuals within groups. This paper presents it to the research of optimal allocation of water resources. Accord to the application of the example, the results shows that reasonable and effective.

scholarly journals Evolutionary algorithms and fuzzy sets for discovering temporal rules

2013 ◽  
Vol 23 (4) ◽  
pp. 855-868 ◽  
Author(s):  
Stephen G. Matthews ◽  
Mario A. Gongora ◽  
Adrian A. Hopgood
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Association Rules ◽  
Temporal Pattern ◽  
Rule Learning ◽  
Temporal Patterns ◽  
Temporal Association ◽  
Membership Functions ◽  
Fuzzy Association Rules ◽  
Novel Method

Abstract A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns are augmented into a dataset to analyse the method’s ability in a controlled experiment. It is shown that the method is capable of discovering temporal patterns, and the effect of Boolean itemset support on the efficacy of discovering temporal fuzzy association rules is presented.

Information on evolutionary age in redundancy of complex network

2019 ◽  
Vol 33 (27) ◽  
pp. 1950331
Author(s):  
Shiguo Deng ◽  
Henggang Ren ◽  
Tongfeng Weng ◽  
Changgui Gu ◽  
Huijie Yang
Keyword(s):  
Principal Component Analysis ◽  
Complex Networks ◽  
Metabolic Network ◽  
Complex Network ◽  
Cellular Networks ◽  
Topological Structure ◽  
Quantitative Measure ◽  
Principal Component ◽  
Evolutionary Information ◽  
Local Patterns

Evolutionary processes of many complex networks in reality are dominated by duplication and divergence. This mechanism leads to redundant structures, i.e. some nodes share most of their neighbors and some local patterns are similar, called redundancy of network. An interesting reverse problem is to discover evolutionary information from the present topological structure. We propose a quantitative measure of redundancy of network from the perspective of principal component analysis. The redundancy of a community in the empirical human metabolic network is negatively and closely related with its evolutionary age, which is consistent with that for the communities in the modeling protein–protein network. This behavior can be used to find the evolutionary difference stored in cellular networks.

scholarly journals CNFE-SE: a novel approach combining complex network-based feature engineering and stacked ensemble to predict the success of intrauterine insemination and ranking the features

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Sima Ranjbari ◽  
Toktam Khatibi ◽  
Ahmad Vosough Dizaji ◽  
Hesamoddin Sajadi ◽  
Mehdi Totonchi ◽  
...  
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Semen Quality ◽  
Intrauterine Insemination ◽  
Machine Learning Algorithms ◽  
Semen Parameters ◽  
Feature Engineering ◽  
Operating Characteristics ◽  
Scoring Method ◽  
Novel Approach

Abstract Background Intrauterine Insemination (IUI) outcome prediction is a challenging issue which the assisted reproductive technology (ART) practitioners are dealing with. Predicting the success or failure of IUI based on the couples' features can assist the physicians to make the appropriate decision for suggesting IUI to the couples or not and/or continuing the treatment or not for them. Many previous studies have been focused on predicting the in vitro fertilization (IVF) and intracytoplasmic sperm injection (ICSI) outcome using machine learning algorithms. But, to the best of our knowledge, a few studies have been focused on predicting the outcome of IUI. The main aim of this study is to propose an automatic classification and feature scoring method to predict intrauterine insemination (IUI) outcome and ranking the most significant features. Methods For this purpose, a novel approach combining complex network-based feature engineering and stacked ensemble (CNFE-SE) is proposed. Three complex networks are extracted considering the patients' data similarities. The feature engineering step is performed on the complex networks. The original feature set and/or the features engineered are fed to the proposed stacked ensemble to classify and predict IUI outcome for couples per IUI treatment cycle. Our study is a retrospective study of a 5-year couples' data undergoing IUI. Data is collected from Reproductive Biomedicine Research Center, Royan Institute describing 11,255 IUI treatment cycles for 8,360 couples. Our dataset includes the couples' demographic characteristics, historical data about the patients' diseases, the clinical diagnosis, the treatment plans and the prescribed drugs during the cycles, semen quality, laboratory tests and the clinical pregnancy outcome. Results Experimental results show that the proposed method outperforms the compared methods with Area under receiver operating characteristics curve (AUC) of 0.84 ± 0.01, sensitivity of 0.79 ± 0.01, specificity of 0.91 ± 0.01, and accuracy of 0.85 ± 0.01 for the prediction of IUI outcome. Conclusions The most important predictors for predicting IUI outcome are semen parameters (sperm motility and concentration) as well as female body mass index (BMI).

scholarly journals Drift Analysis and Evolutionary Algorithms Revisited

2018 ◽  
Vol 27 (4) ◽  
pp. 643-666 ◽  
Author(s):  
J. LENGLER ◽  
A. STEGER
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Random Search ◽  
Optimization Algorithms ◽  
Simple Algorithm ◽  
Linear Functions ◽  
Search Point ◽  
Drift Analysis ◽  
Fixed Constant ◽  
Greedy Optimization

One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a function f: {0,1}n → ℝ. The algorithm starts with a random search point ξ ∈ {0,1}n, and in each round it flips each bit of ξ with probability c/n independently at random, where c > 0 is a fixed constant. The thus created offspring ξ' replaces ξ if and only if f(ξ') ≥ f(ξ). The analysis of the runtime of this simple algorithm for monotone and for linear functions turned out to be highly non-trivial. In this paper we review known results and provide new and self-contained proofs of partly stronger results.

Sign in / Sign up

Export Citation Format

Share Document