Mathematical Modeling of Earthwork Optimization Problems
|
|
- Lorraine Allen
- 6 years ago
- Views:
Transcription
1 Mathematcal Modelng of Earthwork Optmzaton Problems Yang J, André Borrmann, Ernst Rank Char for Computaton n Engneerng, Technsche Unverstät München Floran Sepp, Stefan Ruzka Optmzaton Group, Department of Mathematcs, Technsche Unverstät Kaserslautern Abstract In the past ths research efforts n optmzng earthwork processes focused manly on mnmzng transportaton costs and mass haul dstances, respectvely. Ths knd of optmzaton problem, well known as earthwork allocaton problem can be solved by applyng lnear programmng technques. As a result, the most cost-effcent cut-to-fll assgnments wll be found. In ths artcle, startng from an optmal cut-to-fll assgnment, we formulate a new correspondng combnatoral optmzaton problem. Ths earthwork secton dvson problem arses when a large road proect s dvded nto several lnear constructon sectons and tendered to dfferent normally non-cooperatng constructon companes. The optmzaton obectve s to partton the optmzed cut-to-fll-assgnments n dfferent earthwork sectons wth mnmal earth movements between them. Ths problem s subected to certan user-defned constrants, lke number of sectons, mnmal and maxmal secton-length, etc. The proposed soluton model wll be ntegrated nto an earthwork modelng and assessment system whch allows performng a quantty take-off from a roadway model to provde the necessary nput data for the optmzaton algorthms. Keywords: earthwork optmzaton, lnear programmng, road constructon, mathematcal modelng. 1 Introducton Earthwork s the maor workng task n road constructon proects and characterzed by large quanttes of earth materal whch have to be excavated, transported, and flled, possbly over a long dstance. Therefore, lnear programmng (LP) technques have been appled n order to mnmze the transportaton costs and the mass haul dstances n the earthwork processes, respectvely. The frst LPmodel of ths earthwork allocaton problem has been formulated and developed by Stark and Mayer (1983), further studes and extensons of ths model have been done by Easa (1987 and 1988), Jayawardane (1990) and Son (2005). As a result, the LP soluton provdes the optmal cut-fllassgnments and determnes the correspondng amount of earth to be hauled. Nowadays, large road constructon proects, such as hghway proects, wll usually be tendered to dfferent constructors or to sub-constructors by a general constructor. The dvded sub-proects can be processed n parallel n order to reduce the overall proect duraton. Normally, t s dffcult to establsh some knd of cooperaton between these constructors. Consequently, f the dvson of earthwork sectons s not optmal, t may happen that one or more constructon sectons suffer from consderable overflow of earth materals whle the other sectons demand addtonal materals from external borrow pts. Although the materal flows can be balanced durng the constructon phase wth
2 a lot of coordnaton efforts, ths wll usually result n addtonal costs for the remtter. Accordngly, t s advantageous to solve the earthwork secton dvson problem at a very early stage n order to support the tender or general constructor to make an optmal decson. The optmzaton results of these two optmzaton problems can be ntegrated n exstng computer-aded earthwork systems whch have been developed n prevous research efforts. Ths ncludes earthwork control systems (Askew et al., 2002, Km et al., 2003), earthwork modelng and smulaton systems (Chahrour 2007, J et al., 2009) and 4D vrtual road constructon frameworks (Söderström and Olofsson, 2007). 2 Earthwork allocaton problem In road constructon proects, cut and fll areas are tradtonally defned by ntersectng the road level wth the terran level vertcally (Fgure 1a). The quanttes of cut and fll areas can be calculated usng numercal methods, dependng on the natonal regulaton n cvl engneerng, such as the Gauß- Ellng-method appled n Germany (REB 1979). The mass haul dstance can be defned as Eucldean dstance between the centre ponts of cut and fll areas. Fgure 1. (a) Example of cut and fll areas n road constructon proect; (b) correspondng bpartte drected graph. To formulate the optmzaton problem, we defne G = (P, E) to denote a bpartte graph whch contans of a vertex set P and the edge set E. The set of vertces P s parttoned nto two dsont subsets U and V of P. The set U conssts of those vertces correspondng to cut areas and, analogously, the set V represents vertces correspondng to fll areas. For each vertex P, the parameter X denotes the amount of materal to be sent (f U ) or to be flled (f V ). We may assume that the total amount to be sent equals the total amount to be flled by ntroducng dump stes and borrow pts: A dump ste s used to dump earth materal due to materal overflow. A borrow pt provdes fllng materals whch have been bought n addton. A drected edge e s ntroduced for each par of vertces (,) where s a vertex correspondng to a cut area and s a vertex correspondng to a fll area. Each of these edges mrrors the possblty of sendng materal from a cut area to a fll area. Addtonally, each edge e has an assocated cost c whch represents the cost of transportng one mass unt of materal from to. A decson varable x s assgned to each of the drected edges n the set E. It denotes the quanttes of earth to be hauled from cut to fll followng the edge drecton (Fgure 1b). We can model the earthwork allocaton problem as a lnear programmng problem (cf. Fgure 2). We assume that the (known) transportaton cost along each edge (,) s non-negatve,.e., c 0. The obectve functon (1) s to mnmze the total transportaton cost. Due to the fact that n the real world only postve materal flows make sense, the decson varables x are restrcted to be non-negatve (see Constrant (4)). Constrant (2) mples that the total quantty of materal to be hauled from some cut area to all fll areas equals the total quantty of materal X provded by cut. Constrant (3) s smlar to (2) for the requrements n.
3 Fgure 2. Mathematcal formulaton of earthwork allocaton problem. Ths formulaton s a smplfed mnmal cost flow problem and can be solved effcently usng network flow algorthms (see Ahua, 1993). Havng solved the optmzaton model above, the amount of earth x to be moved from a cut area to a fll area, such that the overall transportaton cost s mnmal, s known (Fgure 1b). A real-world example wll be presented n Secton 4. 3 Earthwork secton dvson problem The earthwork secton dvson problem emerges when a large road constructon proect s dvded nto several separate earthwork sectons. The obectve of ths optmzaton problem s to obtan a reasonable dvson of the proect such that n each earthwork secton the quanttes of excavated materal and fllng materal are preferably balanced n order to avod nteractons between the sectons. As mentoned before, we propose a two-step optmzaton algorthm for ths problem. At frst we solve the earthwork allocaton problem n order to fnd a mnmal cost cut-to-fll assgnment. In the second step we dentfy the secton dvson havng the least necessary overall earth movement between dfferent earthwork sectons among all secton dvsons meetng the demands (such as desred number of earth sectons or maxmal length of a secton). Fgure 3. (a) Example of a feasble secton dvson wth three resultng earthwork sectons A = { p 1 = v 1, p 2 = u 1, p 3 = v 2 }, B = { p 4 = u 2, p 5 = v 3, p 6 = u 3 } and C = { p 7 = v 4, p 8 = u 4, p 9 = v 5 }. (b) Cut-to-fll assgnment matrx ( obtaned from solvng the earthwork allocaton problem optmally. x ) In order to be able to formulate ths problem, we consder the set P = U V together wth the ndex set I = { 1, K, n}, representng the possble postons for a secton dvson,.e., the cut and fll areas ordered accordng to ther actual appearance along the constructon proect. Hence, an earthwork secton ES from poston p to poston p conssts of all cuts and flls located n between: ES = { pk P : k }. The requred materal flow between poston p and poston p s exactly the value x kl obtaned from the earthwork allocaton problem, gven that p = uk s a cut and p = vl s a fll, and zero otherwse. An example of a secton dvson s llustrated n Fgure 3.
4 The earthwork secton dvson problem can be formulated as to fnd a feasble dvson of the proect nto earthwork sectons, such that the total materal flow between dfferent sectons s mnmal. Ths combnatoral optmzaton problem can be expressed by a bnary lnear program (BP) wth decson varablesb, representng the earthwork sectons, whch are nterpreted as follows: 1, f an earthwork secton begns at poston and ends at poston b = 0, else Obvously, not all possble combnatons of those varables correspond to a feasble earthwork secton dvson, e.g. t s not allowed to have gaps between the sectons, and dfferent sectons must not overlap. Therefore, we need a number of constrants makng sure that we obtan a soluton whch fulfls our requrements. Fgure 4: Mathematcal formulaton of earthwork secton dvson problem. In the followng we want to deduce the constrants appearng n our BP formulaton (n Fgure 4). As mentoned before, we do not want earthwork sectons to overlap. In partcular ths means that at each poston p, = 1, K, n, at most one secton can begn or end, whch s expressed by nequaltes (2) and (3). The specal cases to consder, namely the frst and last poston, where an earthwork secton has to begn and end, respectvely, are captured n constrant (4) and (5). Snce we want to cover the whole road proect wth our secton dvson, t s necessary that a new secton begns rght after a secton ends. Conversely, no secton can start at poston p + 1 wthout the precedng secton
5 endng at poston p, f we dsallow gaps. These propertes are guaranteed by condton (6) n our program, snce by (2) and (3) both of the sums n (6) can only admt the values zero or one. Observe that these constrants also prevent overlappng sectons. Hence, the aforementoned (n-)equaltes along wth the varable defnton (12) are suffcent to descrbe the feasble secton dvsons. Nevertheless, t may be useful to add several other constrants n order to avod trval solutons, such as the secton dvson only consstng of one secton. The addton of (7) and (8) wth user defned ntegers A max and Amn flters out all secton dvsons n whch the number of resultng earthwork sectons exceeds A max or s below A mn. Let d denote the actual dstance between postons p and p. Then n a smlar manner constrants (9) and (10) ensure that each earthwork secton has a mnmal length of D mn and a maxmal length of D max, where D mn and D max are user defned values. Optonally, the addton of condton (11) makes sure that all earthwork sectons nclude more than ust a sngle cut or fll area. As stated before, the obectve of our optmzaton problem s to fnd a secton dvson wth mnmal ntersectonal earth movement. Therefore t s straghtforward dea to defne the obectve functon value for a feasble dvson by smply summng up all materal flows between dfferent earthwork sectons. However, the materal flow between two non-adacent sectons also nfluences all ntermedate sectons and therefore should be especally punshed. Fgure 5. Cut-to-fll assgnment matrx ( x ) obtaned from the earthwork allocaton problem and matrx ( b ) represent the earthwork secton dvsons. (a) Soluton wth three earthwork sectons ES 1 = { p 1, p 2 }, ES 2 = { p 3, p 4, p 5, p 6 } and ES 3 = { p 7, p 8, p 9 }, represented byb 12 = b36 = b79 = 1, wth obectve value x 12 + x34 + x35 ; (b) soluton b 12 = b34 = b59 = 1 wth correspondng sectons ES 1 = { p 1, p 2 }, ES 2 = { p 3, p 4 } and ES 3 = { p 5, p 6, p 7, p 8, p 9 }, havng the better obectve value x 12. In our obectve functon (1), for each earthwork secton n the dvson ( b = 1) we add the 1 n term ( x kl + x lk ), whch expresses the sum of materal flows passng the startng poston p. By k= 1 l= dong so, we also count the materal to be transported beyond the endng poston of a secton, f
6 exstent, snce n a feasble dvson another secton has to begn n the subsequent poston. Consequently, a materal flow x kl s counted each tme t crosses the border of a secton. An example for feasble earthwork secton dvsons wth dfferent obectve value s presented n Fgure 5. 4 Real-world example A large federal hghway constructon proect has been planned to be constructed n Germany n the next year. The lnear constructon ste whch conssts of 41 cut and fll areas s about 20 klometers long. As we can see n the followng fgure, the cut and fll areas are dstrbuted along the entre proect constructon ste. Fgure 6. Part of vertcal algnment of the road constructon proect. The lst of earthwork quanttes correspondng to the cut and fll areas n Fgure 6 are presented n Table 1 of Fgure 7, as well as the optmal cut-to-fll assgnments resulted from solvng earthwork allocaton problem. Fgure 7.Part of earthwork quanttes and result of earthwork allocaton problem. The large road proect wll be tendered to 3 dfferent constructon companes, and each constructon secton must have a length of 4 klometers, at least. Ths earthwork secton dvson problem can be formulated and solved usng the bnary lnear program provded n ths paper. In Fgure 8, the optmal earthwork secton dvson regardng user gven parameters s llustrated. Fgure 8. Optmal earthwork secton dvsons: 3 earthwork secton, each secton at least 4 klometers long. Wth the ntegraton of the powerful open-source lnear and mx-nteger programmng solver (GLKP v.4.3, 2009) nto the earthwork assessment system ForBAU Integrator (J et al., 2009), the solutons of the two optmzaton problems can be found n acceptable runnng tme, e.g. for dvdng 41 earthwork areas, the solver computes the optmal soluton wthn 3 seconds on a common machne.
7 5 Concluson and future research Ths paper ntroduces two maor problems arsng n optmzng earthwork processes: fndng the most cost-effcent cut-to-fll-assgnments (earthwork allocaton problem) and dvdng a large earthwork proect nto sectons wth mnmal nter-sectonal materal flows (earthwork secton dvson problem). Ths paper also presents the mathematcal formulaton and soluton model of these two problems usng (bnary) lnear programmng technque. The ntroduced models and ther solutons are appled n a real-world constructon proect, a hghway constructon ste n Germany, to enhance the productvty n constructon proect. In future research, we am at solvng two further optmzaton problems focusng on mnmzng earth transport equpments and the proect duraton: Wth a gven number of transporters, what s the mnmal earthwork duraton? To the gven earthwork duraton, what s the mnmal number of transporters requred to execute all transportaton wthn the prescrbed duraton? 6 Acknowledgements The research work presented n ths paper was carred out wthn the ForBAU proect (Borrmann et al., 2009) whch s funded by the Bavaran Research Foundaton (Bayersche Forschungsstftung). We also gratefully acknowledge partal fnancal support by DFG Graduertenkolleg 753 Mathematk und Praxs. 7 References AHUJA, R.K., MAGNANTI, T.L., ORLIN, J.B., Network Flows. Prentce Hall, Inc. ASKEW, W.H., AL-JIBOURI, S.H., MAWDESLEY, M.J., PATTERSON, D.E., Plannng Lnear Constructon Proects: Automated Method for the Generaton of Earthwork Actvtes. Automaton n Constructon, 11( ). BORRMANN, A., JI, Y., WU, I-C., OBERGRIESSER, M., RANK, E., KLAUBERT, W., GÜNTHNER W., ForBAU - The Vrtual Constructon Ste Proect. In: The 26th CIB-W78 Conference on Managng IT n Constructon, 2009, Istanbul, Turkey. CHAHROUR, R., Integraton von CAD und Smulaton auf Bass von Produktmodellen m Erdbau. Kassel Unversty Press GmbH, Kassel. EASA, M.S., Earthwork Allocatons wth Non-constant Unt Costs. Journal of Constructon Engneerng and Management, 113(1). EASA, M.S., Earthwork Allocatons wth Lnear Unt Costs. Journal of Constructon Engneerng and Management, 114(4). GLPK, GNU Lnear Programmng Kt, v4.3. Avalable onlne: Last accessed Jan JAYAWARDANA, A.K.W., HARRIS, F.C., Further Development of Integer Programmng n Earthwork Optmzaton. Journal of Constructon Engneerng and Management, 116(1). JI, Y., BORRMANN, A., RANK, E., WIMMER J., GÜNTHNER W., An Integrated 3D Smulaton Framework for Earthwork Processes. In: The 26th CIB-W78 Conference on Managng IT n Constructon, 2009, Istanbul, Turkey. KIM, S-K., RUSSEL, J.S., Framework for an Intellgent Earthwork System Part II. Task dentfcaton/schedulng and resource allocaton methodology. Automaton n Constructon, 12(15-27). REB, Massenberechnung aus Querproflen (Ellng). In: REB-Verfahrensbeschrebung, STARK, R., MAYER, R., Quanttatve Constructon Management: Uses of Lnear Optmzaton. John Wley and Sons, Inc. New York, U.S.A. SON, J., MATTILA, K.G., MYER D.S., Determnaton of Haul Dstance and Drecton n Mass Excavaton. Journal of Constructon Engneerng and Management, 131(3). SÖDERSTRÖM, P., OLOFSSON, T., Vrtual Road Constructon - A Conceptual Model. In: The 24th CIB-W78 Conference, 2007,Marbor, Slovenen.
Simultaneous 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 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 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 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 informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
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 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
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 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 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 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 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 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 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 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 informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
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 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 informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
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 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 information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
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 informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationThe 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 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 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 informationEn Route Traffic Optimization to Reduce Environmental Impact
En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
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 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 informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
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 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 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 informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
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 informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
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 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 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 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 informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
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 informationp 1 c 2 + p 2 c 2 + p 3 c p m c 2
Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance
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 informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationAn Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors
An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,
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 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 informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
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 information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationCombining Constraint Programming and Integer Programming
Combnng Constrant Programmng and Integer Programmng GLOBAL CONSTRAINT OPTIMIZATION COMPONENT Specal Purpose Algorthm mn c T x +(x- 0 ) x( + ()) =1 x( - ()) =1 FILTERING ALGORITHM COST-BASED FILTERING ALGORITHM
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 informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationAn Effective Modification to Solve Transportation Problems: A Cost Minimization Approach
Annals of Pure and Appled Mathematcs Vol. 6, No. 2, 204, 99-206 ISSN: 2279-087X (P), 2279-0888(onlne) Publshed on 4 August 204 www.researchmathsc.org Annals of An Effectve Modfcaton to Solve Transportaton
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 informationMixed-integer vertex covers on bipartite graphs
Mxed-nteger vertex covers on bpartte graphs Mchele Confort, Bert Gerards, Gacomo Zambell November, 2006 Abstract Let A be the edge-node ncdence matrx of a bpartte graph G = (U, V ; E), I be a subset the
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationInternational Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN
Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
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 informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
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 informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More information