Transactions on Ecology and the Environment vol 19, 1998 WIT Press, ISSN
|
|
- Christina Ross
- 5 years ago
- Views:
Transcription
1 Calibration of water distribution network models using genetic algorithms G. Walters, D. Savic, M. Morley, W. de Schaetzen & R. Atkinson Centre for Water Studies, School of Engineering & Computer Science, University of Exeter, Exeter, UK, EX4 4 QF Abstract Calibration of computer models for network analysis is a regular component of the model building process. Re-calibration of existing models is also necessary periodically, to reflect physical changes in the network. The process generally first involves a series of field tests during which pressures and flows are recorded at strategic locations in the system, usually continuously over one or more days. This is followed by a desk exercise during which adjustments are made to the roughness values used in modelling the system until a satisfactory match is obtained between modelled and observed values. If no satisfactory match is obtainable, further site checks are usually made to identify discrepancies between the model and the real system, such as incorrectly modelled valve settings and unrecorded connections. The selection of a satisfactory set of roughness values can be a tedious and timeconsuming business when undertaken by the traditional trial and error approach. The authors show in this paper that the process can be largely automated using an optimisation approach that is well suited to the problem. The method adopted is a variation of the Genetic Algorithm, which is closely coupled with a network solver for maximum efficiency. Experience in using the automatic calibration software is presented using a case study from the UK.
2 132 Hydraulic Engineering Software 1 Introduction For most applications, hydraulic models of water distribution networks must be calibrated so that the predictions they generate may be interpreted with confidence. Model calibration essentially comprises adjusting pipe roughnesses until pressure and flow values predicted by the model are consistent with field measurements. There are vast numbers of potential combinations of pipe roughness values that could be considered in reaching a good calibration Hence there is scope for achieving a calibration much more efficiently and consistently using a computer based numerical optimization technique rather than the traditional trial and error adjustment adopted by most network modelers. At Exeter University, Genetic Algorithm (GA) optimization has been developed for use in a number of different water supply and distribution problems (Savic & Walters', Halhal et al*, Savic & Walters^). In collaboration with Optimal Solutions and Structural Technologies Ltd., Object Oriented GA software has been integrated with the commercial HARP network solver, using STRUMAP as the user interface. This has produced a package called GANET, which is proving a very effective tool for planning the optimal strengthening, rehabilitation and operation of distribution networks (de Schaetzen et al*). GANET has now been enhanced to handle the calibration of network models. In applying GA technology to the model calibration, the objective is to find the solution that has the minimum overall difference between field and model values of flow and pressure. This is achieved by performing a large number of runs of the network model using trial values of pipe roughnesses, which are adjusted throughout the process using the principles of natural evolution. The basics of the GA process are described in the following section. 2 Genetic Algorithms - Overview 2.1 General Evolution Programs, of which the GA is the best-known type, are general artificial evolution search methods based on natural selection and mechanisms of population genetics. They emulate nature's very effective optimization techniques of evolution, which are based on preferential survival and reproduction of thefittestmembers of the population, the maintenance of a population with diverse members, the inheritance of
3 Hydraulic Engineering Software 133 genetic information from parents, and the occasional mutation of genes. These algorithms are best suited to solving combinatorial optimization problems that cannot be solved using more conventional operational research methods. Thus, they can be applied to large, complex problems that are non-linear with multiple local optima. The GA is an algorithmic model of Darwinian evolution that begins with the creation of a set of solutions referred to as a population of individuals. Each individual in a population consists of a set of parameter values that completely describe a solution The computer encoding of candidate solutions takes the form of so-called chromosomes, which are sets of strings of data analogous to the DNA in living things. The probability that the GA will select a chromosome from the original population to produce offspring for the new generation is dependent on its fitness value (a measure of how well a chromosome optimizes the objective function). The preference for more fit solutions produces a selective pressure, which, when applied through many generations, results in an overall trend towards greater fitness in the population of solutions. The fitness is computed by simply decoding the strings of the chromosome into parameter values and substituting them into the objective fiuiction. Then, based on their fitness values, individuals are selected from the population and recombined, producing offspring that will make up the next generation. The term crossover typically denotes the recombination process because of the way that genetic material crosses over from one chromosome to another. Sincefitindividuals have a higher probability of producing offspring than less fit ones, the new generation will have on average a higherfitnessthan the old population. A further mechanism called mutation also plays a role in the reproduction phase, although, contrary to popular belief, it is not the dominant role in the process of evolution. In GA each bit (or gene) is allowed a small probability to randomly mutate. If the probability of mutation is set too high, the GA degenerates into a random search process. This type of performance is undesirable, as a properly tuned GA is not a random search for a solution to a problem. For the simulation of a genetic process a GA uses stochastic mechanisms, but the result is distinctly better than random search.
4 134 Hydraulic Engineering Software 2.2 Benefits of GAs The benefits of GAs stem from their ability to converge rapidly on an optimal or near-optimal solution, having analyzed only a tiny fraction of the number of possible solutions available. For large problems such as those typically associated with networks, the exhaustive analysis of all options is unlikely ever to be feasible. In a network expansion and reinforcement problem recently analyzed by Optimal Solutions using GA, there were 721 pipe links each of which could adopt any of 15 diameters (including 'no pipe'). This presents a problem size of 15 or 9.16 x 10*". Even if one billion design evaluations (i.e. network simulation runs) could be performed in a second, the time needed to evaluate all possible schemes would be much greater than the age of the earth (estimated at 4.6 billion years). The GA optimization search was able to converge on the lowest cost solutions by carrying out several hundred thousand evaluations only. 2.3 Limitations GA optimization is a very powerful approach with a proven ability to identify near-optimal solutions. However the correct operation of a GA optimization depends on careful setting up and parameter tuning, requiring appropriate skills and experience. Inappropriate penalty levels will distort the results away from the end user's perception of 'optimum', and too high or low a rate of genetic exchange ('crossover' or 'mutation') result in degeneration to a random search, or failure to converge on the global optimum, respectively. Because of the complexity involved in setting up a GA to operate effectively, this form of optimization is not well suited to 'trivial' problems, i.e. those for which the number of possible solutions is small 3 Application of GA to model calibration To apply GA to the network calibration problem, the decision variables are generally defined to be the roughness values for each pipe in the system. These can be expressed as the "k" value in the Colebrook-White formulation, or as the Hazen-Williams "C" coefficients. All pipes can have individually variable roughness values, or groups of pipes can be pre-selected to have a common variable roughness, the selection being based on diameter, age, material, location or a combination of these factors. Variables other than pipe roughness could, in principle, be used in the calibration, although this is not common practice. For instance,
5 Hydraulic Engineering Software 135 neither demands nor pipe diameters may be known precisely, and hence it could be justifiable to allow them to vary to some extent to achieve a good modeling fit. Each potential solution consists of a set of pipe roughness values, and must be evaluated to obtain itsfitness.calculation of the fitness requires the network model to be run using the set of assumed roughnesses, to obtain the simulated heads and flows. Several snapshot simulations are used, generally at maximum and minimum demand times, and at an average time during a typical 24-hour cycle. At each measurement point and for each snapshot, the difference between simulated and observed data (head and/or flow) is calculated, and an overall error value for the whole network is calculated. Several different forms of error function can be used, but normally a root mean square formulation is adopted. Different weightings between head and flow measurements can also be incorporated into the error expression. As this simulation is performed, many thousands of times during the evolution of the best calibration, it is important that the GA and the analysis modules are fully integrated. Usually, there are anomalies in the data or in the basic model representing the physical network, which need resolution. Initial data inspection and model analysis, followed by several preliminary runs of the GA are generally required to eliminate misleading data originating from faulty loggers and to correct model features such as wrongly closed valves. Without these corrections an accurate calibration would be impossible. 4 Example 4.1 The Saltash Model The software was used by Optimal Solutions to calibrate an existing model of the Saltash water distribution system for South West Water, Saltash being located in the South West of the United Kingdom. There are 1043 pipes in the model, with pressures logged at 92 points and flows logged at 15 points over a two day period. The model calibration exercise used an objective function which calculated the root mean square of the absolute errors of all flow and pressure measurements at three snapshot times during a 24 hour period There were some obvious anomalies in the field data provided, due to apparent logger failures, identified either by head readings constant over the 24 hour period, or by heads which were lower than the elevation of
6 136 Hydraulic Engineering Software the corresponding monitoring site. Evidence of obvious anomalies led to the exclusion of 19 of the 92 original pressure data sets. The Colebrook-White "k" values for pipe roughnesses were used as variables. To ensure that the GA solution contained pipe roughnesses that generally lay within a credible range, a maximum value of 30mm was set. In some locations where initial results suggested a system anomaly (for example, a partially closed valve) this value was exceeded by manual adjustment to simulate the apparent extra resistance. 4,2 Initial Model Analysis To identify any further problems with the data and structure of the model prior to the optimization, an initial solution was obtained by running the model with default roughness values of 0.3 mm for all significant pipes. In most circumstances, a substantial head error at the 'minimum hour' condition would indicate a data anomaly. In theory, the flows should be very low at minimum hour with correspondingly low head losses. Hence monitored and modeled heads should correspond approximately, unless incorrect elevation data has been used. Several pressure sets were thereby identified as suspect and removed from the calibration data as a result. 4.3 Preliminary GA Solution A preliminary optimization was performed using the GA, with the purpose of highlighting any remaining problems. As a result of the initial analysis and the preliminary GA runs, nine data sets were excluded for various reasons including suspected wrong elevations, suspected wrong Table 1: Summary of Pipe Roughness Values for Optimum Solution g 350 f 300 % 250 H \ 0 ]0.1;5] ]5;10] ]10;20J ]20;30J k»100 'k' values Interval (mm)
7 Hydraulic Engineering Software 137 location relative to a Pressure Relief Valve, inconsistency between adjacent loggers and suspect demand allocations 4.4 Best GA Solution Once these anomalies had been resolved, a series of runs were performed using the GA to obtain a range of solutions. The resulting *k' values as determined by the best GA solution are summarized in Table 1. Of particular interest was the high friction needed in a particular run of pipes, suggesting the possible presence of a partially closed valve on a highly strategic link. Consistently high k values were obtained for these particular pipes in all GA optimization runs. Table 2 summarizes the head errors for the maximum hour snapshot, this being generally the worst of the three snapshot times. It can be seen that most results lie within 1m of the monitored pressure, with a small number of discrepancies remaining. Table 2: Summary of Head Errors at Maximum Hour (m) I.*J n - r-i n [0;0.2] ]0.2;0.4] ]0.4; 0.6] ]0.6; 0.8] ]0.8;1.0] ]1.0; 1.5] ]1.5;2.0[ error interval [m] Table 3 summarizes the flow results. These are presented as absolute error values (in 1/s), together with the computed flows at each point to give an indication of the relative scale of each error. The flow errors are generally small, particularly at the largest flow points, suggesting that the strategic representation of the calibrated model is good
8 138 Hydraulic Engineering Software Node Absolute Flow Error and Computed Flow [1/s] hours 08:00 hours \l 5:00 hours Error Flow Error Flow Error Flow Table 3: Summary of 'Best GA Solution' Results - Flows. 24 hours total head variations " observed profile calculated profile 96 Time [h] Figure 1: Example of a typical 24 hours simulation comparison.
9 Hydraulic Engineering Software 139 The overall quality of a simulation model may also be judged by comparing the continuous field data profile with the model predictions over a 24-hour period. This comparison was carried out at regular stages during the calibration process and demonstrated that a good profile match was consistently achieved where the error at all three optimization snapshots was small. This confirms that the use of only three well defined loading conditions (which represent the minimum, maximum and average water demand) in the optimization is sufficiently robust to obtain a good match for the whole simulation period. An example of a chart comparing field and model profiles is presented in Figure Suspected Anomalies identified during calibration During the course of the calibration, interim solutions were assessed manually at various stages by analyzing the cause of errors between field and predicted values. Initial attention focused on flow errors to ensure that these were reasonable, resulting in the identification of an incorrectly specified reservoir level: a bottom water level at 102m had been used instead of 100.2m giving rise to large inconsistencies in flow Pressure errors in excess of 1m post calibration were then examined, with the particular objective of identifying apparently anomalous circumstances which could bias the solution by forcing the GA to improve inappropriate matches at the possible expense of legitimate ones. Several probable anomalies were identified where it was reasonable to make changes, either to the model or to the field data, to effect an improvement in the results. These included the following: Increased friction factors (from the maximum limit of 20mm to 100mm) in two pipes to simulate a probable significant hydraulic resistance, perhaps a partially closed valve, on a strategic link; Correction of two suspected incorrect elevations where minimum pressure errors and inconsistencies with nearby adjacent measurement points were apparent Correction of two pressure data sets where there was an apparent one-hour lag in the field data compared to other data points and model predictions. 4.6 Discussion of Results The calibration has produced a good model of the system, although a few discrepancies remain as yet unresolved. When originally received the model contained 9 "artificial" throttle valves, apparently inserted by the original model builders in an attempt to manually calibrate the system.
10 140 Hydraulic Engineering Software The final GA calibrated version removed the necessity for their inclusion, except for the one pipe run mentioned, in which some real pipe throttling is suspected. The distribution of pipe roughness values in Table 1, giving a preponderance of high and low values, may be indicative of some distortion in the calibration caused, for example, by inaccurate demand allocations or pipe diameters. 5 Discussion and Conclusions The GA approach to model calibration is in its infancy, but has already demonstrated its ability to assist the modeler in the task of deriving a good network model. As well as removing most of the routine and tedious aspects of the job, it will generally achieve better fits to the available data than can be achieved manually, and, very importantly, will adopt a consistent and unbiased approach which is more likely to highlight real inconsistencies and problems. However, the input of experienced modeling staff is still required to validate data and interpret results within an essentially iterative process. 6 Acknowledgments This work is partially supported by Teaching Company Programme 2286 between Exeter University and Ewan Associates Ltd. The cooperation of South West Water and Optimal Solutions is gratefully acknowledged. 7 References 1 Savic, DA and Walters, G A Genetic Algorithms for Least-Cost Design of Water Distribution Networks, ASCE Journal of Water Resources Planning and Management, 123 (2), pp , Halhal, D., Walters, G.A., Ouazar, D. and Savic, D.A. Water Network Rehabilitation with a Structured Messy Genetic Algorithm, ASCE J. Water Resources Planning and Man., 123 (3), pp , Savic, D.A. and Walters, G A Evolving Sustainable Water Networks, Hydrological Sciences J., 42 (4), pp , de Schaetzen, W., Randall-Smith, M.J., Savic, D and Walters, G. A. A Genetic Algorithm Approach for Rehabilitation in Water Supply Systems, Proceedings Int. Conference on Rehabilitation Technology for the Water industry, Lille, March 1998.
Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
More informationOPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING
2008/4 PAGES 1 7 RECEIVED 18. 5. 2008 ACCEPTED 4. 11. 2008 M. ČISTÝ, Z. BAJTEK OPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING ABSTRACT
More informationInteractive 3D Visualization Of Optimization For Water Distribution Systems
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Interactive 3D Visualization Of Optimization For Water Distribution Systems Matthew Barrie Johns
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationIntroduction to Evolutionary Computation
Introduction to Evolutionary Computation The Brought to you by (insert your name) The EvoNet Training Committee Some of the Slides for this lecture were taken from the Found at: www.cs.uh.edu/~ceick/ai/ec.ppt
More informationACCEPTED VERSION.
ACCEPTED VERSION Vitkovsky, John; Simpson, Angus Ross; Lambert, Martin Francis Leak detection and calibration using transients and genetic algorithms Journal of Water Resources Planning & Management, 2000;
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationThe k-means Algorithm and Genetic Algorithm
The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective
More informationReducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm
Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm Dr. Ian D. Wilson School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK Dr. J. Mark Ware School of Computing,
More informationEvolving SQL Queries for Data Mining
Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper
More informationCOUPLING TRNSYS AND MATLAB FOR GENETIC ALGORITHM OPTIMIZATION IN SUSTAINABLE BUILDING DESIGN
COUPLING TRNSYS AND MATLAB FOR GENETIC ALGORITHM OPTIMIZATION IN SUSTAINABLE BUILDING DESIGN Marcus Jones Vienna University of Technology, Vienna, Austria ABSTRACT Incorporating energy efficient features
More informationSuppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?
Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate
More informationSolving Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing
Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing Fan Yang May 18, 2010 Abstract The traveling salesman problem (TSP) is to find a tour of a given number of cities
More informationAlgorithm Design (4) Metaheuristics
Algorithm Design (4) Metaheuristics Takashi Chikayama School of Engineering The University of Tokyo Formalization of Constraint Optimization Minimize (or maximize) the objective function f(x 0,, x n )
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationAccepted version American Society of Civil Engineers
Accepted version Bryan A. Tolson, Holger R. Maier, Angus R. Simpson and Barbara J. Lence Genetic algorithms for reliability-based optimization of water distribution systems Journal of Water Resources Planning
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationAero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li
International Conference on Applied Science and Engineering Innovation (ASEI 215) Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm Yinling Wang, Huacong Li School of Power and
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationDesign of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm
Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm UMIT ATILA 1, ISMAIL RAKIP KARAS 2, CEVDET GOLOGLU 3, BEYZA YAMAN 2, ILHAMI MUHARREM ORAK 2 1 Directorate of Computer
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationThe Parallel Software Design Process. Parallel Software Design
Parallel Software Design The Parallel Software Design Process Deborah Stacey, Chair Dept. of Comp. & Info Sci., University of Guelph dastacey@uoguelph.ca Why Parallel? Why NOT Parallel? Why Talk about
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationEvolutionary Computation Part 2
Evolutionary Computation Part 2 CS454, Autumn 2017 Shin Yoo (with some slides borrowed from Seongmin Lee @ COINSE) Crossover Operators Offsprings inherit genes from their parents, but not in identical
More informationCS5401 FS2015 Exam 1 Key
CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationGenetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland
Genetic Programming Charles Chilaka Department of Computational Science Memorial University of Newfoundland Class Project for Bio 4241 March 27, 2014 Charles Chilaka (MUN) Genetic algorithms and programming
More informationCHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION
CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION 5.1 INTRODUCTION Generally, deployment of Wireless Sensor Network (WSN) is based on a many
More informationCHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN
97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible
More informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
More informationInternational Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -
TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationEvolutionary form design: the application of genetic algorithmic techniques to computer-aided product design
Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's
More informationAdvanced Search Genetic algorithm
Advanced Search Genetic algorithm Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Jerry Zhu, Andrew Moore http://www.cs.cmu.edu/~awm/tutorials
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationIntelligent Risk Identification and Analysis in IT Network Systems
Intelligent Risk Identification and Analysis in IT Network Systems Masoud Mohammadian University of Canberra, Faculty of Information Sciences and Engineering, Canberra, ACT 2616, Australia masoud.mohammadian@canberra.edu.au
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationentire search space constituting coefficient sets. The brute force approach performs three passes through the search space, with each run the se
Evolving Simulation Modeling: Calibrating SLEUTH Using a Genetic Algorithm M. D. Clarke-Lauer 1 and Keith. C. Clarke 2 1 California State University, Sacramento, 625 Woodside Sierra #2, Sacramento, CA,
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationGenetic Algorithm (GA)
Genetic Algorithm (GA) A QSAR model development tool NANOBRIDGES -A Collaborative Project The authors are grateful for the financial support from the European Commission through the Marie Curie IRSES program,
More informationOptimization of Association Rule Mining through Genetic Algorithm
Optimization of Association Rule Mining through Genetic Algorithm RUPALI HALDULAKAR School of Information Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya Bhopal, Madhya Pradesh India Prof. JITENDRA
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationIntroduction to Genetic Algorithms. Genetic Algorithms
Introduction to Genetic Algorithms Genetic Algorithms We ve covered enough material that we can write programs that use genetic algorithms! More advanced example of using arrays Could be better written
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationV.Petridis, S. Kazarlis and A. Papaikonomou
Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of
More information[Saminu, 2(12): December, 2013] ISSN: Impact Factor: 1.852
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Modifications of Optinet work Software for the Implementation of Advance Genetic Algorithm on Existing Water Distribution Network
More informationGenetic Placement: Genie Algorithm Way Sern Shong ECE556 Final Project Fall 2004
Genetic Placement: Genie Algorithm Way Sern Shong ECE556 Final Project Fall 2004 Introduction Overview One of the principle problems in VLSI chip design is the layout problem. The layout problem is complex
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree Rahul Mathur M.Tech (Purs.) BU, AJMER IMRAN KHAN Assistant Professor AIT, Ajmer VIKAS CHOUDHARY Assistant Professor AIT, Ajmer ABSTRACT:-Many
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationPath Planning Optimization Using Genetic Algorithm A Literature Review
International Journal of Computational Engineering Research Vol, 03 Issue, 4 Path Planning Optimization Using Genetic Algorithm A Literature Review 1, Er. Waghoo Parvez, 2, Er. Sonal Dhar 1, (Department
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationApplying genetic algorithm on power system stabilizer for stabilization of power system
Applying genetic algorithm on power system stabilizer for stabilization of power system 1,3 Arnawan Hasibuan and 2,3 Syafrudin 1 Engineering Department of Malikussaleh University, Lhokseumawe, Indonesia;
More informationLiterature Review On Implementing Binary Knapsack problem
Literature Review On Implementing Binary Knapsack problem Ms. Niyati Raj, Prof. Jahnavi Vitthalpura PG student Department of Information Technology, L.D. College of Engineering, Ahmedabad, India Assistant
More informationAN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationExploration vs. Exploitation in Differential Evolution
Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient
More informationStructural Optimizations of a 12/8 Switched Reluctance Motor using a Genetic Algorithm
International Journal of Sustainable Transportation Technology Vol. 1, No. 1, April 2018, 30-34 30 Structural Optimizations of a 12/8 Switched Reluctance using a Genetic Algorithm Umar Sholahuddin 1*,
More informationSMART WELL MODELLING. Design, Scenarios and Optimisation
Page 1 Introduction Smart or complex wells are in increasing use by operators as reservoir environments become more challenging. The wells include a number of smart devices installed to achieve a variety
More informationOutline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search
Outline Genetic Algorithm Motivation Genetic algorithms An illustrative example Hypothesis space search Motivation Evolution is known to be a successful, robust method for adaptation within biological
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 OPTIMIZATION OF MACHINING PROCESS AND MACHINING ECONOMICS In a manufacturing industry, machining process is to shape the metal parts by removing unwanted material. During the
More informationSparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach
1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationGenetic Algorithm Based Template Optimization for a Vision System: Obstacle Detection
ISTET'09 Umair Ali Khan, Alireza Fasih, Kyandoghere Kyamakya, Jean Chamberlain Chedjou Transportation Informatics Group, Alpen Adria University, Klagenfurt, Austria. Genetic Algorithm Based Template Optimization
More informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationAn Introduction to Evolutionary Algorithms
An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
More informationEvolutionary Algorithms. CS Evolutionary Algorithms 1
Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance
More informationHybrid Genetic Algorithms for Multi-objective Optimisation of Water Distribution Networks
Hybrid Genetic Algorithms for Multi-objective Optimisation of Water Distribution Networks Edward Keedwell and Soon-Thiam Khu Centre for Water Systems, School of Engineering and Computer Science and Mathematics,
More informationImage Processing algorithm for matching horizons across faults in seismic data
Image Processing algorithm for matching horizons across faults in seismic data Melanie Aurnhammer and Klaus Tönnies Computer Vision Group, Otto-von-Guericke University, Postfach 410, 39016 Magdeburg, Germany
More informationHeuristic Optimisation
Heuristic Optimisation Revision Lecture Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation University
More informationNeural Network Weight Selection Using Genetic Algorithms
Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationArtificial Neural Network based Curve Prediction
Artificial Neural Network based Curve Prediction LECTURE COURSE: AUSGEWÄHLTE OPTIMIERUNGSVERFAHREN FÜR INGENIEURE SUPERVISOR: PROF. CHRISTIAN HAFNER STUDENTS: ANTHONY HSIAO, MICHAEL BOESCH Abstract We
More informationA Multi-Model Approach to Analysis of Environmental Phenomena
A Multi-Model Approach to Analysis of Environmental Phenomena O. Giustolisi a, A. Doglioni a, D.A. Savic b and B.W. Webb c a Civil and Environmental Engineering Department, Engineering Faculty of Taranto,
More informationMultiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover
Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover J. Garen 1 1. Department of Economics, University of Osnabrück, Katharinenstraße 3,
More informationA Genetic Programming Approach for Distributed Queries
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 1997 Proceedings Americas Conference on Information Systems (AMCIS) 8-15-1997 A Genetic Programming Approach for Distributed Queries
More informationPreprocessing of Stream Data using Attribute Selection based on Survival of the Fittest
Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological
More informationA Genetic Based Fault Location Algorithm for Transmission Lines
A Genetic Based Fault Location Algorithm for Transmission Lines K. M. EL-Naggar Assistant Professor, College of Technological Studies, Kuwait Summary Overhead transmission lines are parts of the electric
More informationPipe Diameter Optimization using Genetic Algorithm- A Case Study
ENGINEER - Vol. XXXXI, 04, pp. 32-39, 8 The Institution of Engineers, Sri Lanka Diameter Optimization using Genetic Algorithm- A Case Study M.P.P.Dhanaseela and T.Tingsanchali Abstract: A systematic study
More informationACCEPTED VERSION.
ACCEPTED VERSION Wu, Zheng Y.; Simpson, Angus Ross Competent genetic-evolutionary optimization of water distribution systems Journal of Computing in Civil Engineering, 2001; 15(2):89-101 2001 American
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationA Comparison of the Iterative Fourier Transform Method and. Evolutionary Algorithms for the Design of Diffractive Optical.
A Comparison of the Iterative Fourier Transform Method and Evolutionary Algorithms for the Design of Diffractive Optical Elements Philip Birch, Rupert Young, Maria Farsari, David Budgett, John Richardson,
More informationLocal Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat:
Local Search Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat: Select a variable to change Select a new value for that variable Until a satisfying assignment is
More informationTolerance Synthesis by Constraint Propagation
Tolerance Synthesis by Constraint Propagation Christopher C. Yang and Jason Wong Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Abstract Optimizing the
More informationAutomatic Generation of Test Case based on GATS Algorithm *
Automatic Generation of Test Case based on GATS Algorithm * Xiajiong Shen and Qian Wang Institute of Data and Knowledge Engineering Henan University Kaifeng, Henan Province 475001, China shenxj@henu.edu.cn
More informationRole of Genetic Algorithm in Routing for Large Network
Role of Genetic Algorithm in Routing for Large Network *Mr. Kuldeep Kumar, Computer Programmer, Krishi Vigyan Kendra, CCS Haryana Agriculture University, Hisar. Haryana, India verma1.kuldeep@gmail.com
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More informationA GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS
A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS BERNA DENGIZ AND FULYA ALTIPARMAK Department of Industrial Engineering Gazi University, Ankara, TURKEY 06570 ALICE E.
More informationMutations for Permutations
Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More information