OIM 413 Logistics and Transportation Lecture 3: Cost Structure

Similar documents
Lecture 3 Cost Structure

OIM 413 Logistics and Transportation Lecture 5: The System-Optimized (S-O) Problem

OIM 413 Logistics and Transportation Lecture 8: Tolls

OIM 413 Logistics and Transportation Lecture 7: Basic Sensitivity Analysis and the Braess Paradox

Network Equilibrium. Professor Anna Nagurney

OIM 413 Logistics and Transportation Lecture 6: Equilibration Algorithms for a General Network

Lecture 10 The Extended Model

Emission Paradoxes in Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

Lecture 10: Critical Needs Supply Chains Under Disruptions

Lecture 12 The Spatial Price Equilibrium Problem

Index Terms: Demand, Effective Travel Time, Perception Error.

Topic 2: Algorithms. Professor Anna Nagurney

Lecture 19: Common property resources

October 2007; revised April 2008 International Transactions in Operational Research (2009) 16, pp

Network Equilibrium Models: Varied and Ambitious

TRANSPORT CHALLENGES AND OPPORTUNITIES FOR LANDLOCKED COUNTRIES FOR ACHIEVING SUSTAINABLE DEVELOPMENT GOALS

Transportation Science and the Dynamics of Critical Infrastructure Networks with Applications to Performance Measurement and Vulnerability Analysis

VHD Daily Totals. Population 14.5% change. VMT Daily Totals Suffolk 24-hour VMT. 49.3% change. 14.4% change VMT

Tradable Permits for System-Optimized Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

Urban Growth and Transportation Development Patterns for China s Urban Transition

5.1 Introduction. 5.2 Data Collection

GAMPO 2018 FALL MEETING. National Performance Research Data Set GAMPO 2018 FALL MEETING (NPMRDS) CASE STUDY GAMPO FALL MEETING SEPTEMBER 2018

CIV3703 Transport Engineering. Module 2 Transport Modelling

Employment Decentralization and Commuting in U.S. Metropolitan Areas. Symposium on the Work of Leon Moses

IMPACTS OF THE EARTHQUAKES ON EXISTING TRANSPORTATION NETWORKS IN MEMPHIS AREA

Sustainable Fashion Supply Chain Management Under Oligopolistic Competition and Brand Differentiation

The negation of the Braess paradox as demand increases: The wisdom of crowds in transportation networks

Returns to Scale in Networks. Marvin Kraus * June Keywords: Networks, congestion, returns to scale, congestion pricing

Viable and Sustainable Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

Yu (Marco) Nie. Appointment Northwestern University Assistant Professor, Department of Civil and Environmental Engineering, Fall present.

Assessing spatial distribution and variability of destinations in inner-city Sydney from travel diary and smartphone location data

APPENDIX IV MODELLING

Technology and Network Design Issues. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

Analysis and Design of Urban Transportation Network for Pyi Gyi Ta Gon Township PHOO PWINT ZAN 1, DR. NILAR AYE 2

Decentralisation and its efficiency implications in suburban public transport

Forecasts from the Strategy Planning Model

Dynamic Electric Power Supply Chains and Transportation Networks: an Evolutionary Variational Inequality Formulation

A Framework for Dynamic O-D Matrices for Multimodal transportation: an Agent-Based Model approach

NATHAN HALE HIGH SCHOOL PARKING AND TRAFFIC ANALYSIS. Table of Contents

Assessing the Employment Agglomeration and Social Accessibility Impacts of High Speed Rail in Eastern Australia: Sydney-Canberra-Melbourne Corridor

Encapsulating Urban Traffic Rhythms into Road Networks

GIS-BASED VISUALIZATION FOR ESTIMATING LEVEL OF SERVICE Gozde BAKIOGLU 1 and Asli DOGRU 2

ABSTRACT I. INTRODUCTION II. OBJECTIVES

Management of Knowledge Intensive Systems as Supernetworks: Modeling, Analysis, Computations, and Applications

Supply Chain Network Sustainability. Competition and Frequencies of Activities from Production to Distribution

Traffic Flow Theory & Simulation

Recent Researches in Engineering and Automatic Control

Travel Parameter Modelling for Indian Cities- Regression Approach

Business Case: UV Facility Backup Generator

ECONOMIC AND FINANCIAL ANALYSIS

National Symposium on Extreme Weather Event Impacts on Transportation Infrastructure

A Simplified Travel Demand Modeling Framework: in the Context of a Developing Country City

Trip Distribution Model for Flood Disaster Evacuation Operation

CENTRAL ASIAN REPUBLICS AND THEIR NEW TRANSPORT DEMANDS

An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem

Metro SafeTrack Impact on Individual Travel Behavior & Regional Traffic Conditions. 1. Introduction. 2. Focus of this Volume & Issue

Topic 6: Projected Dynamical Systems

COMBINATION OF MACROSCOPIC AND MICROSCOPIC TRANSPORT SIMULATION MODELS: USE CASE IN CYPRUS

Mapping Accessibility Over Time

