Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    IPP Example

    Uploaded by

    Abhishek Pandey
    This document presents an integer linear programming problem to determine the minimum number of fire stations needed to serve six cities in a region such that each city is within 15 minutes of a fire station. The problem defines an objective function to minimize the total number of fire stations and constraints specifying that each city must be within 15 minutes of at least one fire station based on driving times between cities. The optimal solution is to build fire stations in cities 2 and 4, requiring a total of 2 fire stations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    IPP Example

    Uploaded by

    Abhishek Pandey
    36 views7 pages
    This document presents an integer linear programming problem to determine the minimum number of fire stations needed to serve six cities in a region such that each city is within 15 minutes of a fire station. The problem defines an objective function to minimize the total number of fire stations and constraints specifying that each city must be within 15 minutes of at least one fire station based on driving times between cities. The optimal solution is to build fire stations in cities 2 and 4, requiring a total of 2 fire stations.

    Original Description:

    IPP example

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document presents an integer linear programming problem to determine the minimum number of fire stations needed to serve six cities in a region such that each city is within 15 minutes of a fire station. The problem defines an objective function to minimize the total number of fire stations and constraints specifying that each city must be within 15 minutes of at least one fire station based on driving times between cities. The optimal solution is to build fire stations in cities 2 and 4, requiring a total of 2 fire stations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    36 views7 pages

    IPP Example

    Uploaded by

    Abhishek Pandey
    This document presents an integer linear programming problem to determine the minimum number of fire stations needed to serve six cities in a region such that each city is within 15 minutes of a fire station. The problem defines an objective function to minimize the total number of fire stations and constraints specifying that each city must be within 15 minutes of at least one fire station based on driving times between cities. The optimal solution is to build fire stations in cities 2 and 4, requiring a total of 2 fire stations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 7

    ILP : An

    example
    Presented by15020241005 Abhishek Pandey
    15020241062 Kuldeepsinh Chavda
    15020241092 Rahul Kumar
    15020241134 Archit Kumar

    There are six cities in region R. The region must


    determine where to build fire stations. The region
    wants to build the minimum number of fire stations
    and ensure that at least one fire station is near 15
    minutes of each city.

    The times (in minutes) required


    to drive between cities are:

    Solution

    Objective Function
    Total number of fire stations to be built
    x0=x1 + x2 + x3 + x4 + x5 + x6

    Constraints

    A fire station within 15 mins of each city.


    The locations that can reach each city in 15 minutes:
    City 1

    1,2

    City 2

    1,2,6

    City 3

    3,4

    City 4

    3,4,5

    City 5

    4,5,6

    City 6

    2,5,6

    x1 + x 2

    x1 + x 2 + x 6

    x3 + x 4

    x3 + x 4 + x 5

    x4 + x 5 + x 6

    x2 + x 5 + x 6

    Xi = 0 or 1, i=1,6

    Optimal Solution :
    X0 = 2
    X2 = X4 = 1
    X1 = X3 = X5 = X6 = 0

    Thanks!

    Any questions?

    You might also like