Economic Dispatch Using Genetic Algorithm Based Hybrid Approach

2006 ◽  
Author(s):  
Tahir Nadeem Malik ◽  
Aftab Ahmad ◽  
Shahab Khushnood
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Economic Dispatch ◽  
Hybrid Approach ◽  
Optimization Techniques ◽  
Characteristic Functions ◽  
Steam Turbines ◽  
Large Power ◽  
Hybrid Approaches ◽  
Power Economic

Power Economic Dispatch (ED) is vital and essential daily optimization procedure in the system operation. Present day large power generating units with multi-valves steam turbines exhibit a large variation in the input-output characteristic functions, thus non-convexity appears in the characteristic curves. Various mathematical and optimization techniques have been developed, applied to solve economic dispatch (ED) problem. Most of these are calculus-based optimization algorithms that are based on successive linearization and use the first and second order differentiations of objective function and its constraint equations as the search direction. They usually require heat input, power output characteristics of generators to be of monotonically increasing nature or of piecewise linearity. These simplifying assumptions result in an inaccurate dispatch. Genetic algorithms have used to solve the economic dispatch problem independently and in conjunction with other AI tools and mathematical programming approaches. Genetic algorithms have inherent ability to reach the global minimum region of search space in a short time, but then take longer time to converge the solution. GA based hybrid approaches get around this problem and produce encouraging results. This paper presents brief survey on hybrid approaches for economic dispatch, an architecture of extensible computational framework as common environment for conventional, genetic algorithm & hybrid approaches based solution for power economic dispatch, the implementation of three algorithms in the developed framework. The framework tested on standard test systems for its performance evaluation.

Comparison of Two Multiobjective Optimization Techniques With and Within Genetic Algorithms

1999 ◽  
Author(s):  
Shapour Azar ◽  
Brian J. Reynolds ◽  
Sanjay Narayanan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimization Technique ◽  
Optimization Techniques ◽  
Pareto Set ◽  
Design Solution ◽  
Multiple Objective ◽  
Multiple Objective Optimization ◽  
Continuous Variables ◽  
Optimal Set

Abstract Engineering decision making involving multiple competing objectives relies on choosing a design solution from an optimal set of solutions. This optimal set of solutions, referred to as the Pareto set, represents the tradeoffs that exist between the competing objectives for different design solutions. Generation of this Pareto set is the main focus of multiple objective optimization. There are many methods to solve this type of problem. Some of these methods generate solutions that cannot be applied to problems with a combination of discrete and continuous variables. Often such solutions are obtained by an optimization technique that can only guarantee local Pareto solutions or is applied to convex problems. The main focus of this paper is to demonstrate two methods of using genetic algorithms to overcome these problems. The first method uses a genetic algorithm with some external modifications to handle multiple objective optimization, while the second method operates within the genetic algorithm with some significant internal modifications. The fact that the first method operates with the genetic algorithm and the second method within the genetic algorithm is the main difference between these two techniques. Each method has its strengths and weaknesses, and it is the objective of this paper to compare and contrast the two methods quantitatively as well as qualitatively. Two multiobjective design optimization examples are used for the purpose of this comparison.

A Hybrid Approach for Shape Retrieval Using Genetic Algorithms and Approximate Distance

2021 ◽  
pp. 205-222
Author(s):  
Saliha Mezzoudj ◽  
Kamal Eddine Melkemi
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Hybrid Approach ◽  
Shape Context ◽  
Similar Shape ◽  
Complex Shapes ◽  
Ga Algorithm ◽  
Approximate Distance ◽  
Multi Agent ◽  
Part Structure

