Successive_Shortest_Path

Successive_Shortest_Path - 15.082J and 6.855J Successive...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 15.082J and 6.855J Successive Shortest Path Algorithm
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 The Original Costs and Node Potentials 1 2 3 5 4 4 1 2 2 5 6 7 0 0 0 0 0
Background image of page 2
3 The Original Capacities and Supplies/Demands 1 2 3 5 4 10 20 20 25 25 20 30 23 5 -2 -7 -19
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Select a supply node and find the shortest paths 1 2 3 5 4 4 1 2 2 5 6 7 7 0 6 8 8 shortest path distance The shortest path tree is marked in bold and blue.
Background image of page 4
5 Update the Node Potentials and the Reduced Costs 1 2 3 5 4 4 1 2 2 5 6 7 0 -7 -8 -8 -6 0 0 0 0 6 3
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Send Flow From a Supply Node to a Demand Node Along Shortest Paths (along arcs with reduced costs of 0) 1 2 3 5 4 10 20 20 25 25 20 30 23 5 -2 -7 -19 send 7 units from node 1 to node 3 Arc numbers are residual capacities. Red arcs have a reduced cost of 0
Background image of page 6
7 Update the Residual Network 1 2 3 5 4 10 20 20 25 25 30 23 5 -2 -7 -19 Arc (3,1) has a reduced cost of 0 7 16 0 If an arc is added to G(x), then it has a reduced cost of 0, and it is red. Arcs in the residual network will always have a non-negative reduced cost
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 A comment At this point, one would choose a source node, and
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/05/2010 for the course EE 15.082 taught by Professor Orlin during the Spring '10 term at Visayas State University.

Page1 / 24

Successive_Shortest_Path - 15.082J and 6.855J Successive...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online