City of Grand Island Tuesday, August 14, 2018 Council Session

Vulnerability and risk analysis of the road infrastructure in Reykjavík. Áhættu- og áfallaþolsgreining vegakerfsins í Reykjavík

Dan Graham Professor of Statistical Modelling. Centre for Transport Studies

Analysis of the Tourism Locations of Chinese Provinces and Autonomous Regions: An Analysis Based on Cities

A Model of Traffic Congestion, Housing Prices and Compensating Wage Differentials

GENERAL EDUCATION AND TRAINING SOCIAL SCIENCES

Stepping away from trend analyses for regional integrated planning and modelling

Changes in Land Use, Transportation System and the Mobility in Gifu by using Historical Map, Statistics and Personal Trip Survey Data

Implementation of the 1997 Indonesian Highway Capacity Manual (MKJI) Volume Delay Function

Research on Comprehensive Decision Model Based on Analytic Hierarchy Process and Entropy Method Yi-Peng LI 1,a, Xin ZHANG 2,b,*

Accessibility: an academic perspective

Supply Chain Network Design for Critical Needs with Outsourcing

Optimal Adaptive Routing and Traffic Assignment in Stochastic Time-Dependent Networks. Song Gao

CONGESTION REPORT 1 st Quarter 2016

INTRODUCTION TO TRANSPORTATION SYSTEMS

GRADE 6 GEOGRAPHY TERM 1 LATITUDE AND LONGITUDE (degrees)

Designing smart & Resilient cities:

CONGESTION TOLLING AND URBAN SPATIAL STRUCTURE. Richard Arnott. Department of Economics. Boston College. Chestnut Hill, MA U.S.A.

Weather Information for Surface Transportation (WIST): Update on Weather Impacts and WIST Progress

Publication List PAPERS IN REFEREED JOURNALS. Submitted for publication

Securing the Sustainability of Medical Nuclear Supply Chains. Through Economic Cost Recovery, Risk Management, and Optimization

OVERVIEW OF A SIMULATION STUDY OF THE HIGHWAY 401 FTMS

Towards a Co-ordinated Planning of Infrastructure and Urbanization

If you aren t familiar with Geographical Information Systems (GIS), you. GIS, when combined with a database that stores response information,

Modeling of Supply Chain Risk under Disruptions with Performance Measurement and Robustness Analysis

Lesson 6: Graphs of Linear Functions and Rate of Change

Routing Hazmat Multimodal Transportation Based on CVaR Assessment

III.A. ESTIMATIONS USING THE DERIVATIVE Draft Version 10/13/05 Martin Flashman 2005 III.A.2 NEWTON'S METHOD

Measurement of human activity using velocity GPS data obtained from mobile phones

AP Physics 1 Summer Assignment (2014)

Travel and Transportation

Business Preparedness and Hurricane Risk

The Model Research of Urban Land Planning and Traffic Integration. Lang Wang

Flood Scenario Worksheet

Metrolinx Transit Accessibility/Connectivity Toolkit

6 th GLOBAL SUMMIT ON URBAN TOURISM 4 6 December 2017, Kuala Lumpur (Malaysia)

Investigating uncertainty in BPR formula parameters

Foreword. Vision and Strategy

Data Collection. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1

Appendix B. Traffic Analysis Report

Transcription:

OIM 413 Logistics and Transportation Lecture 3: Cost Structure Professor Anna Nagurney John F. Smith Memorial Professor and Director Virtual Center for Supernetworks Department of Operations & Information Management

Cost Structure Cost is a disutility - Cost is a function of travel time, probability of an accident, scenery of a link. Assume that all such factors can be grouped together into a disutility. Both economists and traffic engineers work on determining travel cost functions on the links. In particular, we consider travel cost functions of a user exercised via links of the network.

Cost Structure In the first generation model, travel cost of users was assumed constant and could be determined a priori - such networks are known as uncongested networks. In the second generation model, the networks are congested, that is, the user s travel cost depends on the characteristics of the link, but also on the flow on that link. Clearly, the quality of the road/link also affects the cost and travel time.

Illustrations of Congestion

Illustrations of Damage to Infrastructure

The Standard Model Link Cost Structure and the BPR Function In what is known as the standard model of transportation, we assume that the user cost on a link (i.e., the cost as perceived by a traveler or user) is a function of the flow on the link, that is, c a = c a (f a ), a L. To capture congestion, the user link cost is an increasing function of the flow. A well-known cost function, in practice, is: The Bureau of Public Roads (BPR) Cost Function c a = ca 0 [ 1 + α ( f a t a ) β ] where c a : travel time on link a, f a : link flow on link a, ca 0 : free flow travel time, t α: practical capacity of link a, and α, β: model parameters (typically α = 0.15, β = 4).

The Simplest Model The Standard Model uncongested cost (time) Often one can substitute cost with time.

The Simplest User Link Cost Structure that Captures Congestion Example: Simplest - Linear c a (f a ) = g a f a + h a, where g a, h a > 0 and constant. g a is the congestion factor. h a - is the uncongested term or the free-flow travel time on the link. For example, we may have that: c a = 10f a + 20.

