Shortest

Shortest-Route Problem
• The shortest-route problem is concerned with finding the

shortest path in a network from one node (or set of nodes)
to another node (or set of nodes).
• If all arcs in the network have nonnegative values, then a
labeling algorithm can be used to find the shortest paths
from a particular node to all other nodes in the network.
• The criterion to be minimized in the shortest-route problem
is not limited to distance even though the term "shortest" is
used in describing the procedure. Other criteria include
time and cost. (Neither time nor cost are necessarily
linearly related to distance.) Example: Shortest-Route
Susan Winslow has an important business meeting in Paducah

this evening. She has a number of alternate routes by which
she can travel from the company headquarters in Lewisburg to
Paducah. The network of alternate routes and their respective
travel time, ticket cost, and transport mode appear on the next
two slides.
If Susan earns a wage of $15 per hour, what route should she
take to minimize the total travel cost?
Maximal Flow Problem
• The maximal flow problem is concerned with

determining the maximal volume of flow from one node
(called the source) to another node (called the sink).
• In the maximal flow problem, each arc has a maximum
arc flow capacity which limits the flow through the arc.
• A capacitated transshipment model can be developed Example: Maximal Flow
for the maximal flow problem.
National Express operates a fleet of cargo planes and
• We will add an arc from the sink node back to the
is in the package delivery business. NatEx is interested
source node to represent the total flow through the
in knowing what is the maximum it could transport in
network.
one day indirectly from San Diego to Tampa (via
• There is no capacity on the newly added sink-to-source
Denver,St. Louis, Dallas, Houston and/or Atlanta) if its
arc.
direct flight was out of service.
• We want to maximize the flow over the sink-to-source
arc. NatEx's indirect routes from San Diego to Tampa,
along with their respective estimated excess shipping
LP Formulation
capacities (measured in hundreds of cubic feet per day),
(As Capacitated Transshipment Problem) are shown on the next slide.
• There is a variable for every arc. Is there sufficient excess capacity to indirectly ship
• There is a constraint for every node; the flow out 5000 cubic feet of packages in one day?
must equal the flow in.
• There is a constraint for every arc (except the added
sink-to-source arc); arc capacity cannot be
exceeded.
• The objective is to maximize the flow over the
added, sink-to-source arc.
LP Formulation
• 18 variables (for 17 original arcs and 1 added

arc)
• 24 constraints
o 7 node flow-conservation constraints
o 17 arc capacity constraints (for original
arcs)
A Production & Inventory Application
Transportation and transshipment models can be developed for

applications that have nothing to do with the physical movement of
goods from origins to destinations.
For example, a transshipment model can be used to solve a

production and inventory problem.
Example: Production & Inventory Application
• Fodak must schedule its production of camera film for the first
four months of the year. Film demand (in 000s of rolls) in
January, February, March and April is expected to be 300, 500,
650 and 400, respectively. Fodak's production capacity is 500
thousand rolls of film per month.
• The film business is highly competitive, so Fodak cannot afford
to lose sales or keep its customers waiting. Meeting month i's
demand with month i+1's production is unacceptable.
• Film produced in month i can be used to meet demand in
month i or can be held in inventory to meet demand in month
i+1 or month i+2 (but not later due to the film's limited shelf
life). There is no film in inventory at the start of January.
• The film's production and delivery cost per thousand rolls will
be $500 in January and February. This cost will increase to $600
in March and April due to a new labor contract. Any film put in
inventory requires additional transport costing $100 per
thousand rolls. It costs $50 per thousand rolls to hold film in
inventory from one month to the next.

Shortest

Uploaded by

Copyright:

Available Formats

Shortest

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Shortest

Uploaded by

Copyright:

Available Formats

Shortest-Route Problem

• The shortest-route problem is concerned with finding the

Susan Winslow has an important business meeting in Paducah

• The maximal flow problem is concerned with

• 18 variables (for 17 original arcs and 1 added

Transportation and transshipment models can be developed for

For example, a transshipment model can be used to solve a

Example: Production & Inventory Application

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.