331-10 - Chapter 5 Transportation Assignment and Network Models(Maximum Flow Shortest Route The Maximal-Flow Model Networks have arcs with limited

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

View Full Document Right Arrow Icon
Chapter 5: Transportation, Assignment and Network Models (Maximum Flow, Shortest Route)
Background image of page 1

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

View Full DocumentRight Arrow Icon
The Maximal-Flow Model Networks have arcs with limited capacity, such as roads or pipelines Business applications: Traffic and transportation control Airline scheduling Image segmentation Project selection Census tabulation Hurricane evacuation
Background image of page 2
Max Flow Problem Formulation Decisions: How much flow on each arc? Objective: Maximize flow through the network from an origin to a destination
Background image of page 3

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

View Full DocumentRight Arrow Icon
Max Flow Problem Formulation There is a “wrinkle” in the set-up of these applications: Since the notion of “flow” is continuous, there is really no meaning to a destination node . So, we create “flow” by adding an hypothetical arc or path that connects the ending (destination) node BACK to the start (origin). This dummy arc has unlimited capacity so as not to constrain the solution.
Background image of page 4
Road Network Example
Background image of page 5

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

View Full DocumentRight Arrow Icon
Modified Road Network Arc Split dummy arc to  measure the  total flow
Background image of page 6
X ij = number of cars per hour flowing from node i to node j Dummy Arc The X 61 arc was created as a “dummy” arc to measure the total flow from node 6 to node 1. (Do you see why this ALSO measures 1 to 6?)
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 08/29/2011 for the course ACCT 331 taught by Professor A during the Spring '11 term at Ohio State.

Page1 / 24

331-10 - Chapter 5 Transportation Assignment and Network Models(Maximum Flow Shortest Route The Maximal-Flow Model Networks have arcs with limited

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