National Institute of Technology Rourkela

राष्ट्रीय प्रौद्योगिकी संस्थान राउरकेला

ଜାତୀୟ ପ୍ରଯୁକ୍ତି ପ୍ରତିଷ୍ଠାନ ରାଉରକେଲା

An Institute of National Importance
NIT Rourkela Inside Page Banner

Syllabus

Course Details

Subject {L-T-P / C} : CE6341 : Optimization In Transportation Network { 3-0-0 / 3}

Subject Nature : Theory

Coordinator : Prasanta Kumar Bhuyan

Syllabus

Module 1 :

Module I – Basics of Optimization for Transportation Network Analysis (6 hours)
General methods for operation research models introduction to linear and non-linear programming formulation of different models.
Module II – Transportation Network Analysis (6 hours)
Network definition and network diagram representation, network attributes, minimum spanning tree, maximum flow, and minimum cost network flow problems.
Module III – Linear Programming (LP) in Transportation (6 hours)
Introduction to LP and formulation of linear programming problems, graphical solution method, alternative or multiple optimal solutions, unbounded solutions, infeasible solutions, maximization – simplex algorithms.
Module IV – Mathematical Optimization for Transportation Network (8 hours)
Optimality Criteria for Unconstrained Problems, Optimality Criteria for Constrained Problems, Optimality Criteria for General Optimization Problems, Post optimality Analysis, Multicriteria Optimization, and Optimization on Fuzzy Sets.
Module V – Applications for Transportation Problems (10 hours)
Applications of min-cost, max-flow, and shortest path algorithms to transportation and infrastructure networks: transportation networks, airline, freight, facility location, logistics, network design, project scheduling, reliability of distribution systems, etc.

Course Objective

1 .

To learn the fundamental definitions of networks.

2 .

To study the different Shortest Path Algorithms and network assignment techniques.

3 .

To understand the concept of linear programming system of optimization.

4 .

To become familiar with mathematical formulation, analytical properties, and algorithms of network models. and To understand the applications of different optimization techniques in transportation problem-solving.

Course Outcome

1 .

After the completion of this course, students will be able to:
CO1 Define, analyze, and characterize different types of networks based on network properties.
CO2 Apply the shortest path and minimum cost algorithms to solve transportation problems
CO3 Formulate, analyze, and solve real-world transportation problems using transportation network analysis methods.
CO4 Understand the concepts of road network equilibrium and optimization techniques.
CO5 Carry out mathematical optimization for transportation road network flow analysis

Essential Reading

1 .

F. H. Hillier and G. J. Liberman, Introduction to Operations Research, Tata McGraw-Hill , 2010 edition or the latest

2 .

S. S. Rao, Engineering Optimization: Theory and Practice, Wiley & Sons, New Jersey , 2009 edition or the latest

Supplementary Reading

1 .

Ahuja, R., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms and Application, Prentice Hall, New Jersey , 1993 edition or the latest

2 .

Bell, M.G., Transportation Networks, Elsevier Science Publishers , 1999 edition or the latest

Journal and Conferences

2 .

World Conference on Transportation Research

1 .

Transportation Research Record (TRR) Journals, Transportation Research Board Annual Meeting