Trasportation problem
Applications of OR Techniques in Transportation.
What is OR ?
to decision making problems”, etc. But only a few are widely accepted.
--- H.A.Taha
--- T.L.Saaty
OR Models in Transportation
Transportation Model
Mathematical formulation.
Minimize
Subject to
For feasible solution to exist, it is necessary that total supply equals total requirement (Rim condition), i.e.,
Feasible & optimal solution Algorithms
(very close to optimal solution)
Example Problem in TM
Cargo units have to be air lifted by there aircraft from three airports and dropped to five destinations. The quantities that can be carried in one trip by these aircraft to each of these destinations are given. The total number of trips that the aircraft can make to destinations are also given. Find the number of trips each aircraft should make to each destination so that the total quantity of cargo transported is a maximum.
| D1 | D2 | D3 | D4 | D5 | Trip/A/c |
A1 | 10 | 8 | 6 | 9 | 12 | 50 |
A2 | 5 | 3 | 8 | 4 | 10 | 90 |
A3 | 7 | 9 | 6 | 10 | 4 | 60 |
Trip/des | 100 | 80 | 70 | 40 | 20 | |
50 10 | 8 | 6 | 9 | 12 |
5 | 3 | 70 8 | 4 | 20 10 |
7 | 20 9 | 6 | 40 10 | 4 |
50 0 | 60 0 | 0 | 0 | 0 |
Assignment Problem
The assignment problem is a special case of the TM in which the objective is to assign a number of origins to the equal number of destinations at a minimum cost (or maximum profit ). The basic assumption that the optimum solution to an assignment problem
remains unaltered if a constant is added / subtracted to / from
any row or column of the effective matrix.
An airline, operating seven days a week, serves three cites A, Band C according to the schedule shown in the table. The layover cost per stop is roughly proportional to the square of the layover time. How should plane be assigned the flights so as o minimize the total layover cost ?
Inventory Models
Deterministic models, Probabilistic models.
Probabilistic Model
Thank You !