Logistical and Transportation Planning Methods
Course facts
- Payment: Free, no certificate
- Credits: Non Credit
- Learning style: Self-paced, start anytime
- Resources: Exam Solutions; Exams; Lecture Notes; Problem Set Solutions; Problem Sets
MIT OpenCourseWare details
- As taught in: Fall 2006
- Department: Civil and Environmental Engineering, Electrical Engineering and Computer Science, Sloan School of Management, Aeronautics and Astronautics, Engineering Systems Division
| Course Details | ||||||
|---|---|---|---|---|---|---|
|
||||||
| Outcomes | ||||||
|
||||||
| Price & Terms | ||||||
|
||||||
| Technical | ||||||
|
||||||
| Specification | ||||||
|
||||||
Apply queueing, geometrical probability and network location models to transport planning and urban services such as fire and ambulance dispatch.
Where should a city station its ambulances, and how long will callers wait when every unit is busy? This graduate class answers questions like these with probability and operations research. Queueing models, spatial location theory and network analysis are applied to urban services and to air, ocean and highway transport.
What You Will Achieve
- Model travel distances with functions of random variables and geometrical probability
- Analyze congestion using Markov queues, the M/G/1 queue and Little’s Law
- Locate emergency service units with the Hypercube queueing model
- Solve node covering, edge covering and location problems on networks
Program Overview
Random Variables and Geometry
A pedestrian crossing problem opens the probability tools used throughout.
- Pedestrian crossing problem
- Functions of random variables
- Geometrical probability
Queues and Congestion
Waiting lines are built up in steps and then tied to transport.
- Little’s Law and Markov birth-and-death queues
- The M/G/1 queue and extensions
- Congestion pricing
- Queueing networks and dynamic queues
Hypercube, Networks and Location
The last sessions decide where facilities and vehicles should go.
- Hypercube queueing model and practice
- Node and edge covering
- Location problems and probabilistic routing
- Simulating randomness and implementation
Course Completion
Job Outlook
These methods apply in transportation planning, logistics analysis and the design of public services such as fire, police and emergency medical response.
Good for: Graduate students and analysts comfortable with probability who want to model transport and urban service systems.
Keep in mind: From fall 2006, with lecture notes, six problem sets and quizzes from 2000 to 2006, but no videos. The Larson and Odoni textbook is separate, though its 1981 edition is online.
Bottom line: A rigorous, problem-driven route into urban operations research, with seven years of quiz papers to practice on.
Frequently Asked Questions
What is the Hypercube queueing model used for?
It gets three sessions as a way to analyze spatially distributed services, the kind of system a fire or emergency medical department runs.
How much practice material is there?
Six problem sets with solutions, plus quiz papers from each year from 2000 through 2006, most years with two quizzes.
Which book does the class follow?
Urban Operations Research by Richard Larson and Amedeo Odoni. The 2007 edition is the textbook, and the page says the 1981 edition can be read online.
User Reviews
No reviews yet. Be the first to review this course.
Write your review Cancel reply
You must be logged in to post a review.
Reviews can only be posted by registered learners. Log in, then you will return here to post.



There are no reviews yet.