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.

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.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.

COLOR IMAGE QUANTIZATION WITH EVOLUTIONARY PROGRAMMING

An evolutionary programming based algorithm was proposed for color image quantization. A novel hybrid mutation operator was disigned to improve the quantization quality, and a stochastic sampling scheme was also presented for saving the run time. The experimental results demonstrate the superior performance of the proposed algorithm in comparison with the GA based algorithm.

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.

Evolutionary Design of Fault-Tolerant Digital Circuit Based on Cartesian Genetic Programming

In many areas, reliability of the digital circuits has become the key factor to restrict circuit development. Fault-tolerant design is the commonly used method to improve the reliability of digital circuits. The current fault-tolerant design methods are based on triple modular redundancy( TMR) or multiple modular redundancy( MMR). These redundancy designs rely on the experience of the designers,and the designed circuits have poor adaptabilities to a complex environment. However, evolutionary design of digital circuits does not rely on prior knowledge. During the evolution, some novel and optimal circuit topologies can be found, and the evolved circuits can feature strong adaptive capacities. Based on Cartesian genetic programming( CGP), a novel method for designing fault-tolerant digital circuits by evolution is proposed,key steps of the evolution are introduced,influences of function sets on evolution are investigated,and as a preliminary result,an evolved full adder with high fault-tolerance is shown.

Evolutionary Programming for Systematic Evaluation of Aquifers: A Case Study from Dholera, Cambay Basin, Gujarat, India

Joint inversion of different potentials improves subsurface model resolution. In this paper seismic refraction and magnetotelluric data are used to understand near subsurface features of Dholera, Gujarat, India. An extensive seismic and magnetotelluric survey was carried out in Dholera in order to delineate subsurface presence of aquifers. Ray Inversion for Near Surface Estimation (RINSE) is used for inversion of Dholera seismic data. The inversion output of seismic data is used as seed points for resistivity inversion of anomalies. Inversion of resistivity data is done using evolutionary programing method which is also a type of genetic algorithm. Here the optimization is done using four major steps, of evolutionary programing namely population generation, fitness function, crossover and mutation. This paper also compares the similarities between the natural and geophysical optimization. A Low Velocity Layer is identified up to a depth of 11 m from seismic refraction method. Three layers are identified after the interpretation of seismic and resistivity data. The average thicknesses of Layers one and two are calculated as 3.558 and 6.533 respectively.

An Evolutionary Algorithm Based on a New Decomposition Scheme for Nonlinear Bilevel Programming Problems

In this paper, we focus on a class of nonlinear bilevel programming problems where the follower’s objective is a function of the linear expression of all variables, and the follower’s constraint functions are convex with respect to the follower’s variables. First, based on the features of the follower’s problem, we give a new decomposition scheme by which the follower’s optimal solution can be obtained easily. Then, to solve efficiently this class of problems by using evolutionary algorithm, novel evolutionary operators are designed by considering the best individuals and the diversity of individuals in the populations. Finally, based on these techniques, a new evolutionary algorithm is proposed. The numerical results on 20 test problems illustrate that the proposed algorithm is efficient and stable.

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.

MINIMUM ATTRIBUTE CO-REDUCTION ALGORITHM BASED ON MULTILEVEL EVOLUTIONARY TREE WITH SELF-ADAPTIVE SUBPOPULATIONS

Attribute reduction is an important process in rough set theory.Finding minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some cases.In this paper,an efficient minimum attribute reduction algorithm is proposed based on the multilevel evolutionary tree with self-adaptive subpopulations.A model of multilevel evolutionary tree with self-adaptive subpopulations is constructed,and interacting attribute sets are better decomposed into subsets by the self-adaptive mechanism of elitist populations.Moreover it can self-adapt the subpopulation sizes according to the historical performance record so that interacting attribute decision variables are captured into the same grouped subpopulation,which will be extended to better performance in both quality of solution and competitive computation complexity for minimum attribute reduction.The conducted experiments show the proposed algorithm is better on both efficiency and accuracy of minimum attribute reduction than some representative algorithms.Finally the proposed algorithm is applied to magnetic resonance image(MRI)segmentation,and its stronger applicability is further demonstrated by the effective and robust segmentation results.

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.

Optimal coordination of directional over current relays using evolutionary programming

Co-ordination of directional over current relays(DOCR) requires the selection and setting of relays so as to sequentially isolate only that portion of the power system where an abnormality has occurred.The problem of coordinating protective relays in electrical power systems consists of selecting suitable settings such that their fundamental protective function is met,given operational requirements of sensitivity,selectivity,reliability and speed.Directional over current relays are best suited for protection of an interconnected sub-station transmission system.One of the major problems associated with this type of protection is the difficulty in coordinating relays.To insure proper coordination,all the main/back up relay pairs must be determined.This paper presents an effective algorithm to determine the minimum number of break points and main/back up relay pairs using relative sequence matrix(RSM).A novel optimization technique based on evolutionary programming was developed using these main/back up relay pairs for directional over current relay coordination in multi-loop networks.Since the problem has multi-optimum points,conventional mathematics based optimization techniques may sometimes fail.Hence evolutionary programming(EP) was used,as it is a stochastic multi-point search optimization algorithm capable of escaping from the local optimum problem,giving a better chance of reaching a global optimum.The method developed was tested on an existing 6 bus,7 line system and better results were obtained than with conventional methods.

A Tentative Research on Complexity of Automatic Programming

In this paper, based on the following theoretical framework: Evolutionary Algorithms + Program Structures = Automatic Programming , some results on complexity of automatic programming for function modeling is given, which show that the complexity of automatic programming is an exponential function of the problem dimension N , the size of operator set ｜F｜ and the height of the program parse tree H . Following this results, the difficulties of automatic programming are discussed. Some function models discovered automatically from database by evolutionary modeling method are given, too.

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.

基于演化森林的电力系统暂态稳定性评估

随着可再生能源和电力电子设备的大量接入,电力系统惯量不断下降。此外,新型电力系统复杂的耦合特性和时变因素也对暂态稳定评估提出了更高的要求。为进一步提升暂态稳定评估模型对失稳样本的识别能力,提出了一种基于演化森林算法的电力系统暂态稳定评估模型。通过三段式特征选择策略,构建出反映电力系统运行状态的输入样本集。在改造后的新英格兰10机39节点系统上对所提出的方法进行分析与验证。实验结果表明,该模型具有较强的分类性能和良好的可解释性。

大规模突发事件下基于“派单+抢单”的平台配送模式优化模型

大规模突发事件会导致平台配送面临订单模糊、车辆配送路网复杂、取送货序列配对困难等现实问题。文章提出一种基于平台“派单+抢单”的组合运营模式,充分发挥派单模式高效匹配配送员-订单,以及抢单模式有效提升平台配送灵活性的优势,以配送成本最低、客户满意度最高为优化目标,建立多目标混合整数规划模型,并设计基于GA-SA的混合进化算法对配货员的配送路径进行合理规划,保障商家、客户多对关系下的货物取送有序。数值实验表明,所设计的优化算法能够有效解决抢单模式下的即时配送车辆路径问题,具有很好的效率和应用性。

Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis

Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization

Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.