
Lecture 5 of 43 · Transportation Network Analysis
Hemant Gehlot
Transportation Network Analysis · 43 lectures
43 lectures
1: Course overview, and optimization formulations of fence
2: Optimization formulations of shortest path and sensor
3: Optimization formulations of knapsack
4: Alternative formulation of travelling salesman problem
5: Optimization formulations of complete matching
6: Continuation of scheduling problem; integer programming
7: Branch-and-bound algorithms
8: Analysis of algorithms and order of growth
9: Continuation of order of growth; polynomial-time algorithms
10: Continuation of polynomial-time algorithms
11: Minimum spanning tree, Kruskal’s algorithm and Prim’s
12: Approximation algorithm for travelling salesman problem
13: Continuation of local search algorithms
14: Continuation of vehicle routing problem with splittable
15: Continuation of vehicle routing problem with unsplittable
16: Continuation of genetic algorithms
17: Continuation of genetic algorithms
18: Introduction to traffic assignment (user equilibrium)
19: Continuous optimization (unconstrained)
20: Continuation of unconstrained optimization
21: Continuous optimization (constrained)first-order
22: Continuation of first-order conditions for single variable
23: Continuation of general first-order conditions
24: Sufficiency conditions and user equilibrium as
25: Equivalency and uniqueness conditions
26: System optimization
27: Continuation of system optimization; Braess’s paradox
28: Price of anarchy and optimization algorithms (golden
29: Bisection method and convex combinations method
30: Continuation of convex combinations method
31: Solving UE using convex combinations method
32: Theory of discrete choice models; multinomial Logit model
33: Continuation of multinomial Logit model
34: Satisfaction function and route choice
35: Continuation of route choice; Logit based loading
36: Continuation of Logit based loading; Probit based loading
37: Continuation of Probit based loading
38: Continuation of stochastic user equilibrium
39: Method of successive averages
40: Continuation of method of successive averages
41: Optimization formulation and first-order conditions
42: Uniqueness and convex combinations method for two-link
43: Generalization to multi-link interactions