Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Assignment & TSP

    Uploaded by

    Rajib Debnath
    The second document shows two assignment models, one that minimizes costs and one that maximizes profits, for assigning five people (A, B, C, D, E) to five jobs (I, II, III, IV, V). The cost minimization model results in a total cost of $42 while the profit maxim

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Assignment & TSP

    Uploaded by

    Rajib Debnath
    12 views16 pages
    The second document shows two assignment models, one that minimizes costs and one that maximizes profits, for assigning five people (A, B, C, D, E) to five jobs (I, II, III, IV, V). The cost minimization model results in a total cost of $42 while the profit maxim

    Original Description:

    tsp

    Original Title

    3. Assignment & TSP

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The second document shows two assignment models, one that minimizes costs and one that maximizes profits, for assigning five people (A, B, C, D, E) to five jobs (I, II, III, IV, V). The cost minimization model results in a total cost of $42 while the profit maxim

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    12 views16 pages

    Assignment & TSP

    Uploaded by

    Rajib Debnath
    The second document shows two assignment models, one that minimizes costs and one that maximizes profits, for assigning five people (A, B, C, D, E) to five jobs (I, II, III, IV, V). The cost minimization model results in a total cost of $42 while the profit maxim

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 16

    Assignment Model

    Cost Minimization

    JOB

    I II III IV V

    A 8 4 2 6 1

    B 0 9 5 5 4
    PERSON

    C 3 8 9 2 6

    D 4 3 1 0 3

    E 9 5 8 9 5
    Assignment Model

    JOB

    I II III IV V

    A 7 3 1 5 0

    B 0 9 5 5 4
    PERSON

    C 1 6 7 0 4

    D 4 3 1 0 3

    E 4 0 3 4 0
    Assignment Model
    JOB

    I II III IV V

    A 7 3 0 5 0

    B 0 9 4 5 4
    PERSON

    C 1 6 6 0 4

    D 4 3 0 0 3

    E 4 0 2 4 0

    Total Cost = 1+0+2+1+5 = $9


    Assignment Model
    Profit Maximization

    JOB

    I II III IV V

    A 8 4 2 6 1

    B 0 9 5 5 4
    PERSON

    C 3 8 9 2 6

    D 4 3 1 0 3

    E 9 5 8 9 5
    Assignment Model

    JOB

    I II III IV V

    A 0 4 6 2 7

    B 9 0 4 4 5
    PERSON

    C 6 1 0 7 3

    D 0 1 3 4 1

    E 0 4 1 0 4
    Assignment Model
    JOB

    I II III IV V

    A 0 4 6 2 6

    B 9 0 4 4 4
    PERSON

    C 6 1 0 7 2

    D 0 1 3 4 0

    E 0 4 1 0 3

    Total Profit = 8+9+9+3+9 = $38


    Assignment Model
    Cost Minimization

    JOB

    I II III IV V

    A 13 8 16 18 19

    B 9 15 24 9 12
    PERSON

    C 12 9 4 4 4

    D 6 12 10 8 13

    E 15 17 18 12 20
    Assignment Model
    Cost Minimization

    JOB

    I II III IV V

    A 5 0 8 10 11

    B 0 6 15 0 3
    PERSON

    C 8 5 0 0 0

    D 0 6 4 2 7

    E 3 5 6 0 8
    Assignment Model
    Cost Minimization
    √ √

    JOB

    I II III IV V

    A 5 0 8 10 11

    B 0 6 15 0 3
    PERSON

    C 8 5 0 0 0

    D 0 6 4 2 7

    E 3 5 6 0 8
    Assignment Model
    Cost Minimization

    JOB

    I II III IV V

    A 8 0 8 13 11

    B 0 3 12 0 0
    PERSON

    C 11 5 0 3 0

    D 0 3 1 2 4

    E 3 2 3 0 5

    Total Cost = 8+12+4+6+12 = $42


    Traveling Salesman
    CITY
    A B C D E

    A - 10 3 6 9

    B 5 - 5 4 2
    CITY

    C 4 9 - 7 8

    D 7 1 3 - 4

    E 3 2 6 5 -
    Traveling Salesman
    CITY
    A B C D E

    A - 7 0 1 6

    B 3 - 3 0 0
    CITY

    C 0 5 - 1 4

    D 6 0 2 - 3

    E 1 0 4 1 -
    Traveling Salesman
    CITY
    A B C D E

    A - 7 0 1 6

    B 3 - 3 0 0
    CITY

    C 0 5 - 1 4

    D 6 0 2 - 3

    E 1 0 4 1 -
    Traveling Salesman
    CITY
    A B C D E

    A - 8 0 1 6

    B 3 - 3 0 0
    CITY

    C 0 6 - 1 4

    D 5 0 1 - 2

    E 0 0 3 0 -

    Route 1: A-C-A Route 2: B-E-D-B


    Traveling Salesman
    CITY
    A B C D E

    A - 7 0 0 5

    B 3 - 2 0 0
    CITY

    C --- 6 - 1 4

    D 5 0 0 - 2

    E 0 0 2 0 -
    Traveling Salesman
    CITY
    A B C D E

    A - 8 0 1 6

    B 3 - 3 0 0
    CITY

    C --- 5 - 0 3

    D 5 0 1 - 2

    E 0 0 3 0 -

    Route: A-C-D-B-E-A
    Distance = 3+2+7+1+3 = 16 miles

    You might also like