文档介绍：Session 8 运筹学Operations Research 8-1
运筹学运筹学
Operations Research Operations Research
Transportation
T
A2 3
11 B1
8 Transportation and Assignment 7 T 4
4 1 16
14 5
Problems 2 5 T4
A1 B4 6 7 B2
8 3
3 4
16
7 2 2 7
T2 B
6 8 3
T
A3 5
江西财经大学信息管理学院©2006 江西财经大学信息管理学院©2006
School of Information Technology, JiangXi University of Finance & Economics©2006 1 School of Information Technology, JiangXi University of Finance & Economics©2006 2
运筹学 The Transportation Problem 运筹学 The Transportation Problem
Operations Research The Transportation Problem Operations Research The Transportation Problem
Assignment
The transportation problem
Each task required time (hours)
A streamlined simplex method for the
workers Task 1 Task 2 Task 3 Task 4 Wage per hour transportation problem
Ann 35 41 27 40 $14
Ian 47 45 32 51 12 The assignment problem
Joan 39 56 36 43 13 Conclusions
Sean 32 51 25 46 15
江西财经大学信息管理学院©2006 江西财经大学信息管理学院©2006
School of Information Technology, JiangXi University of Finance & Economics©2006 3 School of Information Technology, JiangXi University of Finance & Economics©2006 4
运筹学 The Transportation Problem 运筹学 The Transportation Problem
Operations Research The Transportation Problem Operations Research The Transportation Problem
The Transportation Problem 1. Prototype Example
The transportation problem: is defined as from P&PANY is canned peas. The peas are prepared at
some sources to shipment goods to destinations, three canneries (near Bellingham; Eugene; and Albert Lea;) and
then shipped by truck to four distributing warehouses in the
and determining how to optimally transport goods western United States (Sacramento, California; Salt Lake City,
to minimize the total shipping cost. Albuquerque.)
The algorithms to solved transportation problem Because the shipping costs are a major expense, management
is initiating a study