# Transportation Network Analysis - Institution: IIT Kanpur - Department: Civil Engineering - Teacher: Prof. Hemant Gehlot - Level: Undergraduate - Language: English - Subjects: Engineering - Source: [NPTEL](https://nptel.ac.in/courses/105104689) - Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.) - Syllabus: [at the source](https://nptel.ac.in/courses/105104689) - Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words) ## Lectures 1. [Lecture 1: Course overview, and optimization formulations of fence and shortest path problems](https://invisiblenetwork.ai/learn/nptel/105104689/3b5086ed6fee) (Video) 2. [Lecture 2: Optimization formulations of shortest path and sensor problems and linear programming](https://invisiblenetwork.ai/learn/nptel/105104689/41e163eb40a6) (Video) 3. [Lecture 3: Optimization formulations of knapsack, maximum coverage and travelling salesman problems](https://invisiblenetwork.ai/learn/nptel/105104689/a236a9bb0e39) (Video) 4. [Lecture 4: Alternative formulation of travelling salesman problem and introduction to complete matching problem](https://invisiblenetwork.ai/learn/nptel/105104689/5f34a15243dd) (Video) 5. [Lecture 5: Optimization formulations of complete matching and scheduling problems](https://invisiblenetwork.ai/learn/nptel/105104689/85410cd1c33d) (Video) 6. [Lecture 6: Continuation of scheduling problem; integer programming](https://invisiblenetwork.ai/learn/nptel/105104689/3250303050b3) (Video) 7. [Lecture 7: Branch-and-bound algorithms](https://invisiblenetwork.ai/learn/nptel/105104689/6b4a5417b500) (Video) 8. [Lecture 8: Analysis of algorithms and order of growth](https://invisiblenetwork.ai/learn/nptel/105104689/ecc910e61e4a) (Video) 9. [Lecture 9: Continuation of order of growth; polynomial-time algorithms](https://invisiblenetwork.ai/learn/nptel/105104689/35906979c61b) (Video) 10. [Lecture 10: Continuation of polynomial-time algorithms; Dijkstra's algorithm](https://invisiblenetwork.ai/learn/nptel/105104689/86b552cd2278) (Video) 11. [Lecture 11: Minimum spanning tree, Kruskal's algorithm and Prim's algorithm](https://invisiblenetwork.ai/learn/nptel/105104689/c0864c237af3) (Video) 12. [Lecture 12: Approximation algorithm for travelling salesman problem and local search algorithms](https://invisiblenetwork.ai/learn/nptel/105104689/457a814a68dd) (Video) 13. [Lecture 13: Continuation of local search algorithms; vehicle routing problem with splitable demand](https://invisiblenetwork.ai/learn/nptel/105104689/78694aaeb0de) (Video) 14. [Lecture 14: Continuation of vehicle routing problem with splittable demand; vehicle routing problem with unsplittable demand](https://invisiblenetwork.ai/learn/nptel/105104689/ae691d116f50) (Video) 15. [Lecture 15: Continuation of vehicle routing problem with splittable demand; vehicle routing problem with unsplittable demand](https://invisiblenetwork.ai/learn/nptel/105104689/5995afb8e89a) (Video) 16. [Lecture 16: Continuation of genetic algorithms](https://invisiblenetwork.ai/learn/nptel/105104689/059d9eecadc3) (Video) 17. [Lecture 17: Continuation of genetic algorithms](https://invisiblenetwork.ai/learn/nptel/105104689/fbe3a9c1061e) (Video) 18. [Lecture 18: Introduction to traffic assignment (user equilibrium)](https://invisiblenetwork.ai/learn/nptel/105104689/4b316799ae6b) (Video) 19. [Lecture 19: Continuous optimization (unconstrained)](https://invisiblenetwork.ai/learn/nptel/105104689/61eb905daf89) (Video) 20. [Lecture 20: Continuation of unconstrained optimization](https://invisiblenetwork.ai/learn/nptel/105104689/94da2b19efe8) (Video) 21. [Lecture 21: Continuous optimization (constrained); first-order conditions for single variable problems](https://invisiblenetwork.ai/learn/nptel/105104689/f1b5cce80ba5) (Video) 22. [Lecture 22: Continuation of first-order conditions for single variable problems; general first-order conditions](https://invisiblenetwork.ai/learn/nptel/105104689/f603c076f4ef) (Video) 23. [Lecture 23: Continuation of general first-order conditions; case of nonnegativity and linear equality constraints](https://invisiblenetwork.ai/learn/nptel/105104689/0b9f6257ef08) (Video) 24. [Lecture 24: Sufficiency conditions and user equilibrium as an optimization problem](https://invisiblenetwork.ai/learn/nptel/105104689/f3ece84409f2) (Video) 25. [Lecture 25: Equivalency and uniqueness conditions](https://invisiblenetwork.ai/learn/nptel/105104689/5c537e57dc05) (Video) 26. [Lecture 26: System Optimization](https://invisiblenetwork.ai/learn/nptel/105104689/1bbe46247f97) (Video) 27. [Lecture 27: Continuation of system optimization; Braess's paradox](https://invisiblenetwork.ai/learn/nptel/105104689/89782cc6d818) (Video) 28. [Lecture 28: Price of anarchy and optimization algorithms (golden section method)](https://invisiblenetwork.ai/learn/nptel/105104689/5cfcf30f0659) (Video) 29. [Lecture 29: Bisection method and convex combinations method](https://invisiblenetwork.ai/learn/nptel/105104689/8cd3f9bb5dc5) (Video) 30. [Lecture 30: Continuation of convex combinations method](https://invisiblenetwork.ai/learn/nptel/105104689/b5ce7ed06bd9) (Video) 31. [Lecture 31: Solving UE using convex combinations method](https://invisiblenetwork.ai/learn/nptel/105104689/108ef0d3d59a) (Video) 32. [Lecture 32: Theory of discrete choice models; multinomial Logit model](https://invisiblenetwork.ai/learn/nptel/105104689/cbde4c84eb86) (Video) 33. [Lecture 33: Continuation of multinomial Logit model; multinomial Probit model](https://invisiblenetwork.ai/learn/nptel/105104689/f69e6bfff752) (Video) 34. [Lecture 34: Satisfaction function and route choice](https://invisiblenetwork.ai/learn/nptel/105104689/251472bd0538) (Video) 35. [Lecture 35: Continuation of route choice; Logit based loading](https://invisiblenetwork.ai/learn/nptel/105104689/e4e37015d95f) (Video) 36. [Lecture 36: Continuation of Logit based loading; Probit based loading](https://invisiblenetwork.ai/learn/nptel/105104689/3b36c65417d4) (Video) 37. [Lecture 37: Continuation of Probit based loading; stochastic user equilibrium](https://invisiblenetwork.ai/learn/nptel/105104689/b5113b491e8c) (Video) 38. [Lecture 38: Continuation of stochastic user equilibrium](https://invisiblenetwork.ai/learn/nptel/105104689/15100876de04) (Video) 39. [Lecture 39: Method of successive averages](https://invisiblenetwork.ai/learn/nptel/105104689/897dca3b0387) (Video) 40. [Lecture 40: Continuation of method of successive averages; Two-link interactions in UE](https://invisiblenetwork.ai/learn/nptel/105104689/c3f99e18132d) (Video) 41. [Lecture 41: Optimization formulation and first-order conditions for two-link interactions](https://invisiblenetwork.ai/learn/nptel/105104689/3cf4804bafcd) (Video) 42. [Lecture 42: Uniqueness and convex combinations method for two-link interactions](https://invisiblenetwork.ai/learn/nptel/105104689/fa60f9389356) (Video) 43. [Lecture 43: Generalization to multi-link interactions](https://invisiblenetwork.ai/learn/nptel/105104689/0fe52aa23af9) (Video) 44. [Live Session 30-08-2025](https://invisiblenetwork.ai/learn/nptel/105104689/3b5086ed6fee-2) (Video)