Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Laboratory 09

    Uploaded by

    ScribdTranslations
    The paper presents two cases of shortest path models. The first case models the shortest route between Arequipa and Brasilia considering passing through mandatory nodes. The mathematical model finds the optimal route of 4950 km that passes through 01-04-07-09-13-17-18. The second case models the optimal replacement policy for a 5-year-old machine to minimize costs in 7 years. The model determines that the optimal policy is to replace every year until the seventh year when it is sold,

    Copyright:

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

    You might also like

    Laboratory 09

    Uploaded by

    ScribdTranslations
    2 views10 pages
    The paper presents two cases of shortest path models. The first case models the shortest route between Arequipa and Brasilia considering passing through mandatory nodes. The mathematical model finds the optimal route of 4950 km that passes through 01-04-07-09-13-17-18. The second case models the optimal replacement policy for a 5-year-old machine to minimize costs in 7 years. The model determines that the optimal policy is to replace every year until the seventh year when it is sold,

    Original Description:

    The paper presents two cases of shortest path models. The first case models the shortest route between Arequipa and Brasilia considering passing through mandatory nodes. The mathematical model finds the optimal route of 4950 km that passes through 01-04-07-09-13-17-18. The second case models the optimal replacement policy for a 5-year-old machine to minimize costs in 7 years. The model determines that the optimal policy is to replace every year until the seventh year when it is sold,

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The paper presents two cases of shortest path models. The first case models the shortest route between Arequipa and Brasilia considering passing through mandatory nodes. The mathematical model finds the optimal route of 4950 km that passes through 01-04-07-09-13-17-18. The second case models the optimal replacement policy for a 5-year-old machine to minimize costs in 7 years. The model determines that the optimal policy is to replace every year until the seventh year when it is sold,

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    2 views10 pages

    Laboratory 09

    Uploaded by

    ScribdTranslations
    The paper presents two cases of shortest path models. The first case models the shortest route between Arequipa and Brasilia considering passing through mandatory nodes. The mathematical model finds the optimal route of 4950 km that passes through 01-04-07-09-13-17-18. The second case models the optimal replacement policy for a 5-year-old machine to minimize costs in 7 years. The model determines that the optimal policy is to replace every year until the seventh year when it is sold,

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 10

    CATHOLIC UNIVERSITY OF SANTA MARÍA FACULTY

    OF PHYSICAL AND FORMAL SCIENCES AND ENGINEERING

    PROFESSIONAL SCHOOL OF INDUSTRIAL


    ENGINEERING

    REPORT N°9: SHORTEST PATH MODEL COURSE:

    OPERATIONS RESEARCH I

    GROUP: “01”

    TEACHER:

    ENG. EFRAÍN RAFAEL MURILLO

    QUISPE

    STUDENT
    : BANDA ALCOCER,
    ANTHONY DUEÑAS
    VIZCARRA, KEVIN DIAZ
    CHAVEZ, SHEYLA STEFANY

    AREQUIPA –

    PERU 2020
    SHORTEST PATH MODEL
    ACTIVITIES
    CASE 1. TRANSOCEANIC
    The following figure shows the construction alternatives for the transoceanic highway that will connect Arequipa with Brasilia.

    The distances in km. from one node to another is shown in the following table:

    For this problem, consider the arcs in the source node and the destination node as one-way.

    a) Considering that, for geopolitical reasons, the road is required to pass through Trinidad (node 7) and Campo
    Grande (node 13), build the mathematical model to find the shortest route between Arequipa and Brasilia and
    obtain the optimal solution using the LINGO Software .
    Decision variable:

    Let Xij=1, if the arc ij ∈ to the shortest path


    =0, otherwise
     i=1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17
     j=2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18

    MATHEMATICAL MODEL:
    Min 500X0102 + 300X0103 + 700X0104 + 1300X0205 + 1100X0308 + 1200X0310
    + 800x0407 + 750x0408 + 900x0409 + 1300x0502 + 600x0506 + 800x0507 + 600x0605
    + 850x0607 + 2200x0614 + 800x0704 + 800x0705 + 850x0706 +
    750X0709 + 1900X0714 + 1100X0803 + 750X0804 + 400X0809 + 800X0810 +
    900X0904 + 750X0907 + 400X0908 + 1500X0913 + 1200X0914 + 1200X1003 +
    800X1008 + 850X1011 + 850X1110 + 1300X1112 + 2600X1113 + 1300X1211 +
    1000X1213 + 1150X1215 + 1500X1309 + 2600X1311 + 1000X1312 + 900X1314 +
    1300X1315 + 750X1317 + 2200X1406 + 1900X1407 + 1200X1409 + 900X1413 +
    1100X1418 + 1150X1512 + 1300X1513 + 650X1516 + 650X1615 + 750X1617 +
    750X1713 + 750X1716 + 450X1718
    ST
    X0102+X0103+X0104=1 X0102+X0502-
    X0205=0
    X0104+X0704+X0904+X0804-X0407-X0409-X0408=0
    X0407+X0507+X0607+X1407+X0907-X0704-X0705-X0706 - 1409+X1309+X0809-
    X0904- X0907-X0914-X0913-X0908=0
    X1011+X1211+X1311-X1110-X1113-X1112=0
    X0913+X1113+X1213+X1413+X1513+X1713 -
    X0714+X0614+X0914+X1314-X1406-X1407-X1409 -
    X1516+X1716-X1615-X1617=0
    Mandatory restrictions:
    Trinity (node 7)
    X0407+X0507+X0607+X1407+X0907 = 1
    X0704+X0705+X0706+X0714+X0709 = 1
    Large Field (node 13)
    X0913+X1113+X1213+X1413+X1513+X1713 = 1
    X1309+X1311+X1312+X1314+X1315+X1317 = 1
    END
    Xij  {0,1}

    LINGO REPORT:
    b) Show the optimal route as well as the total distance traveled

    Optimal route:
    The shortest route used by Lindo is: 01-04-07-09-13-17-18, with a total distance of 4950 km.

    Arequipa-La Paz-Trinidad-Santa Cruz-Campo Grande-Uberlandia-Brasilia

    Total distance traveled:

    4950 km
    Graphic solution:

    CASE 2. EQUIPMENT REPLACEMENT POLICIES


    Suppose it costs $15,000 to buy a new machine. The following table shows the annual cost of use and resale value of the
    machine for different years of age.

    Machine age (years) 1 2 3 4 5


    Resale price at the end of the year (thousands of dollars) 13 11 10 8 5
    Operating cost during the year (Thousands of dollars) 1 2 3 5 8
    Assuming you have a machine that has just turned 5 years old:
    Statement of the Hypothesis:

    CT2 the total cost of the proposed system CT1


    the total cost of the current system

    Ho: CT2<CT1
    H1: CT2>=CT1
    a) Show the problem network.
    Problem network:

    b) Build the mathematical model to determine the optimal replacement policy that minimizes the net costs of owning and using the machine for the next seven years
    and obtain the optimal solution using LINGO Software.
    Mathematical model:
    Decision variable:
    Let Xij=1, if the arc ij  to the shortest path
    =0, otherwise
     i=1,2,3,...,26
     j=2,3,4,...,27
    Mathematical model:
    Min
    11X12+2X23+3X24+3X35+2X37+2X46+3X47+5X58+6X511+3X69+5X611+2X710+3X7
    11+8X812+8X816+5X913+6X916+3X1014+5X1016+2X1115+3X111 6+
    11X1221+8X1317+8X1321+5X1418+6X1421+3X1519+5X1521+2X1620+3X1621+
    11X1726+8X1822+8X1826+5X1923+6X1926+3X2024+5X2026+2X2125+3X2126-
    5X2227-8X2327-10X2427-11X2527-13X2627
    st
    X12=1
    X12-X23-X24=0
    X23-X35-X37=0
    X24-X46-X47=0 -
    X913-X916=0
    X710-X1014-X1016=0
    X711-X1110-X1116=0
    X913-X1317-X1321=0
    X1014-X1418-X1421=0
    X1418-X1822-X1826=0
    X1519-X1923-X1926=0
    X1923-X2327=0
    X2024-X2427=0
    X2125-X2527=0
    X2227+X2327+X2427+X2527+X2627=1
    Xij ∈ {0,1}
    Lingo report:
    c) Indicate the Optimal Replacement Policy and the minimum total cost.

    Optimal replacement policy:


    YEA DECISION
    R
    1 Replace
    2 Replace
    3 Replace
    4 Replace
    5 Replace
    6 Replace
    7 Sell

    Minimum total cost: $16

    You might also like