The Traffic Network Equilibrium Model: Its History and Relationship to the Kuhn-Tucker Conditions. David Boyce
|
|
- Anis Lang
- 5 years ago
- Views:
Transcription
1 The Traffic Networ Equilibrium Model: Its History and Relationship to the Kuhn-Tucer Conditions David Boyce University of Illinois at Chicago, and Northwestern University 54 th Annual North American Meetings Regional Science Association International Savannah, November 8, 27 1
2 2
3 Dramatis Personae, Harold Kuhn, 1925, born in California Ph.D. in Mathematics, Princeton University, 195 Lecturer in Mathematics, Princeton University, Professor of Mathematics, Princeton University, Albert Tucer, , born in Ontario, Canada Ph.D. in Mathematics, Princeton University, 1932 Professor of Mathematics, Princeton University,
4 Harold Kuhn, 1925-, USA Albert Tucer, , Canada 4
5 Importance of the Kuhn-Tucer Theorem Although the origins of constrained optimization are comple, etending bac to the formulation of Lagrange, Kuhn and Tucer (1951) Nonlinear Programming, decisively introduced this technique to economics, as well as operations research and fields of engineering, following WW II when the time was ripe for such methods; Kjeldsen (2) authored a fascinating historical account in Historia Mathematica; Taayama (1985) wrote in the Introduction to his tet, Mathematical Economics: nonlinear programming theory is probably the most important mathematical technique in modern economic theory. 5
6 Dramatis Personae, Martin Becmann, 1924, born in Germany Doctorate, Economics, University of Freiburg, Germany, 195 Research Associate, Cowles Commission, C. Bartlett McGuire, , born in Minnesota A. M., Economics, University of Chicago, 1952 Research Associate, Cowles Commission, Christopher B. Winsten, , born in England B. A., University of Cambridge, UK Research Associate, Cowles Commission, Tjalling C. Koopmans, , born in Netherlands Doctorate, Economics, University of Leiden, Netherlands, 1936 Research Director, Cowles Commission for Research in Economics, and Professor, University of Chicago, Later, Co-Recipient Nobel Prize in Economic Sciences in
7 Martin Becmann, 1924-, Germany 7
8 Bartlett McGuire, , USA 8
9 Christopher Winsten, , England 9
10 Tjalling Koopmans, , Netherlands 1
11 A Study of the Allocation of Resources During , the Cowles Commission for Research in Economics was the leading academic research center in mathematical economics and applications of mathematical programming to a broad range of problems in economics. Research was initiated in 1951 with support of the Rand Corporation on the Theory of Resources Allocation, with applications to transportation, location and population dispersal problems. Rand s main interest was railway capacity analysis, perhaps motivated by a desire to estimate the capacity of the USSR railway system. The research team wored on the application of activity analysis to transportation and location problems. A study of efficiency in road networs led to the discovery of 11 traffic networ equilibrium.
12 Becmann s Pioneering Achievement Represented a road networ with general lin cost functions and node conservation of flow constraints; Proposed a complementarity relationship for shortest route choices from an origin to a destination: if a route flow is positive, then its route cost must be a minimum, and if a route cost is not a minimum, its route flow must be zero (cf. Wardrop, 1952); Defined the general properties of a model of origindestination flow (demand) as a function of endogenously determined user-equilibrium route costs; Formulated a concave optimization problem whose solution incorporated both demand and route choice; Analyzed the properties of this formulation and the 12 related formulation for efficiency on road networs.
13 Significance of the Results Becmann was evidently the first economist to use the Kuhn- Tucer (1951) conditions as the basis for formulating an entirely new problem in economics; His formulation had major practical consequences: urban travel forecasting for road planning around the world; road pricing policy and design of congestion toll systems; Becmann may also have been the first to use the Kuhn-Tucer conditions to formulate a large-scale optimization problem in any field of engineering, maing a seminal contribution to the emerging field of operations research as well as engineering in general. 13
14 Objectives of This Tal Offer conjectures and insights into how Becmann achieved his result, described in Chapter 3 and 4, Studies in the Economics of Transportation; First, I review the Kuhn-Tucer (K-T) conditions; Then, I show how Becmann may have applied them to formulate his model. 14
15 Find The Kuhn-Tucer Conditions that maimizes ( ) g constrained by: f h ( ) h 1,..., m, = and. For to be a solution to the maimum problem, it is necessary that and someu satisfy conditions (1) and (2), and a certain constraint qualification: g m ( ) f ( ) i + h= 1 u h h i, i = 1,... n f h ( ), h = 1,... m (1) i g m ( ) f ( ) i + h= 1 u h h i =, i = 1,... n (2) u h [ ( )] f h =, h = 1,... m u 15
16 Setting up the Optimization Problem - 1 Let ( ) denote a directed lin connecting node i to node j, denotes the flow on lin ( ) terminating at node ; = ji = (, + j ) denotes the total flow on lin ( ) y ji y = denotes the cost of travel on lin ( ) (nondirectional) The definitions of lin flow and lin cost pertain to two-way roads. Node conservation of flow (based on Kirchhoff s Law): Let = ( ) i, j j, = j + j j, be the total flow from node i to node ; Or, flow out of node i = flow into node i + flow originating at node i 16
17 Setting up the Optimization Problem - 2 Choice of shortest routes (or least-cost route): If y i, is the least cost from node i to node, then y y + y j,, for all j. For every ( ) there is a unique value y i, such that y y j, y, with the equality holding for some j. Assuming travelers use shortest routes: if, >, then y y j, = y, and if y y j, < y, then, =, Therefore, ( y y y ) for all nodes j, and all node pairs., j, = For each pair ( ), then, all used routes have minimal and equal costs. Capacity or Lin Performance Function y = h be the capacity function, which is non-decreasing; Let ( ) where y is the travel cost on lin ( ) eperienced by each traveler. 17
18 Fied Demand Model Formulation Consider the following cost minimization problem: ma, s.t. 1 2 h ( ) (total cost of flow) ( ), j f, all ( ) (node conservation of flow) j where ( + ), for all ( ),, j and f i, is the fied flow from node i to node Define an auiliary function, now nown as the Lagrangean function: ( ) 1 ( ) ( ) L,, λ = h + λi ji f 2,,, j 18
19 If h ( ) (1) h ( ), we obtain the following K-T optimality conditions:,, [ h ( ) h ( ) + λ λ ] [ ( h ( ) h ( ) + λ λ )] j, j, = (2) λ, (, j ) j (, j ) j f f =, λ, The standard K-T interpretation follows: 1) if, >, λ, for all ( ) then = h ( ) + h ( ) 2) if, =, i, λ j, then h ( ) + h ( ) i, λ j, λ, for all ( ) λ as the cost of travel from node i to node j. where ( ) i, λ j, 19
20 This result shows an additional charge, or efficiency toll, must be placed on lin ( ) for the total cost of travel to minimized. Suppose we want the lin flows and costs without such tolls? This question must have confronted Becmann. To remove the unwanted term, he altered the objective function: ma, h ( ) d (, j ) fi, all ( ) j 1 2 s.t., where ( + ), all ( i j), j Defining the objective function as the integral over the lin flows yields the standard user-equilibrium result: 1) if, >, then = h ( ) 2) if, =, λ, for all ( ) i, λ j, then h ( ) i, λ j, λ, for all ( ) 2
21 Variable Demand Formulation Becmann also assumed variable origin-destination flow (demand) depends upon shortest route costs: = f ( y ): flow from i to is a function of the shortest route cost y, and independent of all other flows. For his formulation, Becmann needed the inverse demand function, which he stated as: y = g ( ), assumed to be strictly decreasing i To epand the fied demand formulation to include variable demand, we add the integral of the inverse demand function to the objective function, and change the node conservation of flows constraints to variable demand. ma (, ) i,, g 1 ( ) d h ( ) (, j ) i, all ( ) j i, s.t., 2 where +, all ( i j), j d 21
22 The corresponding K-T optimality conditions are: (1), [ g ( ) ] λi, [ g ( ) ] λi, = [ h ( ) + ] λi, λ j, ( h ( ) + λ λ ) [ ] ;, j, (2) = λ λ,, ( ), j j ( ), j j f f = From these K-T conditions, we have the following interpretations: 1) if >, 2) if =, λ, for all ( ), λ, for all ( ) ;,, for all (, ) j, j,, for all (, ) then = g ( ) = y then g ( ) = y, > then g ( ) ( ) ( ) i g j, j, = h then g ( ) g ( ) h ( ) 3) if, 4) if, =, 22
23 Conclusions The Kuhn-Tucer conditions were the basis for Becmann s formulation, including the representation of the user-equilibrium route choice conditions. The only prior application of the K-T conditions in economics found so far was by Dorfman (1951), who proved a nown result in a new way. One ey to Becmann s formulation was representing the shortest route assumption in the optimality conditions as a complementarity relationship. Then, he formulated an equivalent, or artificial, objective function that generated the desired results. 23
24 Later formulations of the problem changed to the lin-route representation of conservation of flow (Patrisson, 1994). Although this representation may be more intuitive, some insights may be lost. Similar formations involving the integral of a function are found in economics, and perhaps in theoretical mechanics, as Becmann hinted. Consumers surplus, discussed in Chapter 4, could be viewed in the same way, although a plausible interpretation is available. In such cases an interpretation of the objective function may not be possible, or it may need to be interpreted in a more comple framewor. An eample is the representative traveler interpretation proposed by Oppenheim (1995). 24
The negation of the Braess paradox as demand increases: The wisdom of crowds in transportation networks
The negation of the Braess paradox as demand increases: The wisdom of crowds in transportation networks nna Nagurney 1 1 University of Massachusetts mherst, Massachusetts 01003 PCS PCS PCS 87.23.Ge Dynamics
More informationCHAPTER 1-2: SHADOW PRICES
Essential Microeconomics -- CHAPTER -: SHADOW PRICES An intuitive approach: profit maimizing firm with a fied supply of an input Shadow prices 5 Concave maimization problem 7 Constraint qualifications
More informationForecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models 1
TRISTAN V : The Fifth Triennial Symposium on Transportation Analysis 1 Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models 1 David Boyce Department
More informationOIM 413 Logistics and Transportation Lecture 8: Tolls
OIM 413 Logistics and Transportation Lecture 8: Tolls Professor Anna Nagurney John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Department of Operations & Information Management
More informationCombined Trip Distribution and Assignment Model Incorporating Captive Travel Behavior
70 TRANSPORTATION RESEARCH RECORD 1285 Combined Trip Distribution and Assignment Model Incorporating Captive Travel Behavior You-LIAN Cttu Most of the previous literature on combined trip distribution
More informationLecture 19: Common property resources
Lecture 19: Common property resources Economics 336 Economics 336 (Toronto) Lecture 19: Common property resources 1 / 19 Introduction Common property resource: A resource for which no agent has full property
More informationViable and Sustainable Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Viable and Sustainable Transportation Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Viability and Sustainability In this lecture, the fundamental
More informationOD-Matrix Estimation using Stable Dynamic Model
OD-Matrix Estimation using Stable Dynamic Model Yuriy Dorn (Junior researcher) State University Higher School of Economics and PreMoLab MIPT Alexander Gasnikov State University Higher School of Economics
More informationThe General Multimodal Network Equilibrium Problem with Elastic Balanced Demand
The General Multimodal Network Equilibrium Problem with Elastic Balanced Demand Natalia Shamray 1 Institution of Automation and Control Processes, 5, Radio st., Vladivostok, Russia, http://www.iacp.dvo.ru
More informationSTATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY
STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY UNIVERSITY OF MARYLAND: ECON 600 1. Some Eamples 1 A general problem that arises countless times in economics takes the form: (Verbally):
More informationYu (Marco) Nie. Appointment Northwestern University Assistant Professor, Department of Civil and Environmental Engineering, Fall present.
Yu (Marco) Nie A328 Technological Institute Civil and Environmental Engineering 2145 Sheridan Road, Evanston, IL 60202-3129 Phone: (847) 467-0502 Fax: (847) 491-4011 Email: y-nie@northwestern.edu Appointment
More informationChanges in the Spatial Distribution of Mobile Source Emissions due to the Interactions between Land-use and Regional Transportation Systems
Changes in the Spatial Distribution of Mobile Source Emissions due to the Interactions between Land-use and Regional Transportation Systems A Framework for Analysis Urban Transportation Center University
More informationOIM 413 Logistics and Transportation Lecture 5: The System-Optimized (S-O) Problem
OIM 413 Logistics and Transportation Lecture 5: The System-Optimized (S-O) Problem Professor Anna Nagurney John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Department of Operations
More informationTopic 2: Algorithms. Professor Anna Nagurney
Topic 2: Algorithms John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Isenberg School of Management University of Massachusetts Amherst, Massachusetts 01003 SCH-MGMT 825 Management
More informationMS&E 246: Lecture 18 Network routing. Ramesh Johari
MS&E 246: Lecture 18 Network routing Ramesh Johari Network routing Last lecture: a model where N is finite Now: assume N is very large Formally: Represent the set of users as a continuous interval, [0,
More informationConvex Optimization Overview (cnt d)
Conve Optimization Overview (cnt d) Chuong B. Do November 29, 2009 During last week s section, we began our study of conve optimization, the study of mathematical optimization problems of the form, minimize
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland EC720.01 - Math for Economists Boston College, Department of Economics Fall 2010 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationPublication List PAPERS IN REFEREED JOURNALS. Submitted for publication
Publication List YU (MARCO) NIE SEPTEMBER 2010 Department of Civil and Environmental Engineering Phone: (847) 467-0502 2145 Sheridan Road, A328 Technological Institute Fax: (847) 491-4011 Northwestern
More informationA Paradox on Traffic Networks
A Paradox on Traffic Networks Dietrich Braess Bochum Historical remarks. The detection of the paradox is also counterintuitive Is the mathematical paradox consistent with the psychological behavior of
More informationReturns to Scale in Networks. Marvin Kraus * June Keywords: Networks, congestion, returns to scale, congestion pricing
Returns to Scale in Networks by Marvin Kraus * June 2006 Keywords: Networks, congestion, returns to scale, congestion pricing * Department of Economics, Boston College, Chestnut Hill, MA 02467, USA. E-mail:
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland ECON 77200 - Math for Economists Boston College, Department of Economics Fall 207 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationSimulation on a partitioned urban network: an approach based on a network fundamental diagram
The Sustainable City IX, Vol. 2 957 Simulation on a partitioned urban network: an approach based on a network fundamental diagram A. Briganti, G. Musolino & A. Vitetta DIIES Dipartimento di ingegneria
More informationThe discrete-time second-best day-to-day dynamic pricing scheme
The discrete-time second-best day-to-day dynamic pricing scheme Linghui Han, David Z.W. Wang & Chengjuan Zhu 25-07-2017 School of Civil & Environmental Engineering Nanyang Technological University, Singapore
More informationApplications of Dynamic Pricing in Day-to-Day Equilibrium Models
Applications of Dynamic Pricing in Day-to-Day Equilibrium Models Tarun Rambha Graduate Research Assistant The University of Texas at Austin Department of Civil, Architectural, and Environmental Engineering
More informationtransportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study explored
ABSTRACT: Demand supply system are the three core clusters of transportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study
More informationLagrangian road pricing
Lagrangian road pricing Vianney Boeuf 1, Sébastien Blandin 2 1 École polytechnique Paristech, France 2 IBM Research Collaboratory, Singapore vianney.boeuf@polytechnique.edu, sblandin@sg.ibm.com Keywords:
More informationMetrolinx Transit Accessibility/Connectivity Toolkit
Metrolinx Transit Accessibility/Connectivity Toolkit Christopher Livett, MSc Transportation Planning Analyst Research and Planning Analytics Tweet about this presentation #TransitGIS OUTLINE 1. Who is
More informationOIM 413 Logistics and Transportation Lecture 7: Basic Sensitivity Analysis and the Braess Paradox
OIM 413 Logistics and Transportation Lecture 7: Basic Sensitivity Analysis and the Braess Paradox Professor Anna Nagurney John F. Smith Memorial Professor and Director Virtual Center for Supernetworks
More informationLecture 3 Cost Structure
Lecture 3 Dr. Anna Nagurney John F. Smith Memorial Professor Isenberg School of Management University of Massachusetts Amherst, Massachusetts 01003 c 2009 Cost is a disutility - Cost is a function of travel
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationBeginning to Enjoy the Outside View A Glance at Transit Forecasting Uncertainty & Accuracy Using the Transit Forecasting Accuracy Database
Beginning to Enjoy the Outside View A Glance at Transit Forecasting Uncertainty & Accuracy Using the Transit Forecasting Accuracy Database presented by David Schmitt, AICP with very special thanks to Hongbo
More informationNetwork Equilibrium. Professor Anna Nagurney
Network Equilibrium John F. Smith Memorial Professor Director Virtual Center for Supernetworks Isenberg School of Management University of Massachusetts Amherst Lancaster University, England, Spring 2018
More informationEmission Paradoxes in Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Emission Paradoxes in Transportation Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Introduction In this lecture, I identify several distinct
More informationAteneo de Manila, Philippines
Ideal Flow Based on Random Walk on Directed Graph Ateneo de Manila, Philippines Background Problem: how the traffic flow in a network should ideally be distributed? Current technique: use Wardrop s Principle:
More informationECONOMIC OPTIMALITY. Date: October 10, 2005.
ECONOMIC OPTIMALITY 1. FORMAL STATEMENT OF THE DECISION PROBLEM 1.1. Statement of the problem. ma h(, a) (1) such that G(a) This says that the problem is to maimize the function h which depends on and
More informationLecture 10 The Extended Model
Lecture 10 The Extended Model Dr. Anna Nagurney John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Isenberg School of Management University of Massachusetts Amherst, Massachusetts
More informationLeon Moses and Walter Isard: Collaborators, Rivals or Antagonists?
Leon Moses and Walter Isard: Collaborators, Rivals or Antagonists? David Boyce Archivist, Regional Science Association International Program Chair or Co-Chair, North American Regional Science Meetings,
More informationHandbook of Computational Econometrics David Belsley and Erricos Kontoghiorghes, Editors, John Wiley & Sons, Chichester, UK, 2009, pp
Network Economics Anna Nagurney John F. Smith Memorial Professor Department of Finance and Operations Management Isenberg School of Management University of Massachusetts Amherst, Massachusetts 01003 Handbook
More informationTradable Permits for System-Optimized Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Tradable Permits for System-Optimized Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Introduction In this lecture, I return to the policy mechanism
More informationMS&E 246: Lecture 17 Network routing. Ramesh Johari
MS&E 246: Lecture 17 Network routing Ramesh Johari Network routing Basic definitions Wardrop equilibrium Braess paradox Implications Network routing N users travel across a network Transportation Internet
More informationCHAPTER 3: OPTIMIZATION
John Riley 8 February 7 CHAPTER 3: OPTIMIZATION 3. TWO VARIABLES 8 Second Order Conditions Implicit Function Theorem 3. UNCONSTRAINED OPTIMIZATION 4 Necessary and Sufficient Conditions 3.3 CONSTRAINED
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course otes for EE7C (Spring 018): Conve Optimization and Approimation Instructor: Moritz Hardt Email: hardt+ee7c@berkeley.edu Graduate Instructor: Ma Simchowitz Email: msimchow+ee7c@berkeley.edu October
More informationUsing Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games
Using Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games Farhad Farokhi, and Karl H. Johansson Department of Electrical and Electronic Engineering, University of Melbourne ACCESS Linnaeus
More informationCONGESTION TOLLING AND URBAN SPATIAL STRUCTURE. Richard Arnott. Department of Economics. Boston College. Chestnut Hill, MA U.S.A.
CONGESTION TOLLING AND URBAN SPATIAL STRUCTURE Richard Arnott Department of Economics Boston College Chestnut Hill, MA 02167 U.S.A. Acknowledgments: The author would like to thank the editors and referees
More informationAPPENDIX IV MODELLING
APPENDIX IV MODELLING Kingston Transportation Master Plan Final Report, July 2004 Appendix IV: Modelling i TABLE OF CONTENTS Page 1.0 INTRODUCTION... 1 2.0 OBJECTIVE... 1 3.0 URBAN TRANSPORTATION MODELLING
More informationMicroeconomic Algorithms for Flow Control in Virtual Circuit Networks (Subset in Infocom 1989)
Microeconomic Algorithms for Flow Control in Virtual Circuit Networks (Subset in Infocom 1989) September 13th, 1995 Donald Ferguson*,** Christos Nikolaou* Yechiam Yemini** *IBM T.J. Watson Research Center
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 1: Introduction Prof. John Gunnar Carlsson September 8, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 8, 2010 1 / 35 Administrivia
More informationA Model of Traffic Congestion, Housing Prices and Compensating Wage Differentials
A Model of Traffic Congestion, Housing Prices and Compensating Wage Differentials Thomas F. Rutherford Institute on Computational Economics (ICE05) University of Chicago / Argonne National Laboratory Meeting
More informationAn artificial neural networks (ANNs) model is a functional abstraction of the
CHAPER 3 3. Introduction An artificial neural networs (ANNs) model is a functional abstraction of the biological neural structures of the central nervous system. hey are composed of many simple and highly
More informationRANDOM SIMULATIONS OF BRAESS S PARADOX
RANDOM SIMULATIONS OF BRAESS S PARADOX PETER CHOTRAS APPROVED: Dr. Dieter Armbruster, Director........................................................ Dr. Nicolas Lanchier, Second Committee Member......................................
More information1 of 6. Curriculum Vitae
1 of 6 February 22, 2004 Curriculum Vitae Name: Ralph M. Braid Office Address: Department of Economics, Wayne State University, Detroit, MI 48202 Work Telephone: (313)5772540 Work FAX: (313)5779564 Work
More informationOD-matrix Estimation Based on a Dual Formulation of Traffic Assignment Problem
Informatica 4 (216) 393 398 393 OD-matrix Estimation Based on a Dual Formulation of Traffic Assignment Problem Alexander Yu. Krylatov, Anastasiia P. Shirokolobova and Victor V. Zakharov Saint Petersburg
More informationOn the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users Dimitris Fotakis, George Karakostas, and Stavros G. Kolliopoulos No Institute Given Abstract. We consider network
More informationAnalysis and Design of Urban Transportation Network for Pyi Gyi Ta Gon Township PHOO PWINT ZAN 1, DR. NILAR AYE 2
www.semargroup.org, www.ijsetr.com ISSN 2319-8885 Vol.03,Issue.10 May-2014, Pages:2058-2063 Analysis and Design of Urban Transportation Network for Pyi Gyi Ta Gon Township PHOO PWINT ZAN 1, DR. NILAR AYE
More informationDecentralisation and its efficiency implications in suburban public transport
Decentralisation and its efficiency implications in suburban public transport Daniel Hörcher 1, Woubit Seifu 2, Bruno De Borger 2, and Daniel J. Graham 1 1 Imperial College London. South Kensington Campus,
More informationA Framework for Dynamic O-D Matrices for Multimodal transportation: an Agent-Based Model approach
A Framework for Dynamic O-D Matrices for Multimodal transportation: an Agent-Based Model approach Nuno Monteiro - FEP, Portugal - 120414020@fep.up.pt Rosaldo Rossetti - FEUP, Portugal - rossetti@fe.up.pt
More informationOptimizing Urban Modeling based on Road Network and Land Use/Cover Changes by Using Agent Base Cellular Automata Model
Optimizing Urban Modeling based on Road Network and Land Use/Cover Changes by Using Agent Base Cellular Automata Model Yousef Khajavigodellou 1, A. A. Alesheikh 2, Farshad Hakimpour 3, Kamra Chapi 4 1
More informationUsing Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games
Using Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games Farhad Farohi and Karl Henri Johansson Abstract We consider repeated routing games with piecewiseconstant congestion taxing in
More informationFor general queries, contact
PART I INTRODUCTION LECTURE Noncooperative Games This lecture uses several examples to introduce the key principles of noncooperative game theory Elements of a Game Cooperative vs Noncooperative Games:
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1080.0658ec e-companion ONLY AVAILABLE IN ELECTRONIC FORM informs 2009 INFORMS Electronic Companion Test Instances for the Multicommodity Flow Problem: An Erratum by
More informationContributions to the logit assignment model
Fabien Leurent To cite this version: Fabien Leurent. Contributions to the logit assignment model. Transportation Research Record, 2005, Vol. 1493, pp. 207-212. HAL Id: hal-00348417 https://hal.archives-ouvertes.fr/hal-00348417
More informationReview of Optimization Basics
Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:
More informationA General Equilibrium Model for Transportation Systems with e-hailing Services and Flow Congestion
A General Equilibrium Model for Transportation Systems with e-hailing Services and Flow Congestion Xuegang (Jeff) Ban Maged Dessouy Jong-Shi Pang Rong Fan September 23, 2018 Abstract Passengers are increasingly
More informationTraffic Demand Forecast
Chapter 5 Traffic Demand Forecast One of the important objectives of traffic demand forecast in a transportation master plan study is to examine the concepts and policies in proposed plans by numerically
More informationTravel Time Calculation With GIS in Rail Station Location Optimization
Travel Time Calculation With GIS in Rail Station Location Optimization Topic Scope: Transit II: Bus and Rail Stop Information and Analysis Paper: # UC8 by Sutapa Samanta Doctoral Student Department of
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationFinal Report Building Our Way Out Of Congestion
Final Report 2002-01 Building Our Way Out Of Congestion 1. Report No. 2. 3. Recipients Accession No. MN/RC 2002-01 4. Title and Subtitle 5. Report Date BUILDING OUR WAY OUT OF CONGESTION? HIGHWAY CAPACITY
More informationAGlimpseofAGT: Selfish Routing
AGlimpseofAGT: Selfish Routing Guido Schäfer CWI Amsterdam / VU University Amsterdam g.schaefer@cwi.nl Course: Combinatorial Optimization VU University Amsterdam March 12 & 14, 2013 Motivation Situations
More informationDeparture time choice equilibrium problem with partial implementation of congestion pricing
Departure time choice equilibrium problem with partial implementation of congestion pricing Tokyo Institute of Technology Postdoctoral researcher Katsuya Sakai 1 Contents 1. Introduction 2. Method/Tool
More informationDynamic Electric Power Supply Chains and Transportation Networks: an Evolutionary Variational Inequality Formulation
Dynamic Electric Power Supply Chains and Transportation Networks: an Evolutionary Variational Inequality Formulation (To appear in Transportation Research E) Anna Nagurney Radcliffe Institute for Advanced
More informationFirst-Best Dynamic Assignment of Commuters with Endogenous Heterogeneities in a Corridor Network
First-Best Dynamic Assignment of Commuters with Endogenous Heterogeneities in a Corridor Network ISTTT 22@Northwestern University Minoru Osawa, Haoran Fu, Takashi Akamatsu Tohoku University July 24, 2017
More informationSide Constrained Traffic Equilibrium Models Analysis, Computation and Applications
Side Constrained Traffic Equilibrium Models Analysis, Computation and Applications Torbjörn Larsson Division of Optimization Department of Mathematics Linköping Institute of Technology S-581 83 Linköping
More informationUniversity of California, Davis Department of Agricultural and Resource Economics ARE 252 Lecture Notes 2 Quirino Paris
University of California, Davis Department of Agricultural and Resource Economics ARE 5 Lecture Notes Quirino Paris Karush-Kuhn-Tucker conditions................................................. page Specification
More informationExponential Disutility Functions in Transportation Problems: A New Theoretical Justification
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 1-1-2007 Exponential Disutility Functions in Transportation Problems: A New Theoretical
More informationSpecified Issue. Pic3. Spring 2015
Pic3 12 Pic1 11 Pic6 Pic2 10 Pic5 performance since structured streets and important buildings surround it. According to the distance index, the tissue is not too dense, while high-rise buildings are observed.
More informationEfficiency and Braess Paradox under Pricing
Efficiency and Braess Paradox under Pricing Asuman Ozdaglar Joint work with Xin Huang, [EECS, MIT], Daron Acemoglu [Economics, MIT] October, 2004 Electrical Engineering and Computer Science Dept. Massachusetts
More informationPrice Competition with Elastic Traffic
Price Competition with Elastic Traffic Asuman Ozdaglar Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology August 7, 2006 Abstract In this paper, we present
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationNetwork Equilibrium Models: Varied and Ambitious
Network Equilibrium Models: Varied and Ambitious Michael Florian Center for Research on Transportation University of Montreal INFORMS, November 2005 1 The applications of network equilibrium models are
More informationA Short Proof of the VPN Tree Routing Conjecture on Ring Networks
A Short Proof of the VPN Tree Routing Conjecture on Ring Networs Fabrizio Grandoni Voler Kaibel Gianpaolo Oriolo Martin Sutella January 15, 008 Abstract Only recently, Hurens, Keijsper, and Stougie proved
More informationDoing Good with Spam is Hard
Doing Good with Spam is Hard Martin Hoefer, Lars Olbrich, and Aleander Skopalik Department of Computer Science, RWTH Aachen University, Germany Abstract. We study economic means to improve network performance
More informationOctober 2007; revised April 2008 International Transactions in Operational Research (2009) 16, pp
A Relative Total Cost Index for the Evaluation of Transportation Network Robustness in the Presence of Degradable Links and Alternative Travel Behavior Anna Nagurney and Qiang Qiang Department of Finance
More informationAlgorithmic Game Theory. Alexander Skopalik
Algorithmic Game Theory Alexander Skopalik Today Course Mechanics & Overview Introduction into game theory and some examples Chapter 1: Selfish routing Alexander Skopalik Skopalik@mail.uni-paderborn.de
More informationConcave programming. Concave programming is another special case of the general constrained optimization. subject to g(x) 0
1 Introduction Concave programming Concave programming is another special case of the general constrained optimization problem max f(x) subject to g(x) 0 in which the objective function f is concave and
More informationBEFORE THE PUBLIC UTILITIES COMMISSION OF THE STATE OF COLORADO * * * * *
BEFORE THE PUBLIC UTILITIES COMMISSION OF THE STATE OF COLORADO * * * * * IN THE MATTER OF THE APPLICATION OF PUBLIC SERVICE COMPANY OF COLORADO FOR APPROVAL OF ITS 01 RENEWABLE ENERGY STANDARD COMPLIANCE
More informationEQUILIBRATION OF TRAVEL DEMAND AND SYSTEM PERFORMANCE: AN APPLICATION IN A TRANSPORTATION CORRIDOR 1
CHAPTER 8 EQUILIBRATION OF TRAVEL DEMAND AND SYSTEM PERFORMANCE: AN APPLICATION IN A TRANSPORTATION CORRIDOR 1 Introduction Equilibration of travel demand and system performance has traditionally been
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationCipra D. Revised Submittal 1
Cipra D. Revised Submittal 1 Enhancing MPO Travel Models with Statewide Model Inputs: An Application from Wisconsin David Cipra, PhD * Wisconsin Department of Transportation PO Box 7913 Madison, Wisconsin
More informationTopic 5: Oligopolies and Game Theory
Topic 5: Oligopolies and Game Theory John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Isenberg School of Management University of Massachusetts Amherst, Massachusetts 01003
More informationStudy of Causal Relationships in Macroeconomics
Study of Causal Relationships in Macroeconomics Contributions of Thomas Sargent and Christopher Sims, Nobel Laureates in Economics 2011. 1 1. Personal Background Thomas J. Sargent: PhD Harvard University
More informationEconomic Foundations of Symmetric Programming
Economic Foundations of Symmetric Programming QUIRINO PARIS University of California, Davis B 374309 CAMBRIDGE UNIVERSITY PRESS Foreword by Michael R. Caputo Preface page xv xvii 1 Introduction 1 Duality,
More informationSolution of Multivariable Optimization with Inequality Constraints by Lagrange Multipliers. where, x=[x 1 x 2. x n] T
Solution of Multivariable Optiization with Inequality Constraints by Lagrange Multipliers Consider this proble: Miniize f where, =[. n] T subect to, g,, The g functions are labeled inequality constraints.
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationTransportation Network Equilibrium Reformulations of Electric Power Supply Chain Networks with Computations
Transportation Network Equilibrium Reformulations of Electric Power Supply Chain Networks with Computations Anna Nagurney Radcliffe Institute for Advanced Study Harvard University 34 Concord Avenue Cambridge,
More informationContent Pricing in Peer-to-Peer Networks
Content Pricing in Peer-to-Peer Networks Jaeok Park and Mihaela van der Schaar Electrical Engineering Department, UCLA 21 Workshop on the Economics of Networks, Systems, and Computation (NetEcon 1) October
More informationImplications for the Sharing Economy
Locational Big Data and Analytics: Implications for the Sharing Economy AMCIS 2017 SIGGIS Workshop Brian N. Hilton, Ph.D. Associate Professor Director, Advanced GIS Lab Center for Information Systems and
More informationEmployment Decentralization and Commuting in U.S. Metropolitan Areas. Symposium on the Work of Leon Moses
Employment Decentralization and Commuting in U.S. Metropolitan Areas Alex Anas Professor of Economics University at Buffalo Symposium on the Work of Leon Moses February 7, 2014 9:30-11:15am, and 2:30-4:30pm
More informationPower-Law Congestion Costs: Minimal Revenue (MR) Pricing and the Braess Paradox
The Open Transportation Journal, 2008, 2, 47-52 47 Power-Law Congestion Costs: Minimal Revenue (MR) Pricing and the Braess Paradox Claude M. Penchina * Department of Physics, Hasbrouck Laboratory, University
More informationMathematica. A Systemjor Doing Mathematics by Computer. Stephen Wolfral1l. ~ C;:tr lju J. ~c~~
Mathematica A Systemjor Doing Mathematics by Computer Stephen Wolfral1l. ~ ~A_ ~ C;:tr lju J ~c~~ Mathematica was designed and implemented by: Stephen Wolfram, Daniel Grayson, Roman Maeder, _/ Henry Cejtin,
More informationThe morning commute in urban areas with heterogeneous trip lengths. ISTTT22, Northwestern University Raphaël Lamotte, Nikolas Geroliminis
The morning commute in urban areas with heterogeneous trip lengths ISTTT22, Northwestern University Raphaël Lamotte, Nikolas Geroliminis In a nutshell Vickrey (1969): the morning commute with a local bottleneck.
More information