Managing Congestion and Emissions in Road Networks with Tolls and Rebates Hai Yang Chair Professor Department of Civil and Environmental Engineering The.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Outline LP formulation of minimal cost flow problem
Price Of Anarchy: Routing
1 Index Coding Part II of tutorial NetCod 2013 Michael Langberg Open University of Israel Caltech (sabbatical)
Introduction to Algorithms
Course: Price of Anarchy Professor: Michal Feldman Student: Iddan Golomb 26/02/2014 Non-Atomic Selfish Routing.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
MS&E 211 Minimum Cost Flow LP Ashish Goel. Minimum Cost Flow (MCF) Need to ship some good from “supply” nodes to “demand” nodes over a network – Example:
1 Wide-Sense Nonblocking Multicast in a Class of Regular Optical Networks From: C. Zhou and Y. Yang, IEEE Transactions on communications, vol. 50, No.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks Dah-Ming Chiu and Raj Jain Presented by Yao Zhao.
Oblivious Routing for the L p -norm Matthias Englert Harald Räcke 1.
Achieving Network Optima Using Stackelberg Routing Strategies Yannis A. Korilis, Member, IEEE Aurel A. Lazar, Fellow, IEEE & Ariel Orda, Member IEEE IEEE/ACM.
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
Dept. of Computer Science & Engineering The Chinese University of Hong Kong 1 Interaction of Overlay Networks: Properties and Control Professor John C.S.
How Bad is Selfish Routing? Tim Roughgarden & Eva Tardos Presented by Wonhong Nam
A Scalable Network Resource Allocation Mechanism With Bounded Efficiency Loss IEEE Journal on Selected Areas in Communications, 2006 Johari, R., Tsitsiklis,
Near-Optimal Network Design with Selfish Agents By Elliot Anshelevich, Anirban Dasgupta, Eva Tardos, Tom Wexler STOC’03 Presented by Mustafa Suleyman CIFTCI.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Multicast Routing in ATM Networks with Multiple Classes of QoS Ren-Hung Hwang, Min-Xiou Chen, and Youn-Chen Sun Department of Computer Science & Information.
Lecture 3. Notations and examples D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Transportation Logistics Professor Goodchild Spring 2011.
EDA (CS286.5b) Day 18 Retiming. Today Retiming –cycle time (clock period) –C-slow –initial states –register minimization.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Efficiency Loss in a Network Resource Allocation Game Paper by: Ramesh Johari, John N. Tsitsiklis [ Informs] Presented by: Gayatree Ganu.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
1 Chapter 8 Sensitivity Analysis  Bottom line:   How does the optimal solution change as some of the elements of the model change?  For obvious reasons.
Some network flow problems in urban road networks Michael Zhang Civil and Environmental Engineering University of California Davis.
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
CONTINUOUS PRICE AND FLOW DYNAMICS OF TRADABLE MOBILITY CREDITS Hongbo YE and Hai YANG The Hong Kong University of Science and Technology 21/12/2012.
The impact of speed limits on traffic equilibrium and system performance in networks Hai Yang Chair Professor Department of Civil and Environmental Engineering,
Stochastic Multicast with Network Coding Ajay Gopinathan, Zongpeng Li Department of Computer Science University of Calgary ICDCS 2009, June , Montreal.
Equilibrium Properties of Taxi Markets with Search Frictions Hai Yang Department of Civil and Environmental Engineering The Hong Kong University of Science.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Properties of Pareto-Efficient Contracts and Regulations for Road Franchising Hai Yang Chair Professor Department of Civil and Environmental Engineering.
1 Multicasting in a Class of Multicast-Capable WDM Networks From: Y. Wang and Y. Yang, Journal of Lightwave Technology, vol. 20, No. 3, Mar From:
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Benjamin Heydecker JD (Puff) Addison Centre for Transport Studies UCL Dynamic Modelling of Road Transport Networks.
Network Congestion Games
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish users (i.e., players) strategically interact in using.
Fair Allocation and Network Ressources Pricing Fair Allocation and Network Ressources Pricing A simplified bi-level model Work sponsored by France Télécom.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
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.
Introduction to Optimization
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
Global Optimization Methods for the Discrete Network Design Problem Dr. Shuaian Wang Lecturer University of Wollongong Dr. Qiang Meng Associate Professor.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Approximation Algorithms based on linear programming.
Maryam Pourebadi Kent State University April 2016.
L11. Link-path formulation
Linear Programming for Solving the DSS Problems
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Engineering Economics (2+0)
Solver & Optimization Problems
Analysis of Node Localizability in Wireless Ad-hoc Networks
Network Coding and its Applications in Communication Networks
URBAN TRANSPORTATION NERWORKS
1.3 Modeling with exponentially many constr.
Formulating the Assignment Problem as a Mathematical Program
Multi-modal Bi-criterion Highway Assignment for Toll Roads Jian Zhang Andres Rabinowicz Jonathan Brandon Caliper Corporation /9/2018.
1.3 Modeling with exponentially many constr.
Javad Ghaderi, Tianxiong Ji and R. Srikant
Presentation transcript:

