INDE2002

INDE2002: Network Optimisation for Transport and Logistics

Science and Engineering

Student reviews for INDE2002 at Curtin University. See ratings, workload, grades, and honest feedback from Curtin students.

View in Curtin Handbook

About this Unit

The unit focuses on 4 core topics in network optimisation: minimum-cost flow problems, optimal fleet sizing, arc routing problems, and node routing problems. For minimum-cost flow problems, areas covered include the standard problem formulation, shortest path problems, maximum flow problems, transportation problems, assignment problems, and the network simplex algorithm. For optimal fleet sizing, areas covered include deterministic and stochastic formulations, left and right derivatives, convex analysis, and the golden section method. For arc routing problems, the areas covered include the Chinese postman problem, Fluery's algorithm, Floyd-Warshall algorithm, matchings, and Euler tours. Finally, for node routing problems, the areas covered include the travelling salesman problem, heuristic methods and lower bound techniques.

Quick Tips

One-line things worth knowing. No full review required.

No tips yet. Be the first to share one.

Unit Details

Credits25

Contact Hours4 Weekly

Result TypeGrade/Mark

AreaSchool of Electrical Engineering, Computing and Mathematical Sciences (EECMS) (1153)

Field of Education030703 Industrial Engineering

Handbook View Official Handbook Page →

Tuition Pattern

Lecture1 x 2 hours weekly
Tutorial1 x 1 hour weekly
Workshop1 x 1 hour weekly

Student Reviews

No reviews yet. Be the first to write one!