Network Optimization

1
Network Optimization

• TMR4115
• Thursday, Nov 14 2003
• Prof. Stein Ove Erikstad

2
(No Transcript)
3
Vocabulary

• Nodes the platforms
• Arcs the pipelines
• Directed or undirected arc
• Directed and undirected networks
• Path - sequence of arcs connecting two nodes
• Directed and undirected path
• Cycle (directed or undirected)
• Connected/unconnected network
• Arc capacity
• Supply node, demand node, transshipment node

Directed arc
Cycle
4
Problem types

• Shortest path
• Minimum spanning tree
• Maximum flow
• Minimum cost flow

5
Shortest Path - Algorithm
6

• Blackboard calculation
• Excel solution

7
Minimum spanning tree

• Assumptions
• Undirected, connected network
• postive length distance between each node
• Objective
• Provide a path between each pair of nodes
• Minimize the total length
• Algorithm
• Greedy, i.e. we may make a decision without
  worrying about the effect on subsequent decisions
• 1. Select the shortest link in the network
• 2. Select the shortest link to an unconnected
  node from any currently linked node

8
2
4
5
2
1
7
4
4
3
1
7
5
9
2
4
5
2
1
7
4
4
3
1
7
5
10
(No Transcript)