Managing Congestion and Emissions in Road Networks with Tolls and Rebates Hai Yang Chair Professor Department of Civil and Environmental Engineering The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong, PR China

Introduction Traffic congestion and emissions are two main types of travel disutility Congestion Emissions Idling Acceleration Braking

Introduction The two objectives, alleviating congestion and reducing emissions, cannot always be achieved at the same time, namely, sometimes conflict with each other. Such inconsistency naturally leads to a bi-criteria or bi-objective optimization problem. Minimizing Congestion Minimizing Emissions Traffic Management Conflict

Outline 1. Notations and preliminaries 2. Pareto system optimum 3. Decentralization of Pareto system optimum with increasing emission functions 4. Decentralization of Pareto system optimum with non-monotonic emission functions 5. Decentralization of Pareto system optimum with revenue-neutral toll and subsidy 6. Conclusions

Notations and preliminaries A road network : the set of origin-destination (O-D) pairs : the set of all routes between O-D pair : the flow on link : the flow on route : if route uses link, otherwise : the travel demand between O-D pair, which is given and fixed

Notations and preliminaries The set of feasible path flow pattern: The set of feasible link flow patterns: Separable link travel time functions,, which are assumed to be convex and strictly increasing for all

Notations and preliminaries Separable emission functions. Example: which are not always increasing, like:

Notations and preliminaries Homogeneous travelers with an identical value of time (VOT) denoted by : the travel cost of link ; in the absence of any toll scheme, and in the presence of a toll scheme, where is the toll on link The user equilibrium conditions: where represents the minimum path travel cost between OD pair

Pareto system optimum The system optimum (SO) problem: The minimum emission (ME) problem: The bi-objective optimization problem of minimizing total network travel time and total network emissions:

Pareto system optimum Let denote the Pareto-efficient link flow pattern, denote the set of Pareto-efficient solution to the bi- objective optimization problem Feasible region of System optimum Minimum emission Pareto frontier

Increasing emission functions The central problem of interest here is: For any given Pareto-efficient link flow pattern, whether does a toll scheme exist to decentralize it as user equilibrium? Construct the following linear programming (LP) problem:

Increasing emission functions By its duality property, we can demonstrate: Any Pareto-efficient flow pattern can be decentralized as user equilibrium by a nonnegative toll scheme when the emission functions are increasing. The theorem can be extended to: 1) Multiclass users in terms of different value of time 2) Multiple vehicle types 3) Tradable credit scheme

Non-monotonic emission functions It is empirically measured or observed that the average vehicle emission on a link decreases at first and then increases as the traffic flow goes up. Within its realistic range of speed on most arterial roads or freeways with higher speed limits, non- monotonic emission functions are encountered and should be taken into consideration.

Non-monotonic emission functions An example: OD demands: Link 2 Link 1 Link Link 4 Emission functions:

Non-monotonic emission functions The minimum emission link flow pattern The minimum emission path flow pattern

Non-monotonic emission functions UE conditions: To decentralize the minimum emission flow pattern as user equilibrium, we have to resort to negative link tolls.

Non-monotonic emission functions Although what we concern about is still the Pareto- efficient flow patterns, we should rather consider general feasible link flow patterns If we adopt both toll and subsidy (negative toll), for a general feasible link flow pattern, set the tolls as, the link travel cost will be. The user equilibrium conditions are definitely satisfied Any feasible link flow pattern can be decentralized as user equilibrium by a toll and subsidy scheme. Let denote the set of all effective toll and subsidy schemes

