Transportation Logistics Professor Goodchild Spring 2011.

Slides:



Advertisements
Similar presentations
© BMA Inc All rights reserved. Decision-making Making routine decisions without the help of standard costs.
Advertisements

CITY LOGISTICS “Is the process of totally optimising the logistics and transport activities by private companies in urban areas while considering the traffic.
Strategic Decisions (Part II)
© BMA Inc All rights reserved. Decision-making Making routine decisions without the “help” of standard costs.
CEE 320 Winter 2006 Route Choice CEE 320 Steve Muench.
Inventory Cost Captures time-value of holding product Captures time-value of holding product Perishability, theft, opportunity cost of cash, insurance,
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.
Supply Chain Management Managing the between all of the parties directly and indirectly involved in the procurement of a product or raw material.
Logistics Cost Part II Professor Goodchild Spring 11.
Basic Principles of Distribution Channel Design Distribution Channel Strategy BA266: L. P. Bucklin.
Estimating Congestion Costs Using a Transportation Demand Model of Edmonton, Canada C.R. Blaschuk Institute for Advanced Policy Research University of.
Today I will: Learn the role value plays in pricing decisions So I can: Explain the goal of pricing I will know I’m successful when: I see the value of.
TRIP ASSIGNMENT.
Transportation Logistics Professor Goodchild Spring 2009.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Urban Transportation 6. Introduction The major problem facing the transportation is congestion. The major problem facing the transportation is congestion.
Chapter: 13 >> Krugman/Wells Economics ©2009  Worth Publishers Perfect Competition and The Supply Curve.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Logistics Cost Professor Goodchild Spring 11. Initial gains from deregulation (restructuring of networks), stalling in the mid-90s dropping off again.
McGraw-Hill/Irwin ©2008 The McGraw-Hill Companies, All Rights Reserved Business Plug-in B8 SUPPLY CHAIN MANAGEMENT.
Professor: Keren Mertens Horn Office: Wheatley 5-78B Office Hours: TuTh 2:30-4:00 pm ECONOMICS OF THE METROPOLITAN AREA 212G,
Target Markets and Channel Design Strategy
Technology and Society The DynamIT project Dynamic information services and anonymous travel time registration VIKING Workshop København Per J.
Are Monopolies Desirable?
Workshop PRIXNET – 11/12 Mars CONGESTION PRICING IN AIR TRANSPORTATION Karine Deschinkel Laboratoire PRiSM – Université de Versailles.
Some network flow problems in urban road networks Michael Zhang Civil and Environmental Engineering University of California Davis.
Costing & Pricing 2: Factoring other important costs into your pricing Reinhard Werner & Mark Kwami.
Speech at CIGNA Beth Lira August 7,2006. Divider page title goes here.
The Economics of Networks An Overview. Networks: Nothing New.
Role of incentives in networks CS 653, Fall 2010.
Chapter 7 The Cost of Production. Chapter 7Slide 2 Topics to be Discussed Measuring Cost: Which Costs Matter? Cost in the Short Run Cost in the Long Run.
8.1 Costs and Output Decisions in the Long Run In this chapter we finish our discussion of how profit- maximizing firms decide how much to supply in the.
Supernetworks: Paradoxes, Challenges, and New Opportunities Anna Nagurney John F. Smith Memorial Professor The Virtual Center for Supernetworks.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
Design and management of Noncooperative Communication Networks Ariel Orda Dept. of Electrical Engineering Technion – Israel Institute of Technology.
Network Congestion Games
Transportation Logistics Professor Goodchild Spring 2011.
Analysis and algorithms of the construction of the minimum cost content-based publish/subscribe overlay Yaxiong Zhao and Jie Wu
Business Economics WEEK 4 W/C 4 th March 2013 INTRODUCTION Course Advanced Diploma Management.
Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.
1 Importance and Exposure in Road Network Vulnerability Analysis: A Case Study for Northern Sweden Erik Jenelius Transport and Location Analysis Dept.
Do People Use the Shortest Path? Empirical Test of Wardrop's First Principle Shanjiang Zhu, Ph.D. Research Scientist David Levinson, Ph.D., Professor Contact:
Professor Goodchild Spring 08
Capacity-constrained Traffic Assignment in Network with Residual Queues and Implementation in EMME/2 Tel.: , 16th.
Safe roads, Reliable journeys, Informed travellers Highways Agency’s Journey Time Reliability Target With Thanks to Paresh Tailor Business Planning & Performance.
CHAPTER 13 INVENTORY MANAGEMENT. THE CONCEPTS Crucial for low profit margin, low cost strategy Determining appropriate inventory level by conflicting.
Managing Congestion and Emissions in Road Networks with Tolls and Rebates Hai Yang Chair Professor Department of Civil and Environmental Engineering The.
Vehicle Routing Problems
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
8.1 Costs and Output Decisions in the Long Run In this chapter we finish our discussion of how profit- maximizing firms decide how much to supply in the.
Assignment. Where are we? There are four scopes 1. Logit 2. Assignment Today! 3. LUTI 4. Other models and appraisal.
Vehicle Routing Problem
CEE 320 Fall 2008 Route Choice CEE 320 Steve Muench.
Travel Demand Forecasting: Traffic Assignment CE331 Transportation Engineering.
ANASOFT VIATUS. Challenges Supply chain optimization is necessary for achieving competitive price of final products Synchronization and utilization of.
Economies of Scale Introduction and appropriation issues.
Transportation II Lecture 16 ESD.260 Fall 2003 Caplice.
Scale and resource mix Learning Objectives Understand what is meant by productive efficiency Learning Outcomes  Describe the issues involved in choosing.
Transportation Planning Asian Institute of Technology
Chapter 2 Microeconomic Principles
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Prepared for 16th TRB National Transportation Planning Applications Conference Outline Gap Value in Simulation-Based Dynamic Traffic Assignment (DTA) Models:
High way and Transportation 2(Lab) LCIV 3034
Continuous improvement is the process by which organizations frequently review their procedures, aiming to correct errors or problems. The most effective.
Transportation Engineering Route Choice January 28, 2011
Intro to Programming & Algorithm Design
Planning the transportation of elderly to a daycare center
Presentation transcript:

Transportation Logistics Professor Goodchild Spring 2011

Link Costs TSP and VRP assume cost of travel between 2 points problem input There are formulations where these costs can vary over time, or by vehicle type Cost = a*time + b*distance What else matters?

Link Travel Times Depend on volume of traffic Link performance functions Link cost functions T=f(flow on link)

Wardrop’s First Principal The journey times in all routes actually used are equal and less than those which would be experienced by a single vehicle on any unused route. Each user non-cooperatively seeks to minimize his cost of transportation. Referred to as "user equilibrium" (UE) flows. User-optimized equilibrium is reached when no user may lower his transportation cost through unilateral action.

Wardrop’s Second Principal At equilibrium the average journey time is minimum. This implies that each user behaves cooperatively in choosing his own route to ensure the most efficient use of the whole system. Referred to as "system optimal" (SO). Economists argue this can be achieved with marginal cost road pricing. marginal costroad pricing

O D1 D2 Link 1 Flow = X 1 Cost = Z 1 Link 2 Flow = X 2 Cost = Z 2 Link 3 Flow = X 3 Cost = X 3 Given OD flow from O to D2 is 4 Choose fraction of flow to travel link 1 and 3 or link 2 Identify UE solution, SO solution

O D1 D2 Link 1 Flow = X 1 Cost = Z 1 Link 2 Flow = X 2 Cost = Z 2 Link 3 Flow = X 3 Cost = X 3 X 1 =4(1+x), X 2 =4(1-x), X 3 =4x x is fraction of items for D2 sent through D1 Z 1 =1/X 1, Z 2 =X 2, Z 3 =1 Total Cost = X 1 Z 1 +X 2 Z 2 +X 3 Z 3 UE: travel cost on both links equivalent SO: minimize total travel cost

O D1 D2 Link 1 Flow = X 1 Cost = Z 1 Link 2 Flow = X 2 Cost = Z 2 Link 3 Flow = X 3 Cost = X 3 UE: x=.7 SO: x=.5

O D1 D2 Link 1 Flow = X 1 Cost = Z 1 Link 2 Flow = X 2 Cost = Z 2 Link 3 Flow = X 3 Cost = X 3 X 1 =4(1+x), X 3 =4x, X 2 =4(1-x) Z 1 =X 1 -1/2, Z 2 =3X 2 -1/2, Z 3 =1 Total Cost = X 1 Z 1 +X 2 Z 2 +X 3 Z 3 Total Cost = 2(1+x) 1/2 +6(1-x) 1/2 +4x

X 1 =4(1+x), X 3 =4x, X 2 =4(1-x) Total Cost = X 1 Z 1 +X 2 Z 2 +X 3 Z 3 Z 1 =X 1 -1/2, Z 2 =3X 2 -1/2, Z 3 =1 Total Cost = 2(1+x) 1/2 +6(1-x) 1/2 +4x Higher the flow, lower the per unit cost – economy of scale Which links have economies of scale?

x Total cost Total cost minimized at x=1 Total cost = 6.8 Want to send everything on the same route

Questions How does the length of a tour change with demand density? How does the number of drivers change with the length of a tour? How would you calculate the demand density with 30 minute time windows versus 2 hour time windows?

Tailored Strategies Tighter time windows for customers that are willing to pay more. Deliveries outside of peak travel periods. Allow transportation companies to expand their markets. Increase logistical complexity.