The Multiclass/Multimodal Model Link Cost Structure Suppose now that we have 2 classes of users that perceive cost in different ways; this framework can also handle multiple modes of transportation. More General Two Mode/Class Model Link Cost Structure Link cost for link a as perceived by mode/class 1: ca 1 = ca 1 (fa 1, fa 2 ) Link cost for link a as perceived by mode/class 2: ca 2 = ca 2 (fa 1, fa 2 ) Can generalize the 2-class cost structure to k classes or modes. But when you make the travel choice you choose paths, not links.

A Highly Congested Multimodal Transportation Network

A Less Congested Multimodal Network Modes of Transportation www.fredrikmedia.se Professor Anna Nagurney OIM 413 Logistics and Transportation - Lecture 3

The Biggest Traffic Jam The world s longest traffic jam in physical length and time almost closed the highway in the Inner-Mongolia region of China in August 2010. According to the Chinese State News, the ongoing road work to expand the capacity of the highway was the primary cause for the delays. Trucks, including freight trucks, many of which carry coal, make up the majority of the traffic on this busy highway that feeds Beijing, China s capital city, and it is one of the busiest in the country and the world. The traffic jam was over 100 kilometers/60 miles long, involved more than 10,000 cars, and lasted over 9 days!

Images from the Biggest Traffic Jam Biggest Traffic Jam Ever - On the Beijing-Tibet Highway, August 2010

The Sagamore Bridge and an Epic Cape Cod Traffic Jam Sagamore bridge jam, July 7, 2013 Epic tie-up on Sunday, July 7, 2013 afternoon, a day that has already become part of traffic legend: a 25-mile backup, with some reporting an eight-hour journey from the Outer Cape to Boston, an infuriating crawl in stifling summer heat.

The Path/Route Cost Structure Path Cost Relationship to Link Costs Let C p denote the user s or personal travel cost along path p. C p = C p (f ) = a L c a (f a )δ ap, p P, where f is a vector of all the link flows and { 1, if link a is contained in path p; δ ap = 0, otherwise. In other words, the user cost on a path is equal to the sum of user costs on links that make up the path. Clearly, the time that it will take you to reach your destination from your point of origin will depend upon the sequence of roads that you take (and the traffic).

A Transportation Network Example 1 a b 2 c 3 The O/D pair is: w 1 = (1, 3). The paths are: p 1 = (a, c), The user link cost functions are: p 2 = (b, c). c a (f a ) = 10f a + 5, c b (f b ) = f b + 10, c c (f c ) = 5f c + 5. The travel demand is d w1 = 10 and the path flows are: F p1 = 5, F p2 = 5. What is C p1 =? What is C p2 =?

The Total Link Cost Structure Another type of cost is the social or total cost. The total cost on a link a is denoted by ĉ a and, for the standard model, is expressed as: ĉ a (f a ) = c a (f a ) f a. If the user link cost c a is linear, then the total link cost: ĉ a (f a ) = (g a f a + h a ) f a = g a f 2 a + h a f a. Hence, if the user cost function on a link is linear, then the total cost is quadratic.

Another Transportation Network Example 1 a b 2 O/D pair w 1 = (1, 2). The user link travel costs and the total link costs are: c a (f a ) = 10f a + 5, ĉ a (f a ) = 10f 2 a + 5f a, c b (f b ) = 4f b + 10, ĉ b (f b ) = 4f 2 b + 10f b. Suppose that p 1 = (a), p 2 = (b), and d w1 = 20, and F p1 = 10, F p2 = 10. What are the user and total costs on the links a and b?

The Marginal Link Total Cost Structure The marginal total cost ĉ a(f a ) = ĉ a(f a ) f a, where ĉ a (f a ) = c a (f a ) f a. In the uncongested model, the marginal total cost is a constant. Hence, the marginal total cost in congested networks must be an increasing function of the link flows.

The Total Network Cost Different ways to express the total network cost, denoted by S. S(f ) = a L ĉ a (f a ) S(f ) = a L c a (f a ) f a S(f, F ) = p P C p (f ) F p

An Example to Illustrate Concepts 1 a b 2 The O/D pair w 1 = (1, 2). The user link travel costs and the total link costs are: c a (f a ) = 1f a + 15, ĉ a (f a ) = 1f 2 a + 15f a, c b (f b ) = 2f b + 5, ĉ b (f b ) = 2f 2 b + 5f b. Hence, the marginal total costs on the links are: ĉ a(f a ) = 2f a + 15, ĉ b (f b) = 4f b + 5. The total cost expression for the network is: S(f ) = ĉ a (f a ) + ĉ b (f b ) = 1f 2 a + 15f a 2 + f 2 b + 5f b.

For more advanced formulations and associated theory, see Professor Nagurney s Fulbright Network Economics lectures. http://supernet.isenberg.umass.edu/austria lectures/fulmain.html