Revenue-neutral toll and subsidy Revenue-neutral: the total revenue collected is equal to the total subsidies paid We will examine the existence of revenue-neutral toll and subsidy scheme in two types of network topology: acyclic networks and cyclic networks

Acyclic networks As the network is a directed acyclic graph, there exists a topological ordering, an ordering of the nodes such that the starting endpoint of every edge occurs earlier in the ordering than the ending endpoint of the edge : the order of node Define the topological length of link with the starting endpoint and ending endpoint as : the topological length of route, which is independent of the nodes other than OD

Acyclic networks can be decentralized as user equilibrium by in The total revenue is. If, we try to amend the toll scheme to make the total revenue equal to zero. Let denote the parameter for adjusting the tolls, given by

Acyclic networks Revise the toll on each link to be. We can show that can be decentralized by toll and subsidy scheme, and is revenue-neutral. In an acyclic road network, any feasible link flow pattern can be decentralized as user equilibrium by a revenue-neutral toll and subsidy scheme The theorem applies for the Pareto system optimum link flow pattern directly irrespective of the monotonicity of link emission functions

Cyclic networks Still consider an amendment to. Let denote the parameter for adjusting the tolls, which is given by exists only when Set the new toll on each link as The new travel cost of path becomes

Cyclic networks is sufficient to ensure the non- existence of negative cycles We can show that can be decentralized by toll and subsidy scheme, and is revenue-neutral Conversely, if can be decentralized as user equilibrium by a revenue-neutral toll and subsidy scheme, then

Cyclic networks In a road network that may contain cycles, if and only if there exists such that, then can be decentralized as user equilibrium by a revenue- neutral toll and subsidy scheme With increasing emission functions, for a given Pareto-efficient link flow pattern, we can always find a nonnegative toll scheme such that. Hence we are always able to find a feasible revenue-neutral toll and subsidy scheme

Cyclic networks When link emission functions are not monotonic. a revenue-neutral toll and subsidy scheme may not exist to decentralize a Pareto system optimum link flow pattern. Consider the following example: Emission functions: OD demands: Link 3 Link 1 Link 5 Link Link 4 Link 6

Cyclic networks The minimum emission link flow pattern One of the minimum emission path flow pattern

Cyclic networks UE conditions:

Cyclic networks The minimum emission path flow pattern cannot be decentralized as user equilibrium by a revenue-neutral toll and subsidy scheme We can further prove that any feasible path flow pattern that can give rise to the unique link flow pattern cannot be decentralized into user equilibrium by a revenue-neutral toll and subsidy scheme A given target link flow pattern, including the Pareto system optimum link flow patterns such as the minimum emission link flow pattern, cannot always be decentralized into user equilibrium by a revenue-neutral toll and subsidy scheme in a network with physical cycles

Comparison of speed limits and road pricing for minimum traffic emissions Speed Limits VS Negative Link Tolls (Subsidy) PolicyOptimal schemeLink flowTotal time Total emission No policy interventionN/A (1.0,1.0)2900 Minimize emission through toll and subsidy* (3.32, 3.32) Minimize emission through speed limit (1.0,1.0) * If only non-negative tolls are allowed, then no emission reduction can be achieved.

Conclusions We studied the bi-objective optimization problem for simultaneous minimization of congestion and emissions on a road network. We investigated the existence of various pricing cum subsidy scheme to decentralize a given Pareto system optimum link flow pattern We proved that any given Pareto-efficient link flow pattern can be decentralized into user equilibrium by a nonnegative toll scheme if the emission functions are increasing. If, however, the link emission functions are not increasing, negative link toll charges or subsidy may be required in order to decentralize a given Pareto system optimum link flow pattern

Conclusions We then investigated the existence of revenue-neutral toll and subsidy scheme for decentralizing a given Pareto system optimum. We found that, for a network without physical cycle, such a revenue-neutral toll and subsidy scheme always exists regardless of the monotonicity of the link emission functions. If, however, for a network with physical cycles, we found that such a revenue-neutral toll and subsidy scheme may not exist. We provided a necessary and sufficient condition for existence of such a desirable revenue-neutral toll and subsidy schemes for a network with cycles

Q&A