Transportation Engineering Route Choice 3 February 2, 2011

Slides:



Advertisements
Similar presentations
Price Of Anarchy: Routing
Advertisements

Lecture 2. A Day of Principles The principle of virtual work d’Alembert’s principle Hamilton’s principle 1 (with an example that applies ‘em all at the.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Tirgul 13. Unweighted Graphs Wishful Thinking – you decide to go to work on your sun-tan in ‘ Hatzuk ’ beach in Tel-Aviv. Therefore, you take your swimming.
TRIP ASSIGNMENT.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
Previously, we learned that adding two numbers together which have the same absolute value but are opposite in sign results in a value of zero. This can.
Solving a System of Equations using Multiplication
PHY-2049 Current & Circuits February ‘08. News Quiz Today Examination #2 is on Wednesday of next week (2/4/09) It covers potential, capacitors, resistors.
Current & Circuits February ‘08
COSC 2007 Data Structures II Chapter 14 Graphs III.
Click mouse. EQUATIONS The important thing to remember about equations is that both sides must balance (both sides must equal each other). This means.
Linear Equations in Two Variables A Linear Equation in Two Variables is any equation that can be written in the form where A and B are not both zero.
Mechanism Design without Money Lecture 3 1. A game You need to get from A to B Travelling on AX or YB takes 20 minutes Travelling on AY or XB takes n.
Algebra 1 Ch 2.4 – Solving Equations with Variables on Both Sides.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
BALANCING EQUATIONS NO2 - Balancing equations made easy.
Travel Demand Forecasting: Traffic Assignment CE331 Transportation Engineering.
Motion and Force Chapter Thirteen: Forces 13.1 Forces 13.2 Forces and Equilibrium.
Transportation Planning Asian Institute of Technology
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
ECE 1100: Introduction to Electrical and Computer Engineering
Lesson 4 – Solving Simultaneous equations
Physics: Principles with Applications, 7th edition
ConcepTest 2.1 Walking the Dog
PHYS 1443 – Section 001 Lecture #9
Linear Motion with constant acceleration
EMF and Terminal Voltage
Properties of Arithmetic
The Theory of Economic Growth
Question Does the current affect the time it takes a boat to cross a river if the boat is pointed directly across the river?
Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.
URBAN TRANSPORTATION NERWORKS
CE 3500 Transportation Engineering Basic Traffic Flow Concepts
Resistors in Series and Parallel.
Multiplication & Division
PHYS 1443 – Section 003 Lecture #8
Spring 2002 Lecture #8 Dr. Jaehoon Yu Work and Kinetic Energy
Calculating Truss Forces
Transportation Engineering Trip Distribution January 19, 2011
Properties of Addition
Mr Barton’s Maths Notes
Instructor: Shengyu Zhang
Transportation Engineering Route Choice January 28, 2011
Let’s Review -- An equation is similar to a scale. Both sides of the scale need to be equal in order for the scale to balance. Properties of equality.
Graphs Chapter 11 Objectives Upon completion you will be able to:
Networks and Shortest Paths
Section 23.3: Coulomb’s Law
CSE373: Data Structures & Algorithms Lecture 18: Dijkstra’s Algorithm
Heat Engines.
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
EVALUATING EXPRESSIONS
Solving Linear Equations
Evaluating Expressions
KS3 Mathematics A5 Functions and graphs
Artificial Intelligence
Flowcharts and Pseudo Code
Mathematics for Signals and Systems
Mr Barton’s Maths Notes
Motion and Force. Motion and Force Chapter Four: Forces 4.1 Forces 4.2 Friction 4.3 Forces and Equilibrium.
Chapter 6 Network Flow Models.
Equations 1 Click mouse.
Calculating Truss Forces
Motion and Force. Motion and Force Chapter Four: Forces 4.1 Forces 4.2 Friction 4.3 Forces and Equilibrium.
Electrical Circuits Circuit – a complete path from the high to low potential which includes a load between the two potentials. If there’s no load - only.
Motion and Force. Motion and Force Chapter Thirteen: Forces 13.2 Forces and Equilibrium.
Question Does the current affect the time it takes a boat to cross a river if the boat is pointed directly across the river?
Presentation transcript:

Transportation Engineering Route Choice 3 February 2, 2011

ANNOUNCEMENTS

Lab tomorrow... all EN labs already reserved tomorrow afternoon, so still meet in CR 103. If each group could have a laptop, that would be ideal. (If no group members have one, talk to me and we can make other arrangements.)

REVIEW

We can summarize this as the principle of user equilibrium: Any used route has equal and minimal travel time among all possible routes connecting that origin and destination.

This is an iterative process: we repeat the steps over and over again until we’re “close enough” to equilibrium. Calculate link travel times Find fastest paths Shift travelers from slower paths to faster ones

Method of Successive Averages: Find shortest paths, get flow vector x* if everybody was to use these paths. Then set xi = (1/i)x* + (1 – 1/i)xi-1 (Find a weighted average of your path flows from the last iteration and the current shortest paths.)

Frank-Wolfe: Find shortest paths, get flow vector x* if everybody was to use these paths. Then set xi = lx* + (1 –l)xi-1 (Find the point in between your path flows from the last iteration and the current shortest paths which is closest to equilibrium.)

xi-1 x* More precisely, we need Therefore, there is some balancing point in the middle where either xi-1 or x* is equally good. 1 l xi-1 x*

Writing out more fully, l satisfies Another good place to use an equation solver.

WHEN DO WE STOP?

Potential idea: stop when the link flows no longer change very much. x2 x4 x5 x3 x6 x1

Advantage: Easy. x2 x4 x5 x3 x6 x1

Disadvantage: Doesn’t really have anything to do with equilibrium. x2 x4 x5 x3 x6 x1

A better method is to see how close our solution x is to the ideal of “equal and minimal” travel times. To this end we define a “gap function” which is zero if x satisfies the principle of user equilibrium, and positive otherwise.

We can then track the progress of the gap over successive iterations We can then track the progress of the gap over successive iterations. When it is close enough to zero, we are done.

What kind of function would have this property What kind of function would have this property? Consider the equilibrium state when there is just one OD pair. Every used path has equal and minimal cost; let’s call this cost u Therefore, the total travel time is ud

What kind of function would have this property What kind of function would have this property? Consider the equilibrium state when there is just one OD pair. Every used path has equal and minimal cost; let’s call this cost u Therefore, the total travel time is ud

Another way of calculating the total travel time is to add up the travel time on each path. If there are k paths with cost ci and flow xi, this gives a total cost of Scixi

If this is the equilibrium state, these are equal: ud = Scixi Otherwise, the left-hand side must be smaller, because u is the fastest path.

and they are equal only at an equilibrium solution. Therefore ud ≤ Scixi and they are equal only at an equilibrium solution.

 Scixi / ud ≥ 1  Scixi / ud – 1 ≥ 0 Therefore and they are equal only at an equilibrium solution. This leads to a natural gap function:  Scixi / ud ≥ 1  Scixi / ud – 1 ≥ 0

Scixi / ud – 1 This is called the relative gap When there are multiple origins and destinations it can be written as

Sum over all roadway links Travel time on that link Flow on that link OD matrix value from r to s Time on fastest path from r to s Sum over all OD pairs

How small of a gap is needed How small of a gap is needed? Current best practice is 10-4 to 10-6, but you need software to get there.

INTERMEZZO

THE BRAESS PARADOX

10x 50 + x 6 6 10x 50 + x

By symmetry, 3 will take top and 3 will take bottom. Flow 3 10x 50 + x 3 6 6 3 10x 50 + x 3

Flow Travel Time 30 3 10x 50 + x 3 6 53 6 30 3 10x 50 + x 3 53 By symmetry, 3 will take top and 3 will take bottom. Flow Travel Time 30 3 10x 50 + x 3 6 53 6 30 3 10x 50 + x 3 53

The equilibrium travel time is 83. Flow Travel Time 30 3 10x 50 + x 3 6 53 6 30 3 10x 50 + x 3 53

What if we add a new link? Flow Travel Time 30 3 10x 50 + x 3 6 53 6 10 + x 10 30 3 10x 50 + x 3 53

The middle path is now faster: 70 < 83 Someone will switch... say, from the top route. Flow 2 10x 50 + x 3 6 6 1 10 + x 3 10x 50 + x 4

Flow Travel Time 30 2 10x 50 + x 3 6 52 6 1 10 + x 11 40 3 10x 50 + x Still not equilibrium: the bottom path is slower than the middle one. Flow Travel Time 30 2 10x 50 + x 3 6 52 6 1 10 + x 11 40 3 10x 50 + x 4 53

The middle path is now faster: 70 < 83 Someone will switch... say, from the top route. Flow 2 10x 50 + x 4 6 6 2 10 + x 2 10x 50 + x 4

Flow Travel Time 40 2 10x 50 + x 4 6 52 6 2 10 + x 12 40 4 10x 50 + x OK, all travel times are equal... but have increased from 83 to 92. Flow Travel Time 40 2 10x 50 + x 4 6 52 6 2 10 + x 12 40 4 10x 50 + x 4 52

What happened? Flow Travel Time 40 2 10x 50 + x 4 6 52 6 2 10 + x 12 40 4 10x 50 + x 4 52

Implications of the Braess paradox Adding capacity will not always help. (And in fact it might even hurt.)

Implications of the Braess paradox Adding capacity will not always help. (And in fact it might even hurt.) We need to do route choice. “Engineering judgment” and intuition can fail horribly.

The invisible hand can go awry in transportation systems. Implications of the Braess paradox Adding capacity will not always help. (And in fact it might even hurt.) We need to do route choice. “Engineering judgment” and intuition can fail horribly. The invisible hand can go awry in transportation systems.

The invisible hand can go awry in transportation systems. Why is this the case? Why does the “free market” leave everybody worse off in this case? (If we force people to stay on their original path, everybody gets there faster) The invisible hand can go awry in transportation systems.

It is because of congestion externalities: one person’s choice has impacts on someone else who had no say in the matter. Economists would say the problem can be corrected by pricing the externality... charging a toll

But that topic will have to wait for later... Economists would say the problem can be corrected by pricing the externality... charging a toll