# 331-08 - Chapter 5: Transportation, Assignment and Network...

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

Chapter 5: Transportation, Assignment and Network Models

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

View Full Document
Transportation Problem Example Des Moines (100 units) capacity Cleveland (200 units) required Boston (200 units) required Evansville (300 units) capacity Ft. Lauderdale (300 units) capacity Albuquerque (300 units) required
The Transportation Model Decisions : How much to ship from each origin to each destination? Objective : Minimize shipping cost

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

View Full Document
Network Flow Models Consist of a network that can be represented with nodes and arcs 1. Transportation Model 2. Transshipment Model 3. Assignment Model 4. Maximal Flow Model 5. Shortest Path Model
Characteristics of Network Models A node is a specific location An arc connects 2 nodes Arcs can be 1-way or 2-way ( indicated by the arrow(s) )

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

View Full Document
Types of Nodes Origin nodes Destination nodes Transshipment nodes (or combinations) Decision Variables X AB = amount of flow (or shipment) from node A to node B
Flow Balance at Each Node Total inflow – Total outflow = Net inflow Node Type Net Flow Origin < 0 Destination > 0 Transshipment = 0

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## 331-08 - Chapter 5: Transportation, Assignment and Network...

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

View Full Document
Ask a homework question - tutors are online