MIT1_258JS10_lec17

MIT1_258JS10_lec17 - utline Outline 1. Service Planning...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: utline Outline 1. Service Planning Hierarchy 2. Introduction to Scheduling . 3. requency Determination Frequency Determination current practice simple rules 4. Optimization formulation for independent routes . 5. euristic for complex overlapping networks Heuristic for complex overlapping networks Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 1 Frequency Determination Service Planning Hierarchy Input Function Output Infrastructure Resources Policies (e.g. coverage) Demand characteristics Resources Policies (e.g. headways and pass loads) Route travel times Demand characteristics Resources Policies (e.g. reliability) Route travel times Resources Policies (e.g. reliability) Work rules and pay provisions Resources Policies Demand characteristics Set of Routes Network and Route Design Service Frequency by Route, day, and time period Frequency Setting Departure/Arrival times for individual trips on each route Timetable Development Revenue and Non-revenue Activities y Vehicle Vehicle Scheduling by Vehicle Crew Duties Crew Scheduling Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 2 N t k D Network Design Frequency Setting Timetable Development Vehicle Scheduling Crew Scheduling Decisions Dominate Dominate Frequent Cost Computer-Based Decisions Considerations Analysis Dominates Dominate Dominate Service Judgement & Infrequent Considerations Manual Analysis Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 3 Service Planning Hierarchy of equence of steps: Sequence steps: 1. Determine Running Times and Layovers based on: running time data desired reliability levels 2. etermine Frequencies by route and time period Determine Frequencies by route and time period 3. Determine # of vehicles by time period, focusing on: olicies affecting integer constraints policies affecting integer constraints revise step 1 and 2 decisions as needed focus on transition periods Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 4 Introduction to Scheduling of equence of steps: Sequence steps: 4. Determine timetable, typically: start at peak load point generate start and end times hain vehicle trips together to form vehicle blocks blocks 5. Chain vehicle trips together to form vehicle 6. Cut and combine vehicle blocks to form crew duties or runs. Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 5 Introduction to Scheduling A. Integrality constraints: If book times are 26 mins each way, recovery time is 5 mins at each terminus, and desired frequency is 10 per hour: Trade-off between shortening cycle time by 2 mins to save 1 ehicle or not? vehicle, or not? In a similar case, but if desired frequency is 1 per hour, hoice is to: choice is to: shorten cycle time by 2 mins, or interline with another route having cycle time of 58 mins or less Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 17 6 Common Issues B. cost of additional B. Marginal cost of additional trips:B....
View Full Document

This note was uploaded on 12/06/2011 for the course ESD 11.380j taught by Professor Fredsalvucci during the Fall '02 term at MIT.

Page1 / 26

MIT1_258JS10_lec17 - utline Outline 1. Service Planning...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online