| 1 |
Introduction, Overview |
|
| 2 |
Pedestrian Crossing Problem, Random Incidence |
Sections 2.13, 2.14 |
| 3 |
Pedestrian Crossing Problem, Buffon's Needle Experiment |
Sections 2.13, 2.14, 3.3.1 |
| 4 |
Functions of Random Variables I |
|
| 5 |
Crofton's Method |
Lecture Note, Section 3.5 |
| 6 |
Stick Breaking Problem, Two Dimensional Travel Problem, Travel with a Barrier Problem |
Lecture Note, Section 2.1 |
| 7 |
Geometrical Probability II |
|
| 8 |
Some Transportation Models |
|
| 9 |
Introduction to Queues: Little's Law |
|
| 10 |
Markov Birth-and-Death Queues |
|
| 11 |
More General Markov Queues |
|
| 12 |
The M/G/1 Queue and Extensions |
|
| 13 |
Congestions Pricing |
|
|
Quiz #1 |
|
| 14 |
Spatial M/G/1 Queueing Model |
Sections 5.1, 5.2, 5.3(excluding 5.3.5) |
| 15 |
Hypercube Queueing Model, Expected Travel Distances and Expected Travel Times |
Sections 5.4(excluding 5.4.5), 5.8 |
| 16 |
The Queue Inference Engine |
|
| 17 |
Introduction to Network Models |
Sections 6.1, 6.2(excluding 6.2.2 and 6.2.3), 6.3 |
| 18 |
Facility Location Problems |
|
| 19 |
Location Problems |
Section 6.5(excluding 6.5.6 and 6.5.7) |
| 20 |
Edge and Node Covering |
Section 6.4 |
| 21 |
Probabilistic Routing Problems |
Section 6.4 |
| 22 |
Simulating Randomness |
|
|
Quiz #2 |
|
| 23 |
Implementation |
|
| 24 |
Final Round Up! |
|