Reactive power planning is vital for maintaining the voltage stability of power systems and evolutionary algorithms are highly useful for achieving this task. This paper compares the effectiveness of the differential ...
详细信息
Reactive power planning is vital for maintaining the voltage stability of power systems and evolutionary algorithms are highly useful for achieving this task. This paper compares the effectiveness of the differential evolution (DE) and evolutionary programming (EP) algorithms in optimizing the reactive power planning of power systems under line outage contingency conditions. DE is efficient in exploration through the search space of the problem, while EP is simple and easy to implement. The low cost but fast response thyristor-controlled series capacitor (TCSC) flexible alternating current transmission system (FACTS) device is incorporated to control the power flows. The optimal settings of the control variables of the generator voltages, transformer tap settings, and location and parameter settings of the TCSC are considered for reactive power planning and the resultant reactive power reserves. The effectiveness of the proposed work is tested on the IEEE-30 Bus test system under the most critical line outage condition.
Obtaining comprehensible classifiers may be as important as achieving high accuracy in many real-life applications such as knowledge discovery tools and decision support systems. This paper introduces an efficient Evo...
详细信息
Obtaining comprehensible classifiers may be as important as achieving high accuracy in many real-life applications such as knowledge discovery tools and decision support systems. This paper introduces an efficient evolutionary programming algorithm for solving classification problems by means of very interpretable and comprehensible IF-THEN classification rules. This algorithm, called the Interpretable Classification Rule Mining (ICRM) algorithm, is designed to maximize the comprehensibility of the classifier by minimizing the number of rules and the number of conditions. The evolutionary process is conducted to construct classification rules using only relevant attributes, avoiding noisy and redundant data information. The algorithm is evaluated and compared to nine other well-known classification techniques in 35 varied application domains. Experimental results are validated using several non-parametric statistical tests applied on multiple classification and interpretability metrics. The experiments show that the proposal obtains good results, improving significantly the interpretability measures over the rest of the algorithms, while achieving competitive accuracy. This is a significant advantage over other algorithms as it allows to obtain an accurate and very comprehensible classifier quickly. (C) 2013 Elsevier Inc. All rights reserved.
A major challenge when attempting to model biochemical reaction networks within the cell is that the dimensionality can become huge, where a large number of molecular species can be involved even in relatively small n...
详细信息
A major challenge when attempting to model biochemical reaction networks within the cell is that the dimensionality can become huge, where a large number of molecular species can be involved even in relatively small networks. This investigation attempts to infer models of these networks using a co-evolutionary algorithm that reverse engineers differential equation models of the target system from time-series data. The algorithm not only estimates the system parameters, but also the symbolic structure of the network. To reduce the problem of dimensionality, the algorithm uses a partitioning method while integrating candidate models in order to decouple system equations. In addition, the conventional evolutionary algorithm has been modified and extended to include a technique called 'eng-genes', where candidate models are built up from fundamental mathematical terms derived from knowledge about the target system a priori. This technique essentially focuses the search on more biologically plausible models. The approach is demonstrated on several example reaction networks. The results show that the eng-genes method of limiting the term pool using a priori knowledge improves the convergence of the reverse engineering process compared with the conventional method, resulting in more accurate and transparent models.
Here, we propose an evolutionary algorithm (i.e., evolutionary programming) for tuning the weights of a chess engine. Most of the previous work in this area has normally adopted co-evolution (i.e., tournaments among v...
详细信息
Here, we propose an evolutionary algorithm (i.e., evolutionary programming) for tuning the weights of a chess engine. Most of the previous work in this area has normally adopted co-evolution (i.e., tournaments among virtual players) to decide which players will pass to the following generation, depending on the outcome of each game. In contrast, our proposed method uses evolution to decide which virtual players will pass to the next generation based on the number of positions solved from a number of chess grandmaster games. Using a search depth of 1-ply, our method can solve 40.78% of the positions evaluated from chess grandmaster games (this value is higher than the one reported in the previous related work). Additionally, our method is capable of solving 53.08% of the positions using a historical mechanism that keeps a record of the "good" virtual players found during the evolutionary process. Our proposal has also been able to increase the competition level of our search engine, when playing against the program Chessmaster (grandmaster edition). Our chess engine reached a rating of 2404 points for the best virtual player with supervised learning, and a rating of 2442 points for the best virtual player with unsupervised learning. Finally, it is also worth mentioning that our results indicate that the piece material values obtained by our approach are similar to the values known from chess theory. (C) 2013 Elsevier B.V. All rights reserved.
This paper presents a wire antenna for multi-band WLAN application, designed using the Structure-Based evolutionary programming, and having a very simple geometry. The antenna has been analysed with NEC-2 during the e...
详细信息
ISBN:
(纸本)9781467324809
This paper presents a wire antenna for multi-band WLAN application, designed using the Structure-Based evolutionary programming, and having a very simple geometry. The antenna has been analysed with NEC-2 during the evolutionary process, and the outcome of the procedure shows a very good performance, with a -10dB bandwidth that covers the required frequencies for multi-band WLAN applications (2.4/5.2/5.8 GHz) and beyond, and an end-fire gain greater than 11 dB.
This paper presents a wire antenna for multi-band WLAN application, designed using the Structure-Based evolutionary programming, and having a very simple geometry. The antenna has been analysed with NEC-2 during the e...
详细信息
ISBN:
(纸本)9781467322324;9781467322300
This paper presents a wire antenna for multi-band WLAN application, designed using the Structure-Based evolutionary programming, and having a very simple geometry. The antenna has been analysed with NEC-2 during the evolutionary process, and the outcome of the procedure shows a very good performance, with a -10dB bandwidth that covers the required frequencies for multi-band WLAN applications (2.4/5.2/5.8 GHz) and beyond, and an end-fire gain greater than 11 dB.
evolutionary programming incorporating neural network (EPNN) is proposed to obtain the solution of Transient Stability Constrained Optimal Power Flow (TSCOPF) in this paper. evolutionary programming (EP) is selected a...
详细信息
ISBN:
(纸本)9781424417636
evolutionary programming incorporating neural network (EPNN) is proposed to obtain the solution of Transient Stability Constrained Optimal Power Flow (TSCOPF) in this paper. evolutionary programming (EP) is selected as a main optimizer while the neural network is a supplementary tool to enhance the computational speed by screening out individuals, which have very high or low degrees of stability. Swing equation and limit of rotor angle deviation with respect to centre of inertia (COI) are treated as additional constraints in transient stability concern. The generator fuel cost minimization is selected as the objective function for TSCOPF. The proposed method is tested on IEEE 30-bus system with three different generator cost curves to account for the combined cycle generating unit and valve point loading effect of a thermal generating unit. A three-phase fault at a specific transmission line is considered as a single contingency. The simulation results show that the proposed method is capable of searching for the optimal or near optimal solution of TSCOPF. Moreover, the exploitation of the neural network leads to huge computational time saving due to absence of time-domain simulation for some individuals during EP search.
This paper studies evolutionary programming and adopts reinforcement learning theory to learn individual mutation operators. A novel algorithm named RLEP (evolutionary programming based on Reinforcement Learning) is p...
详细信息
This paper studies evolutionary programming and adopts reinforcement learning theory to learn individual mutation operators. A novel algorithm named RLEP (evolutionary programming based on Reinforcement Learning) is proposed. In this algorithm, each individual learns its optimal mutation operator based on the immediate and delayed performance of mutation operators. Mutation operator selection is mapped into a reinforcement learning problem. Reinforcement learning methods are used to learn optimal policies by maximizing the accumulated rewards. According to the calculated Q function value of each candidate mutation operator, an optimal mutation operator can be selected to maximize the learned Q function value. Four different mutation operators have been employed as the basic candidate operators in RLEP and one is selected for each individual in different generations. Our simulation shows the performance of RLEP is the same as or better than the best of the four basic mutation operators. (c) 2007 Elsevier Inc. All rights reserved.
evolutionary programming (EP) is one of the most important methods for numerical optimization. Its main technique is the combi- nation of mutations and the self-adaption mechanism. In the past years, studies on EP foc...
详细信息
evolutionary programming (EP) is one of the most important methods for numerical optimization. Its main technique is the combi- nation of mutations and the self-adaption mechanism. In the past years, studies on EP focused on how to improve the effciency of muta- tions with different probability distributions, and few of them touched on the question that the self-adaption mechanism did not work sometimes, but simply followed the original suggestion. So far, no experimental results have shown why this is a question. This paper firstly gives a primary analysis on the behavior of the self-adaption mechanism, and then presents experimental evidences to show why its adaptive ability is doubtful.
This paper deals with the problem of the cell size determination in WCDMA-based mobile networks, in multiservice environments. The objective is to obtain the maximum cell size, given a set of services with their corre...
详细信息
This paper deals with the problem of the cell size determination in WCDMA-based mobile networks, in multiservice environments. The objective is to obtain the maximum cell size, given a set of services with their corresponding constraints, in terms of quality of service (QoS), binary rate, etc. To achieve this, we have to find the optimal services' load factors which maximizes the cell radius of the system under traffic criteria. We apply an evolutionary programming algorithm to solve the problem, which codifies and evolves the services' load factors. We have compared our approach with an existing algorithm in several multiservice scenarios, improving its solutions in terms of cell size. (c) 2007 Elsevier Ltd. All rights reserved.
暂无评论