Scribd Logo
Upload

Welcome to Scribd!

  • Ejemplo Localizacion - Pmediana y CFLP

    Uploaded by

    Jp Vidal
    8 views7 pages
    The document describes the capacitated facility location problem (CFLP), which involves finding the optimal location of facilities to minimize costs while meeting capacity constraints. It provides the cost and demand data for 10 customers and 4 potential facility locations, with the capacity and fixed costs for each location. The objective is to minimize the total cost, which includes transportation costs from assigning customers to facilities and fixed costs of opening facilities, subject to meeting the capacity limits at each open location. Integer variables are used to indicate if a customer is assigned to a location and if a location is open.

    Original Description:

    Original Title

    Ejemplo Localizacion_pMediana y CFLP

    Copyright

    © © All Rights Reserved

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the capacitated facility location problem (CFLP), which involves finding the optimal location of facilities to minimize costs while meeting capacity constraints. It provides the cost and demand data for 10 customers and 4 potential facility locations, with the capacity and fixed costs for each location. The objective is to minimize the total cost, which includes transportation costs from assigning customers to facilities and fixed costs of opening facilities, subject to meeting the capacity limits at each open location. Integer variables are used to indicate if a customer is assigned to a location and if a location is open.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xls, pdf, or txt
    8 views7 pages

    Ejemplo Localizacion - Pmediana y CFLP

    Uploaded by

    Jp Vidal
    The document describes the capacitated facility location problem (CFLP), which involves finding the optimal location of facilities to minimize costs while meeting capacity constraints. It provides the cost and demand data for 10 customers and 4 potential facility locations, with the capacity and fixed costs for each location. The objective is to minimize the total cost, which includes transportation costs from assigning customers to facilities and fixed costs of opening facilities, subject to meeting the capacity limits at each open location. Integer variables are used to indicate if a customer is assigned to a location and if a location is open.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xls, pdf, or txt
    of 7

    Problema de Localización p-Mediana

    cij
    CD
    Cliente CD1 CD2 CD3 CD4
    C1 12.0 6.0 12.0 7.5
    C2 4.5 14.0 4.2 12.0
    C3 9.5 3.0 9.0 7.5
    C4 5.5 9.5 9.5 5.0
    C5 8.5 8.0 5.0 10.0
    C6 9.0 4.5 10.0 4.0
    C7 9.5 9.0 12.5 6.5
    C8 5.0 16.0 9.0 12.5
    C9 3.0 10.0 4.0 8.0
    C10 7.0 7.0 5.0 7.0

    Xij
    CD
    Cliente CD1 CD2 CD3 CD4 Total
    C1 0 0 1 0 1
    C2 0 0 1 0 1
    C3 0 0 1 0 1
    C4 0 0 1 0 1
    C5 0 0 1 0 1
    C6 1 0 0 0 1
    C7 1 0 0 0 1
    C8 0 0 1 0 1
    C9 1 0 0 0 1
    C10 1 0 0 0 1
    Total 4 0 6 0 10

    Yj
    CD
    CD1 CD2 CD3 CD4 Total
    Yj 1 1 0 0 2

    P= 2

    cij*Xij
    CD
    Cliente CD1 CD2 CD3 CD4 Total
    C1 0.00 0.00 12.00 0.00 12.0
    C2 0.00 0.00 4.20 0.00 4.2
    C3 0.00 0.00 9.00 0.00 9.0
    C4 0.00 0.00 9.50 0.00 9.5
    C5 0.00 0.00 5.00 0.00 5.0
    C6 9.00 0.00 0.00 0.00 9.0
    C7 9.50 0.00 0.00 0.00 9.5
    C8 0.00 0.00 9.00 0.00 9.0
    C9 3.00 0.00 0.00 0.00 3.0
    C10 7.00 0.00 0.00 0.00 7.0
    Total 28.5 0.0 48.7 0.0 77.2

    F.O. = 77.20

    Yj Y1 Y2 Y3 Y4
    1 1 1 0 0
    2 1 1 0 0
    3 1 1 0 0
    4 1 1 0 0
    5 1 1 0 0
    6 1 1 0 0
    7 1 1 0 0
    8 1 1 0 0
    9 1 1 0 0
    10 1 1 0 0
    N M
    Min cij X ij
    i 1 j 1

    S .a.
    M

    X
    j 1
    ij 1 i  1,..., N

    Y
    j 1
    j P

    X ij  Y j i  1,..., N j  1,..., M

    X ij , Yj   0,1 i  1,..., N j  1,..., M

    0 0 1 0
    0 0 1 0
    0 0 1 0
    0 0 1 0
    0 0 1 0
    1 0 0 0
    1 0 0 0
    0 0 1 0
    1 0 0 0
    1 0 0 0
    i  1,..., N

    i  1,..., N j  1,..., M

    i  1,..., N j  1,..., M
    Problema de localización de instalaciones con
    restriciones de capacidad (CFLP)

    cij
    CD
    Cliente CD1 CD2 CD3 CD4
    C1 12.0 6.0 12.0 7.5
    C2 4.5 14.0 4.2 12.0
    C3 9.5 3.0 9.0 7.5
    C4 5.5 9.5 9.5 5.0
    C5 8.5 8.0 5.0 10.0
    C6 9.0 4.5 10.0 4.0
    C7 9.5 9.0 12.5 6.5
    C8 5.0 16.0 9.0 12.5
    C9 3.0 10.0 4.0 8.0
    C10 7.0 7.0 5.0 7.0

    fj
    CD
    CD1 CD2 CD3 CD4 Total
    fj 5000 12000 3000 7000 27000

    qj
    CD
    CD1 CD2 CD3 CD4 Total
    qj 310 500 220 300 1330

    wi

    Cliente w
    C1 20.0
    C2 25.3
    C3 15.8
    C4 46.5
    C5 33.1
    C6 39.2
    C7 41.7
    C8 19.7
    C9 23.9
    C10 32.6
    Total 297.8

    Xij
    CD
    Cliente CD1 CD2 CD3 CD4 Total
    C1 1.0 0.0 0.0 0.0 1
    C2 0.0 0.0 1.0 0.0 1
    C3 0.0 0.0 1.0 0.0 1
    C4 1.0 0.0 0.0 0.0 1
    C5 0.0 0.0 1.0 0.0 1
    C6 1.0 0.0 0.0 0.0 1
    C7 1.0 0.0 0.0 0.0 1
    C8 1.0 0.0 0.0 0.0 1
    C9 1.0 0.0 0.0 0.0 1
    C10 0.0 0.0 1.0 0.0 1
    Total 6.0 0.0 4.0 0.0 10

    Yj
    CD
    CD1 CD2 CD3 CD4 Total
    Yj 1 0 1 0 2
    cij*Xij
    CD
    Cliente CD1 CD2 CD3 CD4 Total
    C1 12.0 0.0 0.0 0.0 12.0
    C2 0.0 0.0 4.2 0.0 4.2
    C3 0.0 0.0 9.0 0.0 9.0
    C4 5.5 0.0 0.0 0.0 5.5
    C5 0.0 0.0 5.0 0.0 5.0
    C6 9.0 0.0 0.0 0.0 9.0
    C7 9.5 0.0 0.0 0.0 9.5
    C8 5.0 0.0 0.0 0.0 5.0
    C9 3.0 0.0 0.0 0.0 3.0
    C10 0.0 0.0 5.0 0.0 5.0
    Total 44.0 0.0 23.2 0.0 67.2

    Fj*Yj
    CD
    CD1 CD2 CD3 CD4 Total
    5000 0 3000 0 8000

    wi*Xij
    CD
    Cliente CD1 CD2 CD3 CD4 Total
    C1 20.0 0.0 0.0 0.0 20.0
    C2 0.0 0.0 25.3 0.0 25.3
    C3 0.0 0.0 15.8 0.0 15.8
    C4 46.5 0.0 0.0 0.0 46.5
    C5 0.0 0.0 33.1 0.0 33.1
    C6 39.2 0.0 0.0 0.0 39.2
    C7 41.7 0.0 0.0 0.0 41.7
    C8 19.7 0.0 0.0 0.0 19.7
    C9 23.9 0.0 0.0 0.0 23.9
    C10 0.0 0.0 32.6 0.0 32.6
    Total 191.0 0.0 106.8 0.0 297.8

    qj*Yj
    CD
    CD1 CD2 CD3 CD4 Total
    310 0 220 0 530

    F.O. = 8067.2

    Yj Y1 Y2 Y3 Y4
    1 1 0 1 0
    2 1 0 1 0
    3 1 0 1 0
    4 1 0 1 0
    5 1 0 1 0
    6 1 0 1 0
    7 1 0 1 0
    8 1 0 1 0
    9 1 0 1 0
    10 1 0 1 0
    N M M
    Min cij X ij   f jY j
    i 1 j 1 j 1

    S .a.
    M

    X
    j 1
    ij 1 i  1,..., N

    w X
    i 1
    i ij  q jY j j  1,..., M

    X ij , Y j   0,1 i  1,..., N j  1,..., M

    You might also like