MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS
|
|
- Jasper Oliver
- 6 years ago
- Views:
Transcription
1 1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy, disconinuiy and non-convex region. The search space (design space) may be so large ha global opimum canno be found in a reasonable ime. The exising linear or nonlinear mehods may no be efficien or compuaionally inexpensive for solving such problems. Various sochasic search mehods like simulaed annealing, evoluionary algorihms (EA) or hill climbing can be used in such siuaions. EAs have he advanage of being applicable o any combinaion of complexiies (muli-objecive, non-lineariy ec) and also can be combined wih any exising local search or oher mehods. Various echniques which make use of EA approach are Geneic Algorihms (GA), evoluionary programming, evoluion sraegy, learning classifier sysem ec. All hese EA echniques operae mainly on a populaion search basis. In his lecure Geneic Algorihms, he mos popular EA echnique, is explained. CONCEPT EAs sar from a populaion of possible soluions (called individuals) and move owards he opimal one by applying he principle of Darwinian evoluion heory i.e., survival of he fies. Objecs forming possible soluion ses o he original problem is called phenoype and he encoding (represenaion) of he individuals in he EA is called genoype. The mapping of phenoype o genoype differs in each EA echnique. In GA which is he mos popular EA, he variables are represened as srings of numbers (normally binary). If each design variable is given a sring of lengh l, and here are n such variables, hen he design vecor will have a oal sring lengh of nl. For example, le here are 3 design variables and he sring lengh be 4 for each variable. The variables are x, x 7and 1. Then he chromosome lengh is 12 as shown in he figure x 1 x 2 x x3 An individual consiss a genoype and a finess funcion. Finess represens he qualiy of he soluion (normally called finess funcion). I forms he basis for selecing he individuals and hereby faciliaes improvemens.
2 2 The pseudo code for a simple EA is given below i = 0 Iniialize populaion P 0 Evaluae iniial populaion while (! erminaion condiion) { i = i+1 Perform compeiive selecion Creae populaion P i from P i-1 by recombinaion and muaion } Evaluae populaion P i A flow char indicaing he seps of a simple geneic algorihm is shown in figure 1.
3 3 Sar Generae Iniial Populaion Encode Generaed Populaion Evaluae Finess Funcions R E G E N E R A T I O N Mees Opimizaion Crieria? No Selecion (selec parens) Crossover (seleced parens) Yes Bes Individuals Sop Muaion (muae offsprings) Fig. 1 The iniial populaion is usually generaed randomly in all EAs. The erminaion condiion may be a desired finess funcion, maximum number of generaions ec. In selecion, individuals wih beer finess funcions from generaion i' are aken o generae individuals of i+1 h generaion. New populaion (offspring) is creaed by applying recombinaion and muaion o he seleced individuals (parens). Recombinaion creaes one or wo new individuals by swaping (crossing over) he genome of a paren wih anoher. Recombined individual is hen muaed by changing a single elemen (genome) o creae a new individual.
4 4 Finally, he new populaion is evaluaed and he process is repeaed. Each sep is described in more deail below. PARENT SELECTION Afer finess funcion evaluaion, individuals are disinguished based on heir qualiy. According o Darwin's evoluion heory he bes ones should survive and creae new offspring for he nex generaion. There are many mehods o selec he bes chromosomes, for example roulee wheel selecion, Bolzmann selecion, ournamen selecion, rank selecion, seady sae selecion and ohers. Two of hese are briefly described, namely, roulee wheel selecion and rank selecion: Roulee Wheel Selecion: Parens are seleced according o heir finess i.e., each individual is seleced wih a probabiliy proporional o is finess value. In oher words, depending on he percenage conribuion o he oal populaion finess, sring is seleced for maing o form he nex generaion. This way, weak soluions are eliminaed and srong soluions survive o form he nex generaion. For example, consider a populaion conaining four srings shown in he Table 1. Each sring is formed by concaenaing four subsrings which represens variables a,b,c and d. Lengh of each sring is aken as four bis. The firs column represens he possible soluion in binary form. The second column gives he finess values of he decoded srings. The hird column gives he percenage conribuion of each sring o he oal finess of he populaion. Then by "Roulee Wheel" mehod, he probabiliy of candidae 1 being seleced as a paren of he nex generaion is 28.09%. Similarly, he probabiliy ha he candidaes 2, 3, 4 will be chosen for he nex generaion are 19.59, and respecively. These probabiliies are represened on a pie char, and hen four numbers are randomly generaed beween 1 and 100. Then, he likeliness ha he numbers generaed would fall in he region of candidae 2 migh be once, whereas for candidae 4 i migh be wice and candidae 1 more han once and for candidae 3 i may no fall a all. Thus, he srings are chosen o form he parens of he nex generaion.
5 5 Table 1 Candidae Finess value Percenage of oal finess Toal Rank Selecion: The previous ype of selecion may have problems when he finesses differ very much. For example, if he bes chromosome finess is 90% of he enire roulee wheel hen he oher chromosomes will have very few chances o be seleced. Rank selecion firs ranks he populaion and hen every chromosome receives finess from his ranking. The wors will have finess 1, second wors 2 ec. and he bes will have finess N (number of chromosomes in populaion). By his, all he chromosomes will have a chance o be seleced. Bu his mehod can lead o slower convergence, because he bes chromosomes may no differ much from he ohers. CROSSOVER Selecion alone canno inroduce any new individuals ino he populaion, i.e., i canno find new poins in he search space. These are generaed by geneically-inspired operaors, of which he mos well known are crossover and muaion. Crossover can be of eiher one-poin or wo-poin scheme. In one poin crossover, seleced pair of srings is cu a some random posiion and heir segmens are swapped o form new pair of srings. In wo-poin scheme, here will be wo break poins in he srings ha are randomly chosen. A he break-poin, he segmens of he wo srings are swapped so ha new se of srings are formed. For example, le us consider wo 8-bi srings given by ' ' and ' '. Then according o one-poin crossover, if a random crossover poin is chosen afer 3 bis from lef and segmens are cu as shown below: and he segmens are swapped o form
6 According o wo-poin crossover, if wo crossover poins are seleced as Then afer swapping boh he exreme segmens, he resuling srings formed are Crossover is no usually applied o all pairs of individuals seleced for maing. A random choice is made, where he probabiliy of crossover being applied is ypically beween 0.6 and 0.9. MUTATION Muaion is applied o each child individually afer crossover. I randomly alers each gene wih a small probabiliy (generally no greaer han 0.01). I injecs a new geneic characer ino he chromosome by changing a random a bi in a sring depending on he probabiliy of muaion. Example: is muaed as I is seen in he above example ha he sixh bi '0' is changed o '1'. Thus, in muaion process, bis are changed from '1' o '0' or '0' o '1' a he randomly chosen posiion of randomly seleced srings. REAL-CODED GAs As explained earlier, GAs work wih a coding of variables i.e., wih a discree search space. GAs have also been developed o work direcly wih coninuous variables. In hese cases, binary srings are no used. Insead, he variables are direcly used. Afer he creaion of populaion of random variables, a reproducion operaor can be used o selec good srings in he populaion. AREAS OF APPLICATION IN WATER RESOURCES Waer disribuion sysems Hydrological modeling Waershed Managemen
7 7 Groundwaer modeling Reservoir Operaion ADVANTAGES AND DISADVANTAGES OF EA: EA can be efficienly used for highly complex problems wih muli-objeciviy, non-lineariy ec. I provides no only a single bes soluion, bu he 2 nd bes, 3 rd bes and so on as required. I gives quick approximae soluions. EA mehods can very well incorporae wih oher local search algorihms. There are some drawbacks also in using EA echniques. An opimal soluion canno be ensured on using EA mehods, which are usually known as heurisic search mehods. Convergence of EA echniques are problem oriened. Sensiiviy analysis should be carried ou o find ou he range in which he model is efficien. Also, he implemenaion of hese echniques requires good programming skill. MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS Geneic algorihms are efficien in solving muliobjecive problems. Consideraions in Muli- Objecive Evoluionary Algorihms (MOEAs) implemenaion are 1. Preserve non-dominaed poins eliism 2. Progress owards poins on Pareo fron 3. Mainain diversiy of poins on Pareo Fron (phenoype) and/or Pareo Opimal soluions (genoype) 4. Provide decision maker a limied number of Pareo Fron (PF) poins. Non-dominaed soluions are always beer han 1s-level dominaed soluions, which are always beer han 2nd-level dominaed soluions, ec. Wihin he same level of dominance, soluions which are isolaed are beer han soluions ha are clumped ogeher.
8 8 Flow char of Muli-objecive Geneic Algorihm wih Eliism Fig. 2 Muli Objecive Geneic Algorihms for Opimal Reservoir Operaion Case Sudy Bhadra Reservoir A muli-purpose reservoir locaed in he disric of Chickmangalur, Karnaaka sae, India; 75 o E longiude and 13 o 42 N laiude.
9 9 Fig. 3 Schemaic diagram of Bhadra reservoir Projec Muli Objecive Reservoir Operaion Model Objecive funcions: 1. Minimize irrigaion defici (f 1 ) SQDV Dl, IRl, Dr, IRr, Maximize hydropower producion (f 2 ) 2 Subjec o consrains in 12 E k1rl, Hl, k2rr, H r, k3rb, Hb, 1 (i) Reservoir sorage coninuiy consrain (ii) Sorage bounds S 1 S I R1, R2, R3, Smin S S max (iii)turbine capaciy limis pr pr pr 1, 2, 3, H H (iv) Canal capaciy limis H 1, 2, 3, E 1,max E E 2,max 3,max E O
10 10 R R 1, 2, C C 1,max 2,max (v) Irrigaion demands D D 1min, 2min, R 1, R 2, (vi) Waer qualiy requiremens D 1max, D 2max, R 3, MDT Pareo opimal soluion for reservoir operaion f gen=50 gen=200 gen= f 1 x 10 4 Fig. 4 Improvemen in Pareo opimal fron over he ieraions. f 1 is annual squared irrigaion defici; f 2 is hydropower generaed MkWh Model Applicaion MOGA model is solved for hree differen inflow scenarios ino he reservoir Scenario 1: Mean monhly inflows 0.5 * SD Scenario 2: Mean monhly inflows Scenario 3: Mean monhly inflows * SD where SD is he sandard deviaion of monhly flows
11 11 Fig. 5 Pareo opimal fron, showing he rade-off beween irrigaion ( f 1 ) and hydropower ( f 2 ) for differen inflow scenarios. f 1 = sum of squared irrigaion deficis, (Mm 3 ) 2 ; f 2 = hydropower generaed, (MkWh)
12 12 Fig. 6 Reservoir operaing policies for differen inflow scenarios, showing he iniial sorages for differen siuaions, viz., equal prioriy case, irrigaion only prioriy case and hydropower only prioriy case.
13 13 Fig. 7 Opimal release policy obained for equal prioriy case, showing releases in Mm 3 for Lef bank canal (R1), Righ bank canal (R2) and River bed (R3) for differen inflow scenarios. Advanages of MOEAs: MOEAs are easy o adop and can provide efficien soluions for muli-objecive problems. They are capable of handling nonlinear objecives/ consrains, disconneced Pareo-frons,
14 14 non-convex decision space. They can find soluions o exremely complex and high dimensional real-world applicaions in reasonable compuaion ime. They have high poenial for muli-objecive opimizaion of hydrological and waer resources problems.
Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space
Inernaional Journal of Indusrial and Manufacuring Engineering Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Space Vichai Rungreunganaun and Chirawa Woarawichai
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints
IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy
More information20. Applications of the Genetic-Drift Model
0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0
More informationParticle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems
Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,
More informationAn introduction to the theory of SDDP algorithm
An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking
More informationA Framework for Efficient Document Ranking Using Order and Non Order Based Fitness Function
A Framework for Efficien Documen Ranking Using Order and Non Order Based Finess Funcion Hazra Imran, Adii Sharan Absrac One cenral problem of informaion rerieval is o deermine he relevance of documens
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationTask-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver
CARV 2007 Task-based Configuraion Opimizaion of Modular and Reconfigurable Robos using a Muli-soluion Inverse Kinemaics Solver S. Tabandeh 1, C. Clark 2, W. Melek 3 Absrac: Modular and Reconfigurable Robos
More informationThe Production-Distribution Problem in the Supply Chain Network using Genetic Algorithm
Inernaional Journal o Applied Engineering Research ISSN 0973-4562 Volume 12, Number 23 (2017) pp. 13570-13581 Research India Publicaions. hp://www.ripublicaion.com The Producion-Disribuion Problem in he
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationParticle Swarm Optimization
Paricle Swarm Opimizaion Speaker: Jeng-Shyang Pan Deparmen of Elecronic Engineering, Kaohsiung Universiy of Applied Science, Taiwan Email: jspan@cc.kuas.edu.w 7/26/2004 ppso 1 Wha is he Paricle Swarm Opimizaion
More informationStructural Break Detection in Time Series Models
Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy
More informationStructural Break Detection in Time Series
Srucural Break Deecion in Time Series Richard A. Davis Thomas ee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures This research suppored in par by an IBM faculy award.
More informationScheduling of Crude Oil Movements at Refinery Front-end
Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
More informationSequencing algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Sequencing algorihms for flexible flow shop problems wih unrelaed parallel machines, seup imes, and dual crieria Jii Jungwaanaki a, Manop Reodecha a, Paveena Chaovaliwongse a, Frank Werner b,* a Deparmen
More informationConvergence Improvement of Reliability-Based MultiobjectiveOptimization Using Hybrid MOPSO
10 h World Congress on Srucural and Mulidisciplinary Opimizaion May 19-4, 013, Orlando, Florida, USA Convergence Improvemen of Reliabiliy-Based MuliobjeciveOpimizaion Using Hybrid MOPSO Shoichiro KAWAJI
More informationStructural Break Detection in Time Series Models
Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by: Naional
More informationKeywords Digital Infinite-Impulse Response (IIR) filter, Digital Finite-Impulse Response (FIR) filter, DE, exploratory move
Volume 5, Issue 7, July 2015 ISSN: 2277 128X Inernaional Journal of Advanced Research in Compuer Science and Sofware Engineering Research Paper Available online a: www.ijarcsse.com A Hybrid Differenial
More informationStructural Break Detection in Time Series Models
Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy
More informationSequential Importance Resampling (SIR) Particle Filter
Paricle Filers++ Pieer Abbeel UC Berkeley EECS Many slides adaped from Thrun, Burgard and Fox, Probabilisic Roboics 1. Algorihm paricle_filer( S -1, u, z ): 2. Sequenial Imporance Resampling (SIR) Paricle
More informationStructural Break Detection for a Class of Nonlinear Time Series Models
Srucural Break Deecion for a Class of Nonlinear Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored
More informationGlobal Optimization for Scheduling Refinery Crude Oil Operations
Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae
More informationSTATE-SPACE MODELLING. A mass balance across the tank gives:
B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing
More informationA Genetic Algorithm Solution to the Unit Commitment Problem Based on Real-Coded Chromosomes and Fuzzy Optimization
A Geneic Algorihm Soluion o he Uni Commimen Problem Based on Real-Coded Chromosomes and Fuzzy Opimizaion Alma Ademovic #1, Smajo Bisanovic #, Mensur Hajro #3 Faculy for Elecrical Engineering Universiy
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(5): Research Article
Available online www.jocpr.com Journal of Chemical and Pharmaceuical Research, 204, 6(5):70-705 Research Aricle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Cells formaion wih a muli-objecive geneic algorihm Jun
More informationSingle-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems
Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional
More informationOrientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets
Connecions beween nework coding and sochasic nework heory Bruce Hajek Orienaion On Thursday, Ralf Koeer discussed nework coding: coding wihin he nework Absrac: Randomly generaed coded informaion blocks
More informationParticle Swarm Optimization Algorithm for Agent-Based Artificial Markets. Tong Zhang and B. Wade Brorsen
Paricle Swarm Opimizaion Algorihm for Agen-Based Arificial Markes Tong Zhang and B. Wade Brorsen Absrac Paricle swarm opimizaion (PSO) is adaped o simulae dynamic economic games. The robusness and speed
More informationLecture 2 October ε-approximation of 2-player zero-sum games
Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion
More informationA Global Convergence Proof for a Class of Genetic Algorithms
A Global Convergence Proof for a Class of Geneic Algorihms Richard F. Harl * Absrac: In his paper a varian of a geneic algorihm is invesigaed which combines he advanages of geneic algorihms and of simulaed
More information( ) ( ) ( ) + W aa. ( t) n t ( ) ( )
Supplemenary maerial o: Princeon Universiy Press, all righs reserved From: Chaper 3: Deriving Classic Models in Ecology and Evoluionary Biology A Biologis s Guide o Mahemaical Modeling in Ecology and Evoluion
More informationA new improved filter for target tracking: compressed iterative particle filter
Vol.3, No.4, 301-306 (011) hp://d.doi.org/10.436/ns.011.34039 Naural Science A ne improved filer for arge racking: compressed ieraive paricle filer Hongbo Zhu 1 *, Hai Zhao, Dan Liu, Chunhe Song 1 Sofare
More informationPlanning in POMDPs. Dominik Schoenberger Abstract
Planning in POMDPs Dominik Schoenberger d.schoenberger@sud.u-darmsad.de Absrac This documen briefly explains wha a Parially Observable Markov Decision Process is. Furhermore i inroduces he differen approaches
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationRandom Walk with Anti-Correlated Steps
Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and
More informationINTRODUCTION TO MACHINE LEARNING 3RD EDITION
ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class
More information) were both constant and we brought them from under the integral.
YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha
More informationStructural Break Detection in Time Series Models
Srucural Break Deecion in Time Series Models Richard A. Davis Thomas Lee Gabriel Rodriguez-Yam Colorado Sae Universiy (hp://www.sa.colosae.edu/~rdavis/lecures) This research suppored in par by an IBM faculy
More informationModal identification of structures from roving input data by means of maximum likelihood estimation of the state space model
Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix
More informationProcess and die design for square tube extrusion
Indian Journal of Engineering & Maerials Sciences Vol. 16, February 2009, pp. 51-55 Process and die design for square ube exrusion K K Pahak a *, S Lomash b & A K Jha a a Advanced Maerials and Processes
More informationThe Effect of Introducing a Tag Node in Solving Scheduling Problems Using Edge Histogram Based Sampling Algorithms
Proceedings of he 2003 Congress on Evoluionary Compuaion (CEC' 03) The Effec of Inroducing a Tag Node in Solving Scheduling Problems Using Edge Hisogram Based Sampling Algorihms Shigeyoshi Tsusui Deparmen
More informationA Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs
PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers
More information2. Nonlinear Conservation Law Equations
. Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear
More informationLONG-TERM HYDROTHERMAL SCHEDULING VIA META-HEURISTICS
LONG-TERM HYDROTHERMAL SCHEDULING VIA META-HEURISTICS Alexandre F. Amendola Energy Trading PETROBRAS Rio de Janeiro, Brazil amendola@perobras.com.br Absrac This paper focuses on he long-erm hydrohermal
More informationMATHEMATICAL DESCRIPTION OF THEORETICAL METHODS OF RESERVE ECONOMY OF CONSIGNMENT STORES
MAHEMAICAL DESCIPION OF HEOEICAL MEHODS OF ESEVE ECONOMY OF CONSIGNMEN SOES Péer elek, József Cselényi, György Demeer Universiy of Miskolc, Deparmen of Maerials Handling and Logisics Absrac: Opimizaion
More informationEE650R: Reliability Physics of Nanoelectronic Devices Lecture 9:
EE65R: Reliabiliy Physics of anoelecronic Devices Lecure 9: Feaures of Time-Dependen BTI Degradaion Dae: Sep. 9, 6 Classnoe Lufe Siddique Review Animesh Daa 9. Background/Review: BTI is observed when he
More informationMOMENTUM CONSERVATION LAW
1 AAST/AEDT AP PHYSICS B: Impulse and Momenum Le us run an experimen: The ball is moving wih a velociy of V o and a force of F is applied on i for he ime inerval of. As he resul he ball s velociy changes
More informationNavneet Saini, Mayank Goyal, Vishal Bansal (2013); Term Project AML310; Indian Institute of Technology Delhi
Creep in Viscoelasic Subsances Numerical mehods o calculae he coefficiens of he Prony equaion using creep es daa and Herediary Inegrals Mehod Navnee Saini, Mayank Goyal, Vishal Bansal (23); Term Projec
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationA Cellular-rearranging of Population in Genetic Algorithms to Solve Assembly-Line Balancing Problem
Journal of Mechanical Engineering and Auomaion 2012, 2(2): 25-35 DOI: 10.5923/j.jmea.20120202.05 A Cellular-rearranging of Populaion in Geneic Algorihms o Solve Assembly-Line Balancing Problem Hossein
More informationA Shooting Method for A Node Generation Algorithm
A Shooing Mehod for A Node Generaion Algorihm Hiroaki Nishikawa W.M.Keck Foundaion Laboraory for Compuaional Fluid Dynamics Deparmen of Aerospace Engineering, Universiy of Michigan, Ann Arbor, Michigan
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationStructural Break Detection in Time Series Models
Srucural Break Deecion in Time Series Models Richard A. Davis Columbia Universiy Thomas Lee Colorado Sae Universiy Gabriel Rodriguez-Yam Universidad Auónoma Chapingo (hp://www.sa.columbia.edu/~rdavis/lecures)
More information1. VELOCITY AND ACCELERATION
1. VELOCITY AND ACCELERATION 1.1 Kinemaics Equaions s = u + 1 a and s = v 1 a s = 1 (u + v) v = u + as 1. Displacemen-Time Graph Gradien = speed 1.3 Velociy-Time Graph Gradien = acceleraion Area under
More informationNotes on Kalman Filtering
Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren
More informationImproved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations
Improved Gene Expression Programming o Solve he Inverse Problem for Ordinary Differenial Equaions Kangshun Li a, Yan Chen a,, Wei Li a,b, Jun He c, Yu Xue d a Souh China Agriculural Universiy, College
More informationEnd-To-End Reliability-Dependent Pricing of Network Services
End-To-End Reliabiliy-Dependen Pricing of Nework Services Bruno TUIN, Pablo RODRÍGUEZ BOCCA 2 and Hécor CANCELA BOSI 2 * IRISA-INRIA, Renne rance 2 Deparameno de Invesigación Operaiva, Insiuo de Compuación,
More informationMachine Loading in Flexible Manufacturing System: A Swarm Optimization Approach
Machine Loading in Flexible Manufacuring Sysem: A Swarm Opimizaion Approach Sandhyarani Biswas Naional Insiue of Technology sandhya_biswas@yahoo.co.in S.S.Mahapara Naional Insiue of Technology mahaparass2003@yahoo.com
More informationOn Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature
On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check
More informationAN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION
The Inernaional Archives of he Phoogrammery, Remoe Sensing and Spaial Informaion Sciences, Vol. 38, Par II AN OPTIMISED CELLULAR AUTOMATA MODEL BASED ON ADAPTIVE GENETIC ALGORITHM FOR URBAN GROWTH SIMULATION
More informationInventory Control of Perishable Items in a Two-Echelon Supply Chain
Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationResource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques
Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions
More informationAdvanced Organic Chemistry
Lalic, G. Chem 53A Chemisry 53A Advanced Organic Chemisry Lecure noes 1 Kineics: A racical Approach Simple Kineics Scenarios Fiing Experimenal Daa Using Kineics o Deermine he Mechanism Doughery, D. A.,
More informationChapter 2. Models, Censoring, and Likelihood for Failure-Time Data
Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based
More informationEnsamble methods: Boosting
Lecure 21 Ensamble mehods: Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Schedule Final exam: April 18: 1:00-2:15pm, in-class Term projecs April 23 & April 25: a 1:00-2:30pm in CS seminar room
More informationArticle Multi-Objective Optimization Algorithm Based on Sperm Fertilization Procedure (MOSFP)
Aricle Muli-Objecive Opimizaion Algorihm Based on Sperm Ferilizaion Procedure (MOSFP) Hisham A. Shehadeh, Mohd Yamani Idna ldris * and Ismail Ahmedy Deparmen of Compuer Sysem and Technology, Faculy of
More informationEnsamble methods: Bagging and Boosting
Lecure 21 Ensamble mehods: Bagging and Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Ensemble mehods Mixure of expers Muliple base models (classifiers, regressors), each covers a differen par
More informationRobotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.
Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of
More informationDEVELOPMENT AND ANALYSIS OF GENETIC ALGORITHM FOR TIME SERIES FORECASTING PROBLEM. Leonid Hulianytskyi, Anna Pavlenko
Inernaional Journal "Informaion Models and Analyses" Volume 4 Number 05 3 DEVELOPMENT AND ANALYSIS OF GENETIC ALGORITHM FOR TIME SERIES FORECASTING PROBLEM Leonid Hulianyskyi Anna Pavlenko Absrac: This
More informationAsymptotic Equipartition Property - Seminar 3, part 1
Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae
More informationCHAPTER 12 DIRECT CURRENT CIRCUITS
CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As
More informationMath 10B: Mock Mid II. April 13, 2016
Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.
More informationComparing Means: t-tests for One Sample & Two Related Samples
Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion
More information22. Inbreeding. related measures: = coefficient of kinship, a measure of relatedness of individuals of a population; panmictic index, P = 1 F;
. Inbreeding Inbreeding: maing beween relaives. has predicable consequences for gene and genoype frequencies; increases he frequency of homozygous genoypes a he expense of heerozygous genoypes; hus decreases
More informationTwo Coupled Oscillators / Normal Modes
Lecure 3 Phys 3750 Two Coupled Oscillaors / Normal Modes Overview and Moivaion: Today we ake a small, bu significan, sep owards wave moion. We will no ye observe waves, bu his sep is imporan in is own
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 17
EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive
More informationCHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING
ISPRS Commission VII Mid-erm Symposium "Remoe Sensing: From Pixels o Processes", Enschede, he Neherlands, 8-11 May 2006 CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING Sharaf Alkheder,
More informationModelling traffic flow with constant speed using the Galerkin finite element method
Modelling raffic flow wih consan speed using he Galerin finie elemen mehod Wesley Ceulemans, Magd A. Wahab, Kur De Prof and Geer Wes Absrac A macroscopic level, raffic can be described as a coninuum flow.
More information23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes
Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion
More informationSZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1
SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision
More information0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED
0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable
More informationModule 2 F c i k c s la l w a s o s f dif di fusi s o i n
Module Fick s laws of diffusion Fick s laws of diffusion and hin film soluion Adolf Fick (1855) proposed: d J α d d d J (mole/m s) flu (m /s) diffusion coefficien and (mole/m 3 ) concenraion of ions, aoms
More informationSpring Ammar Abu-Hudrouss Islamic University Gaza
Chaper 7 Reed-Solomon Code Spring 9 Ammar Abu-Hudrouss Islamic Universiy Gaza ١ Inroducion A Reed Solomon code is a special case of a BCH code in which he lengh of he code is one less han he size of he
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationOn Comparison between Evolutionary Programming Network based Learning and Novel Evolution Strategy Algorithm-based Learning
Proceedings of he ICEECE December -4 (003), Dhaka, Bangladesh On Comparison beween Evoluionary Programming Nework based Learning and vel Evoluion Sraegy Algorihm-based Learning M. A. Khayer Azad, Md. Shafiqul
More informationLecture 9: September 25
0-725: Opimizaion Fall 202 Lecure 9: Sepember 25 Lecurer: Geoff Gordon/Ryan Tibshirani Scribes: Xuezhi Wang, Subhodeep Moira, Abhimanu Kumar Noe: LaTeX emplae couresy of UC Berkeley EECS dep. Disclaimer:
More informationTournament selection in zeroth-level classifier systems based on. average reward reinforcement learning
ournamen selecion in zeroh-level classifier sysems based on average reward reinforcemen learning Zang Zhaoxiang, Li Zhao, Wang Junying, Dan Zhiping zxzang@gmail.com; zangzx@hus.edu.cn (Hubei Key Laboraory
More informationA Dynamic Model for Facility Location in Closed-Loop Supply Chain Design
A Dynamic Model for Faciliy Locaion in Closed-Loop Supply Chain Design Orapadee Joochim 1 Inroducion A he sraegic level, closed-loop supply chain (CLSC managemen involves long-erm decisions regarding he
More informationGENERALIZATION OF THE FORMULA OF FAA DI BRUNO FOR A COMPOSITE FUNCTION WITH A VECTOR ARGUMENT
Inerna J Mah & Mah Sci Vol 4, No 7 000) 48 49 S0670000970 Hindawi Publishing Corp GENERALIZATION OF THE FORMULA OF FAA DI BRUNO FOR A COMPOSITE FUNCTION WITH A VECTOR ARGUMENT RUMEN L MISHKOV Received
More informationA Cross Entropy-Genetic Algorithm for m-machines No-Wait Job-Shop Scheduling Problem
Journal of Inelligen Learning Sysems and Applicaions, 2011, 3, 171-180 doi:10.4236/jilsa.2011.33018 Published Online Augus 2011 (hp://www.scirp.org/journal/jilsa) 171 A Cross Enropy-Geneic Algorihm for
More informationWATER ABSTRACTUION AND RESERVOIR VOLUME DESIGN
WATER ABSTRACTUION AND RESERVOIR VOLUME DESIGN SURFACE WATER Wihou river regulaion Wih river regulaion Coninuous Lakes (regulaed) Selecive Reservoirs CONTINUOUS DERIVATION FROM A RIVER HYDROGRAPH Q FLOW
More informationA Hop Constrained Min-Sum Arborescence with Outage Costs
A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem
More informationOptimal Placement of Unified Power Quality Conditioner using Ant Lion Optimization Method
Research India Publicaions. hp://www.ripublicaion.com Opimal Placemen of Unified Power Qualiy Condiioner using An Lion Opimizaion Mehod M. Laxmidevi Ramanaiah 1 and Dr. M. Damodar Reddy 2 Research Scholar
More informationFinding Near-Optimum Message Scheduling Settings for SHA-256 Variants Using Genetic Algorithms
Finding Near-Opimum essage Scheduling Seings for SHA-256 Varians Using Geneic Algorihms CHU-HSING LIN, CHEN-YU LEE 2, KRISHNA. KAVI 3, DENG-JYI CHEN 2, YI-SHIUNG YEH 2 Deparmen of Compuer Science Tunghai
More informationEVOLUTIONARY OPTIMIZATION IN DYNAMIC FITNESS LANDSCAPE ENVIRONMENTS
EVOLUTIONARY OPTIMIZATION IN DYNAMIC FITNESS LANDSCAPE ENVIRONMENTS Aragón V. S., Esquivel S. C., Laboraorio de Invesigación y Desarrollo en Ineligencia Compuacional (LIDIC) 1 Faculad de Ciencias Físico,
More information