This article describes how the classical algorithm of shape context (SC) is still unable to capture the part structure of some complex shapes. To overcome this insufficiency, the authors propose a novel shape-based retrieval approach that is called HybMAS-GA using a multi-agent system (MAS) and a genetic algorithm (GA). They define a new distance called approximate distance (AD) to define a SC method by AD, which called approximate distance shape context (ADSC) descriptor. Furthermore, the authors' proposed HybMAS-GA is a star architecture where all shape context agents, N, are directly linked to a coordinator agent. Each retrieval agent must perform either a SC or an ADSC method to obtain a similar shape, started from its own initial configuration of sample points. This combination increases the efficiency of the proposed HybMAS-GA algorithm and ensures its convergence to an optimal images retrieval as it is shown through experimental results.

scholarly journals A novel pseudoderivative-based mutation operator for real-coded adaptive genetic algorithms

F1000Research ◽  
2013 ◽  
Vol 2 ◽  
pp. 139
Author(s):  
Maxinder S Kanwal ◽  
Avinash S Ramesh ◽  
Lauren A Huang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Mutation Rate ◽  
Optimal Solution ◽  
Global Optimum ◽  
Optimization Techniques ◽  
Adaptive Mutation ◽  
Local Optima ◽  
3 Dimensional ◽  
Successive Generations

Recent development of large databases, especially those in genetics and proteomics, is pushing the development of novel computational algorithms that implement rapid and accurate search strategies. One successful approach has been to use artificial intelligence and methods, including pattern recognition (e.g. neural networks) and optimization techniques (e.g. genetic algorithms). The focus of this paper is on optimizing the design of genetic algorithms by using an adaptive mutation rate that is derived from comparing the fitness values of successive generations. We propose a novel pseudoderivative-based mutation rate operator designed to allow a genetic algorithm to escape local optima and successfully continue to the global optimum. Once proven successful, this algorithm can be implemented to solve real problems in neurology and bioinformatics. As a first step towards this goal, we tested our algorithm on two 3-dimensional surfaces with multiple local optima, but only one global optimum, as well as on the N-queens problem, an applied problem in which the function that maps the curve is implicit. For all tests, the adaptive mutation rate allowed the genetic algorithm to find the global optimal solution, performing significantly better than other search methods, including genetic algorithms that implement fixed mutation rates.

scholarly journals Implementation of Genetic Algorithms and Momentum Backpropagation in Classification of Subtype Cells Acute Myeloid Leukimia

2020 ◽  
Vol 14 (2) ◽  
pp. 189
Author(s):  
Dian Mustikaningrum ◽  
Retantyo Wardoyo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
White Blood Cells ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Learning Rate ◽  
Algorithm Optimization ◽  
Selection Parameter ◽  
Acute Myeloid ◽  
Random Trial

 Acute Myeloid Leukimia (AML) is a type of cancer which attacks white blood cells from myeloid. AML subtypes M1, M2, and M3 are affected by the same type of cells called myeloblasts, so it needs more detailed analysis to classify.Momentum Backpropagation  is used to classified. In its application, optimal selection of architecture, learning rate, and momentum is still done by random trial. This is one of the disadvantage of Momentum Backpropagation. This study uses a genetic algorithm (GA) as an optimization method to get the best architecture, learning rate, and momentum of artificial neural network. Genetic algorithms are one of the optimization techniques that emulate the process of biological evolution.The dataset used in this study is numerical feature data resulting from the segmentation of white blood cell images taken from previous studies which has been done by Nurcahya Pradana Taufik Prakisya. Based on these data, an evaluation of the Momentum Backpropagation process was conducted the selection parameter in a random trial with the genetic algorithm. Furthermore, the comparison of accuracy values was carried out as an alternative to the ANN learning method that was able to provide more accurate values with the data used in this study.The results showed that training and testing with genetic algorithm optimization of ANN parameters resulted in an average memorization accuracy of 83.38% and validation accuracy of 94.3%. Whereas in other ways, training and testing with momentum backpropagation random trial resulted in an average memorization accuracy of 76.09% and validation accuracy of 88.22%.

Hybrid Approach to Tomographic Reconstruction of Bubbles in Two-Phase Flows Using Algebraic Reconstruction Technique (ART), Genetic Algorithms (GA) and Simplex Method

