Modeling Traffic in St. Louis By Julia Greenberger.

Slides:



Advertisements
Similar presentations
Modeling of Data. Basic Bayes theorem Bayes theorem relates the conditional probabilities of two events A, and B: A might be a hypothesis and B might.
Advertisements

Standard Minimization Problems with the Dual
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming (LP) (Chap.29)
Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
L12. Network optimization problems D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2014.
Math 015 Section 6.1 Equations. Many students like to remember the process for solving linear equations as: any algebra expressions on each side variable.
Linear Programming Applications
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
Non-Linear Simultaneous Equations
15.082J and 6.855J and ESD.78J November 2, 2010 Network Flow Duality and Applications of Network Flows.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
1. The Simplex Method.
4.5 Solving Systems using Matrix Equations and Inverses.
Duality Theory 對偶理論.
Section 2.2 Echelon Forms Goal: Develop systematic methods for the method of elimination that uses matrices for the solution of linear systems. The methods.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kristina Anderson March 25, EXIT FactorSimplifyFind xPotpourri
Chapter 6 Linear Programming: The Simplex Method Section R Review.
Have we ever seen this phenomenon before? Let’s do some quick multiplication…
3-2 Solving Equations by Using Addition and Subtraction Objective: Students will be able to solve equations by using addition and subtraction.
Kernel Methods: Support Vector Machines Maximum Margin Classifiers and Support Vector Machines.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Introduction to Operations Research
Math – The Multiplication/Division Principle of Equality 1.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Network Flow Problems Example of Network Flow problems:
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.
Chapter 8 Network Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Model 5 Long Distance Phone Calls By Benjamin Cutting
Solving Quadratic Equations by Factoring. Martin-Gay, Developmental Mathematics 2 Zero Factor Theorem Quadratic Equations Can be written in the form ax.
Differential Equations Linear Equations with Variable Coefficients.
GUIDED PRACTICE for Example – – 2 12 – 4 – 6 A = Use a graphing calculator to find the inverse of the matrix A. Check the result by showing.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
The Substitution Method Objectives: To solve a system of equations by substituting for a variable.
Kernel Methods: Support Vector Machines Maximum Margin Classifiers and Support Vector Machines.
Linear Programming Chapter 1 Introduction.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.
Prediction of real life phenomena For model to be reliable, model validation is necessary Judgement, Experience Model Simplify Real World Is performance,
An Introduction to Matrix Algebra Math 2240 Appalachian State University Dr. Ginn.
§ 1.5 Equations of Lines.
Stat 261 Two phase method.
Introduction to Linear Programs
The Inverse of a Square Matrix
Systems of Equations and Inequalities
Copyright 2013, 2010, 2007, 2005, Pearson, Education, Inc.
§ 1.5 Equations of Lines.
Section 11.2 The Quadratic Formula.
The Simplex Method.
Routing and Logistics with TransCAD
Simplify Expressions 34 A number divided by 3 is 7. n ÷ 3 = 7.
Transportation, Assignment and Network Models
2 Understanding Variables and Solving Equations.
Simultaneous Equations
Use Inverse Matrices to Solve 2 Variable Linear Systems
Find the area of the Triangle
Solving Percent Problem with Equations
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Chapter 6 Network Flow Models.
2 Chapter Chapter 2 Equations, Inequalities and Problem Solving.
Standard Form to Slope-Intercept Form.
“Easy” Integer Programming Problems: Network Flow Problems
Multiply by 5/40 and sum with 2nd row
Presentation transcript:

Modeling Traffic in St. Louis By Julia Greenberger

Goals To create a model of the traffic flow of cars traveling from Creve Coeur to downtown St. Louis To use this model to determine the maximum flow of cars from Creve Coeur to downtown St. Louis To predict the change in traffic flow on Forest Park Parkway once Highway 40 (I-64) reopens

St. Louis Map with Construction

Creating the Model Use 13 nodes to keep model manageable Use 18 links between these nodes to have 18 unknown variables

Map with Routing

Simplified Routing Map

Creating the Model (cont.) Find the maximum capacity of cars on the streets used in the model using b i,j = # of cars ≈ (# of lanes)*(speed limit)*(c), Where b i,j is the maximum capacity of the street from node i to node j and i,j:1-13 and c=traffic coefficient. c=1; no traffic, green c=.75; medium traffic, yellow c=.5; heavy traffic, red

Map of Traffic Flow Use map to find c

Routing Map with Maximum Road Capacities

Creating the Linear Program Let X i,j = the number of cars traveling from node i to node j, where i,j: 1-13 We want to maximize X 1,2 + X 2,3 + … + X 12,13 Let X=[X 1,2 ; X 2,3 ;… ; X 12,13 ] To maximize the sum of the entries in X, we can maximize C T *X, where C=[1;1;…;1] or we can minimize C T *X, where C=[-1;-1;…;-1]

Creating the Linear Program Assume the number of cars entering a given node is equal to the number of cars exiting that node Create a matrix A, with equations that balance the flow in and out of each node A = [ … 0,0,0,0,0,0,0,0,0,0,0,0,0,-1,1,0,1; …] To balance flow in and out of node, A*X=0 Using the constraint vector, X i,j ≤ b i,j

Creating the Linear Program Minimize C T *X, where C=[-1;-1;…;-1] Subject to  A*X=0  X i,j ≤ b i,j Solve using linprog in MATLAB

Results from Linear Program Maximum flow in total system is 30 cars Flow is limited by some streets with very small X i,j

Modifying Linear Program

Results The maximum flow in total system did not change The flow on Forest Park Parkway decreased from 15 to 12.3 cars Model supports the hypothesis that the opening of Highway-40 will decrease traffic flow on local streets

Limitations We only used 13 nodes In reality, there are hundreds of nodes from Creve Coeur to downtown St. Louis Uncertainty in traffic coefficients

Questions?