An Evolutionary Programming Based on Hidden Neuron Modifiable Radial Basis Function Networks

In this paper, an improved radial basis function networks named hidden neuron modifiable radial basis function (HNMRBF) networks is proposed for target classification, and evolutionary programming (EP) is used as a learning algorithm to determine and modify the hidden neuron of HNMRBF nets. The result of passive sonar target classification shows that HNMRBF nets can effectively solve the problem of traditional neural networks, i. e. learning new target patterns on line will cause forgetting of the old patterns.

Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two main categories: optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimi2ation algorithms of trajectory planning. In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functions are designed based on the specific weight coefficient method and ' ideal point strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot,the high-quality solutions are found at a lower cost.

MDA-TOEPGA:A novel method to identify miRNA-disease association based on two-objective evolutionary programming genetic algorithm

The association between miRNA and disease has attracted more and more attention.Until now,existing methods for identifying miRNA related disease mainly rely on top-ranked association model,which may not provide a full landscape of association between miRNA and disease.Hence there is strong need of new computational method to identify the associations from miRNA group view.In this paper,we proposed a framework,MDA-TOEPGA,to identify miRNAdisease association based on two-objective evolutionary programming genetic algorithm,which identifies latent miRNAdisease associations from the view of functional module.To understand the miRNA functional module in diseases,the case study is presented.We have been compared MDA-TOEPGA with several state-of-the-art functional module algorithm.Experimental results showed that our method cannot only outperform classical algorithms,such as K-means,IK-means,MCODE,HC-PIN,and ClusterONE,but can also achieve an ideal overall performance in terms of a composite score consisting of f1,Sensitivity,and Accuracy.Altogether,our study showed that MDA-TOEPGA is a promising method to investigate miRNA-disease association from the landscapes of functional module.

Web mining based on chaotic social evolutionary programming algorithm

With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.

Dynamic Behavior Modeling in Multi-Agent System By Evolutionary Programming

In a multi-agent system, each agent must adapt itself to the environment and coordinate with other agents dynamically. TO predict or cooperate with the behavior of oiller agents. An agent should dynamically establish and evolve the cooperative behavior model of itself. In this paper, we represent the behavior model of an agent as a f-mite state machine and propose a new method of dynamically evolving the behavior model of an agent by evolutionary programming.

Study on Portfolios Models with Evolutionary Programming

This paper is trying to make some improvement to Markowitz＇s Mean-Variance Model. In this paper, we try to solve the model of portfolio by using Evolutionary Programming under the condition of the covariance matrix which is a non-positive matrix, and design a new method which can improve Markowitz＇s model. At last, we give an illustrative example with the new method.

AN APPLICATION OF EVOLUTIONARY PROGRAMMING IN FIR FILTER DESIGN WITH FREQUENCY SAMPLING METHOD

Frequency sampling is one of the popular methods in FIR digital filter design. In the frequency sampling method the value of transition band samples, which are usually obtained by consulting a table, must be determined in order to make the attenuation within the stopband maximal. However, the value obtained by searching for table can not be ensured to be optimal. Evolutionary programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems. In this paper a new application of EP to frequency sampling method is introduced. Two examples of lowpass and bandpass FIR filters are presented, and the steps of EP realization and experimental results are given. Experimental results show that the value of transition band samples obtained by EP can be ensured to be optimal and the performance of the filter is improved.

Parallel power system restoration planning using heuristic initialization and discrete evolutionary programming

This paper proposes a sectionalizing planning for parallel power system restoration after a complete system blackout.Parallel restoration is conducted in order to reduce the total restoration process time.Physical and operation knowledge of the system,operating personnel experience,and computer simulation are combined in this planning to improve the system restoration and serve as a guidance for system operators/planners.Sectionalizing planning is obtained using discrete evolutionary programming optimization method assisted by heuristic initialization and graph theory approach.Set of transmission lines that should not be restored during parallel restoration process(cut set)is determined in order to sectionalize the system into subsystems or islands.Each island with almost similar restoration time is set as an objective function so as to speed up the resynchronization of the islands.Restoration operation and constraints(black start generator availability,load-generation balance and maintaining acceptable voltage magnitude within each island)is also takeninto account in the course of this planning.The method is validated using the IEEE 39-bus and 118-bus system.Promising results in terms of restoration time was compared to other methods reported in the literature.

Evolutionary programming CLEAN algorithm for UWB localization images of contiguous targets

In this article, a novel scattering center extraction method using genetic algorithm is proposed to deal with the ultra-wideband （UWB） localization image, which is called evolutionary programming （EP） CLEAN algorithm. Because of the UWB characters, the ideal point scattering model and EP method are used in the algorithm for optimizing the UWB localization images. After introducing the algorithm detail, the actual model is used to realize the EP CLEAN algorithm. Compared with the conventional localization imaging algorithm, this algorithm has advantages fitting the UWB characters such as accuracy, robustness, and better resolution, which are verified by the numerical simulations. Therefore the EP CLEAN algorithm could improve localization image performance to expand the UWB technique application.

Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.

A Novel Evolutionary Feedforward Neural Network with Artificial Immunology