1999 ◽  
Author(s):  
A. Rajesh ◽  
K. D. Kihm ◽  
L. Yang ◽  
J. Yen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Simplex Method ◽  
Tomographic Reconstruction ◽  
Hybrid Approach ◽  
Computational Cost ◽  
Reconstruction Technique ◽  
Algebraic Reconstruction Technique ◽  
Two Phase ◽  
Algebraic Reconstruction

Abstract Main hurdles in the application of genetic algorithms to complex problems are two fold. One is the high computational cost due to their slow convergence rate. The other is to reduce the number of input parameters of a conventional genetic algorithm as in the case of tomographic reconstruction of bubbles. In our present work great strides have been made to alleviate both the problems by using a Hybrid model of Algebraic Reconstruction Technique (ART), Simplex Method and Genetic Algorithm (GA). Our results showed that the hybrid approach is an effective and robust optimization image reconstruction technique.

OntoQuery-An Evolutionary Approach for Query Formation and Information Retrieval

2011 ◽  
pp. 140-160
Author(s):  
Sheng-Uei Guan ◽  
Chang Ching Chng ◽  
Fangming Zhu
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Information Retrieval ◽  
Query Optimization ◽  
Formation Process ◽  
Relevance Feedback ◽  
Fitness Function ◽  
Optimization Techniques ◽  
Retrieval Scheme

This chapter proposes the establishment of OntoQuery in an m-commerce agent framework. OntoQuery represents a new query formation approach that combines the usage of ontology and keywords. This approach takes advantage of the tree pathway structure in ontology to form queries visually and efficiently. Also, it uses keywords to complete the query formation process more efficiently. Present query optimization techniques like relevance feedback use expensive iterations. The proposed information retrieval scheme focuses on using genetic algorithms to improve computational effectiveness. Mutations are done on queries formed in the earlier part by replacing terms with synonyms. Query optimization techniques used include query restructuring by logical terms and numerical constraints replacement. Also, the fitness function of the genetic algorithm is defined by three elements, number of documents retrieved, quality of documents, and correlation of queries. The number and quality of documents retrieved give the basic strength of a mutated query.

scholarly journals Optimization of Application of Genetic Algorithm Using C4.5 Method to Predict Breast Cancer Disease

bit-Tech ◽  
2019 ◽  
Vol 2 (1) ◽  
pp. 1-10
Author(s):  
Hartana Wijaya
Keyword(s):  
Breast Cancer ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimization Techniques ◽  
The Body ◽  
Algorithm Optimization ◽  
Genetic Algorithm Optimization ◽  
C4.5 Algorithm ◽  
Parameter Values ◽  
Risk Of Cancer

Cancer is a big challenge for humanity. Cancer can affect various parts of the body. This deadly disease can be found in humans of all ages. However, the risk of cancer increases with age. Breast cancer is the most common cancer among women, and is the biggest cause of death for women. Then there are problems in the detection of breast cancer, causing patients to experience unnecessary treatment and huge costs. In a similar study, there were several methods used but there were problems due to the shape of nonlinear cancer cells. The C4.5 method can solve this problem, but C4.5 is weak in terms of determining parameter values, so it needs to be optimized. Genetic Algorithm is one of the good optimization methods, therefore the parameter values ​​of C4.5 will be optimized using Genetic Algorithms to get the best parameter values. The results of this study are that C4.5 Algorithm based on genetic algorithm optimization has a higher accuracy value (96%) than only using the C4.5 algorithm (94.99%) and which is optimized with the PSO algorithm (95.71%). This is evident from the increase in the value of accuracy of 1.01% for the C4.5 algorithm model that has been optimized with genetic algorithms. So it can be concluded that the application of genetic algorithm optimization techniques can increase the value of accuracy in the C4.5 algorithm.

Sign in / Sign up

Export Citation Format

Share Document