Thin-Walled Structures Group
|
|
- Felix Page
- 5 years ago
- Views:
Transcription
1 Thn-Walled Structures Group JOHNS HOPKINS UNIVERSITY RESEARCH REPORT Towards optmzaton of CFS beam-column ndustry sectons TWG-RR02-12 Y. Shfferaw July
2 Ths report was prepared ndependently, but was motvated from, the Amercan Iron and Steel Insttute sponsored proect: Drect Strength Predcton of Cold-Formed Steel Beam Columns. The proect also receved supplementary support and fundng from the Metal Buldng Manufacturers Assocaton. Proect updates are avalable at Any opnons, fndngs, and conclusons or recommendatons expressed n ths publcaton are those of the author and do not necessarly reflect the vews of the Amercan Iron and Steel Insttute, nor the Metal Buldng Manufacturers Assocaton. Acknowledgements: The authors would lke to acknowledge AISI and MBMA for ther support throughout the duraton of ths proect. The author would also lke to acknowledge Jzahen Leng and Dr. Zhane L for ther nput on ths work. 2
3 Towards optmzaton of CFS beam-column ndustry sectons 1. Introducton The obectve of ths research s to develop ndustry sectons optmzed for maxmum strength subected to shape and dmensonal constrants that can be used n low-cost sustanable md-rse cold-formed steel housng constructon. The optmzaton of common ndustry sectons that nclude channel, zee, hat and sgma sectons used n framng, truss and metal buldng cold-formed steel applcatons (Fgure 1) and nonstandard sectons subected to combned loadng of compresson and bendng s examned. The effect of the complex stablty behavor of thn-walled cross-secton when subected to combned loadng s ncorporated nto the optmzaton code va yeldng, elastc crtcal bucklng and strength envelopes. Prelmnary Drect Strength Method approach for combned loadng n cold-formed steel members subected to combned loadng s adopted for strength predcton n place of current lnear nteracton approach. The methods of gradent-based optmzaton and stochastc optmzaton va genetc algorthm are explored for optmal soluton. Based on strength envelopes of the prelmnary Drect Strength Method n the axal-bendng space, effcent members beamcolumn use can be readly selected. Fgure 1 Beam-column ndustry applcatons that motvated the research a) Framng b) Truss c) Metal buldng 2. Optmzaton problem formulaton The optmzaton of cold-formed steel ndustry sectons subected to combned loadng s examned. The maxmum combned strength s sought gven a rectangular-szed sheet of steel. A 1.57 mm thck and 215 mm wde sheet of steel s consdered based on the average dmensons of SSMA standard channel sectons. Sectons selected for 3
4 optmzaton study are n the sprt of the standard sectons used n the framng, truss and metal buldng ndustry. The cross-sectonal dmensons of the varous applcatons are determned based on the average dmenson for that partcular standard shape. The materal propertes are Young s modulus (E= MPa) and yeld strength (fy=344.5 MPa). The member length s chosen as 3000mm. The optmzaton problem s formulated n the standard form as: Max n Mn 1 n Subect to the followng dmensonal constrants: Framng applcatons Channel secton b" d" h" h + 2b + 2d! w 2d < h b" d" h/4$ h/3$ b$ Sgma secton d$ h/12$ h/12$ 1.069h + 2b + 4d! w 2d < h h/4$ b$ d$ Truss applcatons Hat/U secton 4
5 4.76" 4.76" 0.625h" 0.25h" d" d" 0.5d" h/8" h/8" 2.059h + b + 5d ! w 2d < h b" b/2" Metal buldng applcatons Zee secton d" b" h" h + 2b + 2d! w! 2d < h b" d" Non-standard S secton b$ d$ h/2$ b$ h + 3b + 2d! w 2d < h h/2$ d$ b$ where w s the wdth of the sheet of steel and n s the predcted combned load capacty of the secton: where { } n = mn ne, nl, nd 5
6 for λ n = ne for λ > cr cr n = y y y where λ = y / cr cr = Crtcal elastc local bucklng magntude under combned P-M resultant = Frst yeld under combned P-M resultant. for λ d for λ d where y 0.673c nd = y > 0.673c nd = 0.5b 0.5b crd y y γ / π 2γ / π 2γ / π, and a crd y 2 a = ( 1.136) b = (1.2) c = (0.834) λ d = y / crd crd = Crtcal elastc dstortonal bucklng P-M resultant γ = Angular drecton (n radans) n the P-M space measured from the postve x- axs for the frst quadrant and from the negatve x-axs for the second quadrant. For a γ! = fxed angle n P M space fxed for each run! s f(l = 3000, t = 1.57, fy = 344.5, h, b, d) 6
7 3. Genetc algorthm (GA) approach to beam-column dmensonal optmzaton 3.1 Genetc Algorthm [3, 4, 5] The constraned optmzaton problem s frst transformed nto an unconstraned problem by makng use of penalty functons. Among the varous penalty methods, the addtve form s chosen [3]. Usng the general formulaton of an exteror penalty functon, the new obectve functon to be optmzed s gven as Mnmze f = 1/ Pcr + q = 1 r G + m c = q+ 1 L where G and are the functons of g ( X ) and h ( X ),nequalty and equalty L constrants respectvely, and L are, G max[ 0, g L = = h (X ) γ ( X )] r and c are penalty parameters. General formulas of G and where and γ are commonly 1 or 2. If the nequalty holds, g ( X ) 0and max[0, g ( X )] wll be zero. Therefore the constrant does not affect the g new obectve functon. If the constrant s volated ( ( X ) or h ( X ) 0 ), a bg term wll be added to the new obectve functon such that the soluton s pushed back towards the feasble regon. The severty of the penalty depends on the penalty parameters r and c. If ether the penalty s too large or too small, the problem could be very hard for genetc algorthm. A bg penalty prevents t from searchng an nfeasble regon. In ths case, the genetc algorthm (GA) wll converge to a feasble soluton very quckly even f t s far from the optmal. A small penalty wll cause t to spend too much tme n searchng n an nfeasble regon; thus GA would converge to an nfeasble soluton. The basc operatons of natural genetcs-reproducton, crossover, and mutaton-are mplemented by use of genetc algorthm. It starts wth a set of desgns, randomly generated usng the allowable values for each desgn varable. Each desgn s also assgned a ftness value, usng the penalty functon for constraned problems. From the 7
8 current set of desgns, a subset s selected to generate new desgns usng the selected subset of desgns. The sze of the set of desgns s kept fxed. Snce more ft members of the set are used to create new desgns, the successve sets of desgns have a hgher probablty of havng desgns wth better ftness values. The process s contnued untl a stoppng crteron s met. Reproducton s a process n whch the ndvduals are selected based on ther ftness values relatve to that of the populaton. In ths process, each ndvdual strng (desgn vector) s assgned a probablty of beng selected as F P = where Np s the sze of populaton and s the ftness value for each desgn that defnes ts relatve mportance n the set, and s gven by F = ( 1+ ε ) f max f where s the cost functon( penalty functon value for constraned problems) for the f th desgn, f s the largest recorded cost(penalty) functon value, and ε s a small value max to prevent numercal dffcultes when becomes 0. After reproducton, the crossover operaton s mplemented n two steps. Frst two ndvdual strngs (desgns) are selected from the matng pool generated by the reproducton operator. Next, a crossover ste s selected at random along the strng length, and the bnary dgts (alleles) are swapped between the two strngs followng the crossover ste. Mutaton s the next operaton whch n terms of a genetc strng, corresponds to selectng a few members of the populaton, determnng a locaton on each strng randomly, and swtchng 0 to 1 or vce versa. The number of members selected for mutaton (I m ), s based on heurstcs, and the selecton of locaton on the strng for mutaton s based on a random process. I m =nteger(p m *N p ) where Pm-fracton of populaton selected for mutaton In each generaton, whle the number of reproducton operatons s always equal to the sze of the populaton, the amount of crossover (I max ) and mutaton (I m ) can be adusted to fne-tune the performance of the algorthm. If the mprovement for the best cost (penalty) ' functon value s less than ε for the last I g consecutve teratons, or f the number of teratons exceeds a specfed value, then the algorthm termnates. Genetc algorthm operatons Selecton-Roulette wheel (ftness proportonate) selecton [ Spall p. 243] F F N p = 1 F 8
9 3.2 Parametrc study for GA Np! Gen!! 1! 2!! 3!! 4!! 5!! 6!! 7!! 8!! 9!! 10!! 1! ! ! ! ! ! ! ! ! ! ! 2! ! ! ! ! ! ! ! ! ! ! 3! ! ! ! ! ! ! ! ! ! ! 4! ! ! ! ! ! ! ! ! ! ! 5! ! ! ! ! ! ! ! ! ! ! 6! ! ! ! ! ! ! ! ! ! ! 7! ! ! ! ! ! ! ! ! ! ! 8! ! ! ! ! ! ! ! ! ! ! 9! ! ! ! ! ! ! ! ! ! ! Np Gn Pm Ic C_neq Bn C C C C C C C C C C C C C C C C C C C C5 9
10 4. Gradent-based approach to beam-column dmensonal optmzaton 4.1 6""-('75* 89:;<!;=*9>4#1.%$/)3%()'4*7()30-'%)/.*)()4%)/'-*$%)%$%&'#()* I(4/-')7/EJC/1K* 4.2 Parameters n gradent-based Gamma=p/4 teraton constant Beta,n 10
11 [h'b'd]=[70.8,47.2,24.9]' [168.6,14.9,1.2]' [80.6,40.1,27.0]' [70.8,47.2,24.9]' n=173.02*10^3' n=216.4*10^3' n=174.79*10^3' n=175.8*10^3' 11
12 12
13 5. Conclusons The optmzaton of a channel cross-secton subect to combned loadng has been studed usng genetc algorthm and gradent-based methods. The effect of complex bucklng behavor of thn-walled cross-secton when subected to combned actons has been ncorporated nto the optmzaton code by usng the fnte-strp method and the drect strength method. The study ndcated that effectve use of genetc algorthm to such optmzaton problem requres examnaton of parameters such as the penalty functon, mutaton rate and suffcently large number of populaton and generatons to capture the optmal soluton. The penalty, cross-over and mutaton parameters need to be adusted for optmum soluton. In comparson, the gradent-based methods.. Future research that combnes genetc algorthm wth gradent-based methods to ensure globally optmal results s an approach that should be explored. In addton, optmzaton of beam-column sectons under combned axal and mnor-axs and baxal bendng has the potental to explot addtonal strength as predcted under newly developed Drect Strength Method for combned loadng. References 1. Schafer BW. Progress on the drect strength method. 16th Internatonal Specalty Conference on Cold-formed Steel Structures,Orlando,FL Amercan Iron and Steel Insttute (2006). Drect Strength Method Desgn Gude. Amercan Iron and Steel Insttute, Washngton,D.C. 3. Ozgur Yenay. Penalty Functon Methods For Constraned Optmzaton wth Genetc Algorthms:, Mathematcal and Computatonal Applcatons, Vol. 10,No.1,pp.45-56, Introducton to Optmum Desgn: Jasbr S.Arora, Second Edton Engneerng Optmzaton: Theory and Practce, Sngresu S. Rao,Thrd ed
The Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationORIGIN 1. PTC_CE_BSD_3.2_us_mp.mcdx. Mathcad Enabled Content 2011 Knovel Corp.
Clck to Vew Mathcad Document 2011 Knovel Corp. Buldng Structural Desgn. homas P. Magner, P.E. 2011 Parametrc echnology Corp. Chapter 3: Renforced Concrete Slabs and Beams 3.2 Renforced Concrete Beams -
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationGENETIC ALGORITHM APPLICATION IN ECONOMIC LOAD DISTRIBUTION
Internatonal Journal on Techncal and Physcal Problems of Engneerng (IJTPE) Publshed by Internatonal Organzaton of IOTPE ISS 077-358 IJTPE Journal www.otpe.com jtpe@otpe.com December 013 Issue 17 Volume
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationDESIGN OF NONLINEAR FRAMED STRUCTURES USING GENETIC OPTIMIZATION
DESIGN OF NONLINEAR FRAMED STRUCTURES USING GENETIC OPTIMIZATION By S. Pezeshk, 1 Member, ASCE, C. V. Camp, 2 Assocate Member, ASCE, and D. Chen, 3 Member, ASCE ABSTRACT: In ths paper we present a genetc
More informationSolving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study
Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationIndeterminate pin-jointed frames (trusses)
Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationUsing the estimated penetrances to determine the range of the underlying genetic model in casecontrol
Georgetown Unversty From the SelectedWorks of Mark J Meyer 8 Usng the estmated penetrances to determne the range of the underlyng genetc model n casecontrol desgn Mark J Meyer Neal Jeffres Gang Zheng Avalable
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationIJRSS Volume 2, Issue 2 ISSN:
IJRSS Volume, Issue ISSN: 49-496 An Algorthm To Fnd Optmum Cost Tme Trade Off Pars In A Fractonal Capactated Transportaton Problem Wth Restrcted Flow KAVITA GUPTA* S.R. ARORA** _ Abstract: Ths paper presents
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationThe Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems
The Convergence Speed of Sngle- And Mult-Obectve Immune Algorthm Based Optmzaton Problems Mohammed Abo-Zahhad Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut,
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationStatistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA
14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationCantilever Beam and Torsion Rod Design Optimization Using Genetic Algorithm
ISSN (Onlne) : 2319-8753 ISSN (Prnt) : 237-6710 Internatonal Journal of Innovatve Research n Scence, Engneerng and Technology Volume 3, Specal Issue 3, March 201 201 Internatonal Conference on Innovatons
More informationCapacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search
Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton
More informationCHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD
90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the
More informationA Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems
JOURNL OF COMPUERS VOL 5 NO 6 JUNE 00 965 Hybrd Co-evolutonary Partcle Optmzaton lgorthm for Solvng Constraned Engneerng Desgn Problems Yongquan Zhou Shengyu Pe College of Mathematcs and Computer Scence
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationDifferential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow
1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationCHAPTER 4 MAX-MIN AVERAGE COMPOSITION METHOD FOR DECISION MAKING USING INTUITIONISTIC FUZZY SETS
56 CHAPER 4 MAX-MIN AVERAGE COMPOSIION MEHOD FOR DECISION MAKING USING INUIIONISIC FUZZY SES 4.1 INRODUCION Intutonstc fuzz max-mn average composton method s proposed to construct the decson makng for
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationFUZZY FINITE ELEMENT METHOD
FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationMULTI-OBJECTIVE OPTIMUM DESIGN OF 3D STRUCTURES UNDER STATIC AND SEISMIC LOADING CONDITIONS
4 th GRACM Congress on Computatonal Mechancs GRACM 2002 Patra, 27-29 June, 2002 GRACM MULTI-OBJECTIVE OPTIMUM DESIGN OF 3D STRUCTURES UNDER STATIC AND SEISMIC LOADING CONDITIONS Manols Papadrakaks, Nkos
More informationTHE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS
Nnth Internatonal IBPSA Conference Montréal, Canada August 5-8, 2005 THE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS Jonathan Wrght, and Al Alajm Department
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More informationTHEORY OF GENETIC ALGORITHMS WITH α-selection. André Neubauer
THEORY OF GENETIC ALGORITHMS WITH α-selection André Neubauer Informaton Processng Systems Lab Münster Unversty of Appled Scences Stegerwaldstraße 39, D-48565 Stenfurt, Germany Emal: andre.neubauer@fh-muenster.de
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationOptimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search
Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationAn Improved Clustering Based Genetic Algorithm for Solving Complex NP Problems
Journal of Computer Scence 7 (7): 1033-1037, 2011 ISSN 1549-3636 2011 Scence Publcatons An Improved Clusterng Based Genetc Algorthm for Solvng Complex NP Problems 1 R. Svaraj and 2 T. Ravchandran 1 Department
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationSTATIC OPTIMIZATION: BASICS
STATIC OPTIMIZATION: BASICS 7A- Lecture Overvew What s optmzaton? What applcatons? How can optmzaton be mplemented? How can optmzaton problems be solved? Why should optmzaton apply n human movement? How
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Experment-I MODULE VIII LECTURE - 34 ANALYSIS OF VARIANCE IN RANDOM-EFFECTS MODEL AND MIXED-EFFECTS EFFECTS MODEL Dr Shalabh Department of Mathematcs and Statstcs Indan
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationSelf-adaptive Differential Evolution Algorithm for Constrained Real-Parameter Optimization
26 IEEE Congress on Evolutonary Computaton Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 26 Self-adaptve Dfferental Evoluton Algorthm for Constraned Real-Parameter Optmzaton V.
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationSIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM
SIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM Mr.M.Svasubramanan 1 Mr.P.Musthafa Mr.K Sudheer 3 Assstant Professor / EEE Assstant Professor / EEE Assstant Professor
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More informationNUMERICAL RESULTS QUALITY IN DEPENDENCE ON ABAQUS PLANE STRESS ELEMENTS TYPE IN BIG DISPLACEMENTS COMPRESSION TEST
Appled Computer Scence, vol. 13, no. 4, pp. 56 64 do: 10.23743/acs-2017-29 Submtted: 2017-10-30 Revsed: 2017-11-15 Accepted: 2017-12-06 Abaqus Fnte Elements, Plane Stress, Orthotropc Materal Bartosz KAWECKI
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationOptimum design of laminated composite under axial compressive load
Sādhanā Vol. 36, Part 1, February 2011, pp. 73 85. Indan Academy of Scences Optmum desgn of lamnated composte under axal compressve load NGRIYENGAR 1, and NILESH VYAS 2 1 Department of Aerospace Engneerng,
More information/ n ) are compared. The logic is: if the two
STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence
More information