Scribd
Upload
37 views

Transportation and Assignment Probelm

The document discusses transportation and assignment problems, which involve optimally matching resources like jobs, machines, and freight between locations to minimize costs or distances. It provides an example of a transportation problem involving shipping oranges between three farms and three cities, and defines the decision variables, objective function, and constraints. It also presents an example assignment problem involving assigning five jobs to five employees to minimize total costs.

Uploaded by

cena5760
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

Transportation and Assignment Probelm

The document discusses transportation and assignment problems, which involve optimally matching resources like jobs, machines, and freight between locations to minimize costs or distances. It provides an example of a transportation problem involving shipping oranges between three farms and three cities, and defines the decision variables, objective function, and constraints. It also presents an example assignment problem involving assigning five jobs to five employees to minimize total costs.

Uploaded by

cena5760
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Transportation and Assignment Problems

Xij
Transportation problem
Importance of the problem

• About 6.3% of GDP is contributed by the transport industry and is primarily


dominated by the road sector. Freight, as the basis of transportation industry, is
closely related to GDP development.

• As the fundamental and leading industry for national economic and social
development, the development of transportation industry determines the trend
of economic development and reflects the cyclical changes of national economy.

• Gao et al (2016) reports, the volume of freight traffic and freight turnover of China
are positively correlated with GDP.
Example
A
Transportation
Problem:
Tropicsun
Defining the Decision Variables
• Xij = # of bushels shipped from node i to node j

• Specifically, the nine decision variables are:


• X14 = # of bushels shipped from Mt. Dora (node 1) to Ocala (node 4)
• X15 = # of bushels shipped from Mt. Dora (node 1) to Orlando (node 5)
• X16 = # of bushels shipped from Mt. Dora (node 1) to Leesburg (node 6)
• X24 = # of bushels shipped from Eustis (node 2) to Ocala (node 4)
• X25 = # of bushels shipped from Eustis (node 2) to Orlando (node 5)
• X26 = # of bushels shipped from Eustis (node 2) to Leesburg (node 6)
• X34 = # of bushels shipped from Clermont (node 3) to Ocala (node 4)
• X35 = # of bushels shipped from Clermont (node 3) to Orlando (node 5)
• X36 = # of bushels shipped from Clermont (node 3) to Leesburg (node 6)
Defining the Objective Function

Minimize the total number of bushel-miles


• MIN: 21X14 + 50X15 + 40X16 + 35X24 + 30X25 + 22X26 + 55X34 + 20X35 + 25X36
Defining the Constraints
• Capacity constraints
X14 + X24 + X34 <= 200,000 } Ocala
X15 + X25 + X35 <= 600,000 } Orlando
X16 + X26 + X36 <= 225,000 } Leesburg
• Supply constraints
X14 + X15 + X16 = 275,000 } Mt. Dora
X24 + X25 + X26 = 400,000 } Eustis
X34 + X35 + X36 = 300,000 } Clermont
• Nonnegativity conditions
Xij >= 0 for all i and j
 Involve the matching or pairing of
two sets of items such as

The o jobs and machines

Assignment- o secretaries and reports

type Problems o lawyers and cases, and so forth

 Have different cost or time


requirements for different pairings
Example of Assignment Problem

• A manager has prepared a table that shows the cost of performing each of
five jobs by each of five employees (see Table in next slide).
• According to this table, job 1 will cost Rs.1500 if done by Raman, Rs.2000
if it is done by Shama, and so on. The manager has stated that his goal is
to develop a set of job assignments that will minimize the total cost of
getting all four jobs done. It is further required that the jobs be
performed simultaneously, thus requiring one job being assigned to each
employee.
Numerical Employee
Example for the RAMAN SHAMA ABDULLA STEPHEN PANKAJ
Assignment
1 15 20 18 24 19
Problem
( cost in 00’ 2 12 17 16 15 14
rupees) JOB 3 14 15 19 17 18
4 11 14 12 13 15
5 13 16 17 18 16
Example of Assignment Problem
In the past, to find the minimum-cost set of assignments, the
manager has resorted to listing all of the different possible
assignments (i.e., complete enumeration) for small problems such
as this one. But for larger problems, the manager simply guesses
because there are too many possibilities to try to list them.

For example, with a 5X5 table, there are 5! = 120 different


possibilities; but with, say, a 7X7 table, there are 7! = 5,040
possibilities.

You might also like