IIT Kanpur · Engineering

Transportation Network Analysis

Prof. Hemant Gehlot · 44 free video lectures

44 video lectures. Topics: Course overview, and optimization formulations of fence and shortest path problems; Optimization formulations of shortest path and sensor problems and linear programming; Optimization formulations of knapsack, maximum coverage and travelling salesman problems; Alternative…

▶ Play on Open Lecture HallCourse page ↗

Lectures

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

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kanpur.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights