Optimal reconfiguration of Radial Distribution System (RDS) is done under the umbrella of Supervisory Control and Data Acquisition (SCADA) systems to achieve the best voltage profile and minimal kW losses amongst seve...
详细信息
Optimal reconfiguration of Radial Distribution System (RDS) is done under the umbrella of Supervisory Control and Data Acquisition (SCADA) systems to achieve the best voltage profile and minimal kW losses amongst several objectives. This problem requires the determination of the best combination of feeders from each loop in the RDS to be switched out such that the resulting RDS gives the optimal performance in the chosen circumstance. The problem has a discontinuous solution space and certain problem variables assume discrete values of zero or one. This paper proposes a method that uses fuzzy adaptation of evolutionary programming (FEP) as a solution technique. FEP technique has been chosen as it is particularly suited while solving optimization problems with discontinuous solution space and when the global optimum is desired. Fuzzy adaptation of EP is necessitated while considering optimization of multiple objectives. The proposed method is tested on established RDS and results are presented. (C) 2003 Elsevier Ltd. All rights reserved.
Cost of reliability of optimal distribution system planning is considered. The reliability cost model has been derived as a linear function of line no flows for evaluating the outages. The objective is to minimise the...
详细信息
Cost of reliability of optimal distribution system planning is considered. The reliability cost model has been derived as a linear function of line no flows for evaluating the outages. The objective is to minimise the total cost including the outage cost, feeder resistive loss, and fixed investment cost. evolutionary programming was used to solve the very complicated mixed-integer, highly nonlinear and nondifferential problem. A real distribution network was modelled as the sample system for tests. There is also a higher opportunity to obtain the global optimum during the EP process.
Although initially conceived for evolving finite state machines, evolutionary programming (EP), in its present form, is largely used as a powerful real parameter optimizer. For function optimization. EP mainly relies ...
详细信息
Although initially conceived for evolving finite state machines, evolutionary programming (EP), in its present form, is largely used as a powerful real parameter optimizer. For function optimization. EP mainly relies on its mutation operators. Over past few years several mutation operators have been proposed to improve the performance of EP on a wide variety of numerical benchmarks. However, unlike real-coded GAs, there has been no fitness-induced bias in parent selection for mutation in EP. That means the i-th population member is selected deterministically for mutation and creation of the i-th offspring in each generation. In this article we propose a p-best mutation scheme for EP where any one from the p (p is an element of [1,2, ... ,mu], where mu denotes population size) top-ranked population-members (according to fitness values) is selected randomly for mutation. The scheme is invoked with 50% probability with each index in the current population, i.e. the i-th offspring can now be obtained either by mutating the i-th parent or by mutating a randomly selected individual from the p top-ranked vectors. The percentage of best members is made dynamic by decreasing p in from mu/2 to 1 with generations to favor explorative behavior at the early stages of search and exploitation during the later stages. We investigate the effectiveness of introducing controlled bias in parent selection in conjunction with an Adaptive Fast EP (AFEP), where the value of a strategy parameter is updated based on the previous records of successful mutations by the same parameter. Comparison with the recent and best-known versions of EP over 25 benchmark functions from the CEC (Congress on evolutionary Computation) 2005 test-suite for real-parameter optimization and two other engineering optimization problems reflects the statistically validated superiority of the new scheme in terms of final accuracy, speed, and robustness. Comparison with AFEP without p-best mutation demonstrates the imp
This paper presents a new approach to solve the hydro-thermal unit commitment problem using Simulated Annealing embedded evolutionary programming approach. The objective of this paper is to find the generation schedul...
详细信息
This paper presents a new approach to solve the hydro-thermal unit commitment problem using Simulated Annealing embedded evolutionary programming approach. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. A utility power system with 11 generating units in India demonstrates the effectiveness of the proposed approach;extensive studies have also been performed for different IEEE test systems consist of 25, 44 and 65 units. Numerical results are shown comparing the cost solutions and computation time obtained by conventional methods. (C) 2011 Elsevier Ltd. All rights reserved.
This letter introduces a new multiuser detection scheme which uses evolutionary programming (EP) to detect the user bits based on the maximum-likelihood decision rule. The major advantage of the proposed detector is t...
详细信息
This letter introduces a new multiuser detection scheme which uses evolutionary programming (EP) to detect the user bits based on the maximum-likelihood decision rule. The major advantage of the proposed detector is that it has a lower computational complexity compared to other popular evolutionary-algorithm-based detectors. The simulation results show that the EP has always converged to the optimum solution with a small number of generations. The simulated average computational time performance demonstrates that this approach achieves practical ML performance with polynomial complexity in the number of users.
This paper presents an approach to solve the unit commitment problem using a newly developed Multi-agent evolutionary programming incorporating Priority List optimisation technique (MAEP-PL). The objective of this stu...
详细信息
This paper presents an approach to solve the unit commitment problem using a newly developed Multi-agent evolutionary programming incorporating Priority List optimisation technique (MAEP-PL). The objective of this study is to search for generation scheduling such that the total operating cost can be minimised when subjected to a variety of constraints, while at the same time reducing its computational time. The proposed technique assimilates the concepts of Priority Listing (PL), Multi-agent System (MAS) and evolutionary programming (EP) as its basis. In the proposed technique, deterministic PL technique is applied to produce a population of initial solutions. The search process is refined using heuristic EP-based algorithm with multi-agent approach to produce the final solution. The developed technique is tested on ten generating units test system for a 24-h scheduling period, and the results are compared with the standard evolutionary programming (EP), evolutionary programming with Priority Listing (EP-PL) and Multi-agent evolutionary programming (MAEP) optimisation techniques. From the obtained results and the comparative studies, it was found that the proposed MAEP-PL optimisation technique is able to solve the unit commitment problem where the total daily generation cost is effectively minimised and the computation time is reduced as compared to other techniques.
A novel evolutionary programming algorithm, which not only has a rapid convergence rate but also maintains the diversity of the population so as to escape from local optima, is proposed in this paper. In addition, a m...
详细信息
A novel evolutionary programming algorithm, which not only has a rapid convergence rate but also maintains the diversity of the population so as to escape from local optima, is proposed in this paper. In addition, a multi-modal test function is presented and is used to indicate the efficiency of this algorithm. Several application examples are given to show its usefulness. (C) 1999 Elsevier Science Ltd. All rights reserved.
In this paper, an evolutionary programming-based clustering algorithm is proposed. The algorithm effectively groups a given set of data into an optimum number of clusters. The proposed method is applicable for cluster...
详细信息
In this paper, an evolutionary programming-based clustering algorithm is proposed. The algorithm effectively groups a given set of data into an optimum number of clusters. The proposed method is applicable for clustering tasks where clusters are crisp and spherical. This algorithm determines the number of clusters and the cluster centers in such a way that locally optimal solutions are avoided. The result of the algorithm does not depend critically on the choice of the initial cluster centers. (C) 1997 Published by Elsevier Science B.V.
Economic load dispatch (ELD) and economic emission dispatch (EED) have been applied to obtain optimal fuelcost and optimal emission of generating units, respectively. Combined economic emission dispatch (CEED) problem...
详细信息
Economic load dispatch (ELD) and economic emission dispatch (EED) have been applied to obtain optimal fuelcost and optimal emission of generating units, respectively. Combined economic emission dispatch (CEED) problem is obtained by considering both the economy and emission objectives. This biobjective CEED problem is converted into a single objective function using a price penalty factor approach. A novel modified price penalty factor is proposed to solve the CEED problem. In this paper, evolutionary computation (EC) methods such as genetic algorithm (GA), micro GA, (NIGA), and evolutionary programming (EP) are applied to obtain ELD solutions for three-, six-, and 13-unit systems. Investigations showed that EP? was better arnong EC methods in solving the ELD problem. EP-based CEED. problem has been tested on IEEE 14-, 30-, and 118-bus systems with and without line flow constraints. A nonlinear scaling factor is also included in EP algorithm to improve the convergence performance for the 13 units and IEEE test systems. The solutions obtained are quite encouraging and useful in the economic emission environment.
A novel one-dimensional scattering centre extraction method using an evolutionary programming and undamped exponential model is proposed. The method is robust and fast. Moreover. no resolution problems appeared in FFT...
详细信息
A novel one-dimensional scattering centre extraction method using an evolutionary programming and undamped exponential model is proposed. The method is robust and fast. Moreover. no resolution problems appeared in FFT-based CLEAN. Experimental results show that the proposed algorithm can be successfully applied to one-dimensional scattering centre extraction.
暂无评论