Essay: THE EVOLUTIONARY PROGRAMMING TECHNIQUE

Essay details:

  • Subject area(s): Computer science essays
  • Reading time: 9 minutes
  • Price: Free download
  • Published on: August 29, 2019
  • File format: Text
  • Number of pages: 2
  • THE EVOLUTIONARY PROGRAMMING TECHNIQUE Overall rating: 0 out of 5 based on 0 reviews.

Text preview of this essay:

This page of the essay has 1089 words. Download the full version above.

(10) Presented evolutionary algorithm as efficient techniques used to take care of optimization faults, in which the search is divided into three groups: evolutionary programming, genetics algorithm and evolutionary strategies. These heuristics have been generally utilized because of their relative preferences to other optimization techniques, for example, they don’t require a predefined kind of objective capacity; they are productive in the search for the optimal planning arrangement in moderately big search spaces; and they can be easily adjusted to changes in the problem variables.

As a few others heuristic systems used to determine the combination optimization placement and sizing problems, the evolutionary algorithm do not promise that the best solution set up is the general optimal of the problem; on the other hand, it is very likely that the perfect solution is an acceptable approximation of that optimal. Requiring evolutionary algorithm can be applied to solve continuous problems and other previous discretization. The evolutionary programming is a simulation of the development procedure of a populace of people along various generations. In this population, every individual serve as only possible solution of the optimal placement problem. The best adjusted people will be sustained, as the generation pass by, the best adjusted people will be sustained, i.e., the solution that present the best objective capacity qualities pass to the subsequent generation.

(10) Suggested four stages that ought to be taken after, generally to design an evolutionary programming algorithm:

* Solution codification must be determined;

* Creation of initial population is needed;

* characterize the combination guideline;

* characterize the selection guideline.

The algorithm is iterative and the most utilized, the combination standard produces new individuals from others that are already in existent. The evolutionary programming commonly uses only single operator in the combination procedure and simulation is common. Simulation produces a new individual by an irregular perturbation in the attributes of an arbitrarily chosen individual. The selection guideline is utilized to figure out which individual of a generation will go to the following one and the wellness of an individual is characterized as the objective function used for the solution codification.

Useful paper 2

[105] was firstly introduce EP, and later presented ES and GA.[45]GA is implemented by DRG to determine productively the optimal placement and sizing.GA is different from other conventional search algorithms due to its high capacity searching and optimization technique based on a model of evolution adaptation in nature. GA does not require subsidiaries or other assistant information and it works with a populace of individuals and every individual stands for a solution.GA is assessed due to its solution quality and its fitness, which is estimated by utilizing fitness function.in DRG position according to (108), this fitness is determined based on reduction in real power losses, providing optimal size, to decrease investments and operational costs. From the various test results,[40] explain HRA performance over the conventional method. An enhanced Hereford Ranch Algorithm (HRA) was executed in 1998 with one objective function to reduce active power loss and contrasted with second order techniques and traditional GA. Khatod et al. presented and develop EP based methodology for discovering the optimal placement of photo-voltaic arrays and wind turbine generators in a radial distribution network [51]. Considering the limitations on bus voltages, line loading, number of DRGs to be put and dispatched wind influence then active energy loss will be minimized. Various researchers [42, 44, 46, 48, and 49] actualized GA to maintain single objective, which decrease the total real power loses in the distribution system. , Borges et al. [35], Teng et al. [50], and Shaaban et al. [54] proposed a key DRG position system by executing GA [35, 50, 54]. The fitness assessment function that drives the GA to the solution is derived as an advantage/cost relation, where the advantage is measured from the deduction of electrical losses, and the expense is depending on installation and investment. Borges et al. also utilized GA to estimate the DRG impact on unwavering quality, misfortunes and voltage profile alongside DRG planning [35]. Besides, in 2012, Shaaban et al. [54] seriously thought about the instability and variability connected with the power output of renewable DRG and also the load variability.

GA has been utilized by numerous researchers to handle multi-objective (MO) in DRG situation [34, 37, 38, 47, 53]. In 2005, Celli et al. proposed a MO guideline for the placing and sizing of DRG material into existing distribution system, the methodology characteristics was accomplished by minimizing distinctive functions.

Carpinelli et al. [36] expanded more about the MO approach to incorporate uncertainties in DRG energy generation. [109] explains why every conceivable future is figured as a situation accordingly, a ”double trade off technique” is utilized. By utilizing MO e-constrained procedure in the first trade off, it permits DRG placement and sizing solution for every situations considered, for example, combination of various kind of wind speed in all the possible location; isolating the most robust solution is allowed in the second trade off. Along these lines, the operator is totally allowed to drive the optimization in a certain direction without losing objectivity and simplification [36]. In 2007 Haesenetal [39], Proposed a well explained MO planning technique for the coordination of stochastic generators in distribution systems. This methodology uses the Strength Pareto Evolutionary Algorithm (SPEA) calculation, an antecedent of the SPEA2 calculation [39]. It was revised to the SPEA2 calculation in 2009 by Rodriguez et al., reached out to incorporate the analysis of controllable DER units and upgraded to make note of qualities that reflect environmental effect and voltage quality [34]. Another MO programming methodology in view of Non dominated Sorting Genetic Algorithm (NSGA) was practiced by Ochoa etal.to locate the best configuration that increase the integration of distributed wind power generation while fulfilling voltage and thermal capacity [43]. Kumaretal [41] in 2010 presented the DRG integration approach with MO model was actualized for speedy restoration and to decrease the additional power demand during use of GA under cold load pick up .In 2011, Moeini Aghtaieetal. [52] Implemented NSGA to reduce the aggregate costs, total losses, and enhance framework unwavering quality in the distribution network.

Final paper

2.2.1 Fuzzy Logic

Masoum et al. (2004a) applied fuzzy logic for solving the discrete optimization problem of fixed shunt capacitor placement and sizing under harmonic conditions. Power and energy losses due to installed capacitors and the cost of fixed capacitors are used as the objective function. Kannan (2008) and Saranya (2011) developed fuzzy expert system to determine suitable candidate nodes for determining the optimal capacitor sizes in distribution systems. Bhattacharya et al. (2009) formulated new fuzzy membership functions to identify probable capacitor locations in radial distribution systems. A new algorithm for selecting capacitor nodes was presented, and simulated annealing technique was employed for final sizing of the capacitors.

Useful paper 2

...(download the rest of the essay above)

About this essay:

This essay was submitted to us by a student in order to help you with your studies.

If you use part of this page in your own work, you need to provide a citation, as follows:

Essay Sauce, THE EVOLUTIONARY PROGRAMMING TECHNIQUE. Available from:<https://www.essaysauce.com/computer-science-essays/the-evolutionary-programming-technique/> [Accessed 18-10-19].

Review this essay:

Please note that the above text is only a preview of this essay.

Name
Email
Review Title
Rating
Review Content

Latest reviews: