15successiveshortestpath

15successiveshortestpath - 15.082 and 6.855J The Successive...

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

View Full Document Right Arrow Icon
1 15.082 and 6.855J The Successive Shortest Path Algorithm and the Capacity Scaling Algorithm for the Minimum Cost Flow Problem
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 Pseudo-Flows A pseudo-flow is a "flow" vector x such that 0 x u. Let e(i) denote the excess (deficit) at node i. The infeasiblity of the pseudo-flow is e(i)>0 e(i).
Background image of page 2
3 Supplies/Demands, Capacities, and Flows 1 2 3 5 4 10, 5 5- 2 20, 0 25, 13 20, 20 30, 3 23 What is e(i) for each node i? What is the infeasibility of the flow? 20, 0 25, 0 -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 Optimality Conditions Let π be a vector of node potentials. Let x be a pseudo-flow. For each arc (i,j) G(x), the reduced cost of (i,j) is c π ij = c ij - π i + π j . We say that a pseudo-flow x satisfies the optimality conditions (is dual feasible ) if c π ij 0 for each (i,j) G(x). Overview of the algorithm Start with a pseudo-flow x that satisfies the optimality conditions. At each iteration maintain the optimality conditions, but continually reduce the infeasibility. :
Background image of page 4
5 Maintaining optimality conditions 1 2 3 5 4 10 20 25 25 20 30 23 5 -2 Suppose that red arcs have a reduced cost of 0 A dual feasible network with excesses/deficits and capacities Optimality conditions are maintained if flow is sent on a red path. 20 -19 -7
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 Sending Flow Along Paths with Reduced Cost of 0 If each arc of P G(x) has a reduced cost of 0, then sending flow along P maintains the optimality conditions. To reduce infeasibility, send flow from an excess node to a deficit node. Next : how to ensure that there is a path whose reduced cost is 0.
Background image of page 6
Find a shortest path node from node i, and update potentials. current
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/15/2010 for the course IE 505 taught by Professor Yok during the Spring '10 term at Galatasaray Üniversitesi.

Page1 / 20

15successiveshortestpath - 15.082 and 6.855J The Successive...

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

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