A hybrid algorithm to design the multi layer feedforward neural network was proposed. Evolutionary programming is used to design the network that makes the training process tending to global optima. Artificial immunology combined with simulated annealing algorithm is used to specify the initial weight vectors, therefore improves the probabiligy of training algorithm to converge to global optima. The applications of the neural network in the modulation style recognition of analog modulated rader signals demonstrate the good performance of the network.

ERBF network with immune clustering

Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and initial positions of the RBF centers according to input data set; then the RBF network is trained with EP that tends to global optima. The application of the hybrid algorithm in multiuser detection problem demonstrates that the RBF network trained with the algorithm has simple network structure with good generalization ability.

EP-based Optimization of Strategic Safety Stocks in Reverse Logistics Systems

A new heuristic strategic safety stock optimization is proposed based on evolutionary programming(EP) algorithm for reverse logistics supply chain systems. The supply chain is described with a network and the modeling complexity of external as well as internal product returns and reuses of supply chains is considered with. It is assumed that customer demands for final products are uncertain. Products are randomly returned from external customers to stock points. The optimization model is established and three different cases with different structures are used to show the strength of the algorithm.

A Self-Adaptive Control Method for Uncertainty Systems Based on ANN with AEP

A self-adaptive control method is proposed based on an artificial neural network(ANN)with accelerated evolutionary programming(AEP)algorithm.The neural network is used to model the uncertainty process,from which the teacher signals are produced online to regulate the parameters of the controller.The accelerated evolutionary programming is used to train the neural network.The experiment results show that the method can obviously improve the dynamic performance of uncertainty systems.

Evolutionary computation in zoology and ecology

Evolutionary computational methods have adopted attributes of natural selection and evolution to solve problems in computer science, engineering, and other fields. The method is growing in use in zoology and ecology. Evolutionary principles may be merged with an agent-based modeling perspective to have individual animals or other agents compete. Four main categories are discussed： genetic algorithms, evolutionary programming, genetic programming, and evolutionary strategies. In evolutionary computation, a population is represented in a way that allows for an objective function to be assessed that is relevant to the problem of interest. The poorest performing members are removed from the population, and remaining members reproduce and may be mutated. The fitness of the members is again assessed, and the cycle continues until a stopping condition is met. Case studies include optimizing： egg shape given different clutch sizes, mate selection, migration of wildebeest, birds, and elk, vulture foraging behavior, algal bloom prediction, and species richness given energy constraints. Other case studies simulate the evolution of species and a means to project shifts in species ranges in response to a changing climate that includes competition and phenotypic plasticity. This introduction concludes by citing other uses of evolutionary computation and a review of the flexibility of the methods. For example, representing species＇ niche spaces subject to selective pressure allows studies on cladistics, the taxon cycle, neutral versus niche paradigms, fundamental versus realized niches, community structure and order of colonization, invasiveness, and responses to a changing climate.

A solution to the unit commitment problem a review

Unit commitment （UC） is an optimization problem used to determine the operation schedule of the generating units at every hour interval with varying loads under different constraints and environments. Many algorithms have been invented in the past five decades for optimization of the UC problem, but still researchers are working in this field to find new hybrid algorithms to make the problem more realistic. The importance of UC is increasing with the constantly varying demands. There- fore, there is an urgent need in the power sector to keep track of the latest methodologies to further optimize the working criterions of the generating units. This paper focuses on providing a clear review of the latest techniques employed in optimizing UC problems for both stochastic and deterministic loads, which has been acquired from many peer reviewed published papers. It has been divided into many sections which include various constraints based on profit, security, emission and time. It emphasizes not only on deregulated and regulated environments but also on renewable energy and distributed generating systems. In terms of contributions, the detailed analysis of all the UC algorithms has been discussed for the benefit of new researchers interested in working in this field.

Review on application and comparison of metaheuristic techniques to multi-area economic dispatch problem

This paper presents both application and comparison of the metaheuristic techniques to multi-area economic dispatch(MAED)problem with tie line constraints considering transmission losses,multiple fuels,valve-point loading and prohibited operating zones.The metaheuristic techniques such as differential evolution,evolutionary programming,genetic algorithm and simulated annealing are applied to solve MAED problem.These metaheuristic techniques for MAED problem are evaluated on three different test systems,both small and large,involving varying degree of complexity and the results are compared against each other.

Stability of the Fe12O12 cluster

Superexchange effects play an important role in the determination of crystal structures; however, there has been much less reported on how they determine the stability of dusters. Using evolutionary search strategies and DFT＋U （density functional theory with the Hubbard U correction） calculations, we investigate the global minimum-energy structures of Fe12O12 clusters. Among predicted Fe12O12 dusters, a cage-shaped Fe12O12 cluster with unexpected stability was observed. In addition, the bare Fe12O12 cluster is shown to possess an extremely large energy gap （2.00 eV）, which is greater than that of C60, Au20 and Al13- clusters. Using a Heisenberg model, we traced the origin of the unexpected stability of the bare Fe12O12 cluster to magnetic competition between the nearestneighbor exchange constant h and the next-nearest neighbor exchange constant J2 that was induced by the superexchange interactions. The bare Fe12O12 cluster is thus a unique molecule that is stable and chemically inert.