Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Problem 1.8: Modeling possible separators

    Hochgeladen von

    raja89
    18 Ansichten15 Seiten
    The document describes an optimization problem involving scheduling car trips to transport students and serve refreshments. It presents models to: 1) Minimize costs by scheduling one to four consecutive car trips starting at times between 10AM and 7PM, subject to car and student capacity constraints. 2) Extend the model to also minimize refreshment costs based on the number of students served at each time, subject to the same constraints. 3) The full optimization model aims to minimize total car and refreshment costs by determining the optimal number of cars to assign to one to four consecutive trips starting at different times.

    Originalbeschreibung:

    fdm

    Originaltitel

    Chapter1_LP.pdf

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    The document describes an optimization problem involving scheduling car trips to transport students and serve refreshments. It presents models to: 1) Minimize costs by scheduling one to four consecutive car trips starting at times between 10AM and 7PM, subject to car and student capacity constraints. 2) Extend the model to also minimize refreshment costs based on the number of students served at each time, subject to the same constraints. 3) The full optimization model aims to minimize total car and refreshment costs by determining the optimal number of cars to assign to one to four consecutive trips starting at different times.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    18 Ansichten15 Seiten

    Problem 1.8: Modeling possible separators

    Hochgeladen von

    raja89
    The document describes an optimization problem involving scheduling car trips to transport students and serve refreshments. It presents models to: 1) Minimize costs by scheduling one to four consecutive car trips starting at times between 10AM and 7PM, subject to car and student capacity constraints. 2) Extend the model to also minimize refreshment costs based on the number of students served at each time, subject to the same constraints. 3) The full optimization model aims to minimize total car and refreshment costs by determining the optimal number of cars to assign to one to four consecutive trips starting at different times.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 15

    Problem 1.

    Problem 1.8

    Possible Separators

    Problem 1.8

    Possible Separators

    Problem 1.8

    Possible Separators

    Problem 1.8(a)
    Model: Using equation: a.PBF + b.PD = c, Maximize 0 i.e. find a feasible solution Subject to (a.PFBj + b.PDj) c > 0 j where loan was granted (a.PFBk + b.PDk) c 0 k where loan was not granted

    Problem 1.8(b)
    Model: Using equation: a.PBF + b.PD = c (arbitrarily fix any of a,b c to 1) Maximize i.e. find a central line Subject to (a.PFBj + b.PDj) c - > 0 j where loan was granted (a.PFBk + b.PDk) c + 0 k where loan was not granted

    Problem 1.8: Comparison


    Part b

    Part a

    Problem 1.11
    One trip, starting at 10AM
    09AM 10AM 11AM Trip Car returns to Amar Travels Car starts at Amar Travels 12Noon 01PM 02PM 03PM 04PM 05PM

    Costs (including opportunity cost) = Rs.50 (Trip cost) + Rs.30 2.5 (Opportunity cost) = Rs.125

    Problem 1.11
    Two trips, starting at 10AM
    09AM 10AM 11AM Trip Car starts at Amar Travels 12Noon Idle 01PM 02PM Trip Car returns to Amar Travels 03PM 04PM 05PM

    Costs (including opportunity cost) = Rs.50 (Trip cost) + Rs.30 5.5 (Opportunity cost) = Rs.215

    Problem 1.11
    Unit Costs:
    Car being used for one trip: Car being used for two consecutive trips: Car being used for three consecutive trips: Car being used for four consecutive trips: Rs.125 Rs.215 Rs.305 Rs.395

    Times (t):
    t = 1: 10AM, t = 2: 1PM, t = 3: 4PM, t = 4: 7PM

    Problem 1.11(a)
    Variables:
    Xtj : Number of cars that start at time t and work for j consecutive trips At : Number of cars available at time t Objective: Minimize

    125(X11 + X21 + X31 + X41) + 215(X12 + X22 + X32) + 305(X13 + X23) + 395(X14) +

    Problem 1.11(a)
    t = 1 (10AM): A1 = X11 + X12 + X13 + X14 t = 2 (1PM) : A2 = X12 + X13 + X14 + X21 + X22 + X23 t = 3 (4PM) : A3 = X13 + X14 + X22 + X23 + X31 + X32 t = 4 (7PM) : A4 = X14 + X23 + X32 + X41
    Number of cars available at time t >= Number of students to be picked/car capacity

    A1 15/5;

    A2 30/5;

    A3 10/5;

    A4 30/5

    Number of cars available at time t <= 7

    A1 7; Xtj 0

    A2 7;

    A3 7;

    A4 7

    Problem 1.11(b)
    Variables (continued)
    St : Students to be served refreshments at time t t = 1 (10AM): S1 15 5A1 t = 2 (1PM) : S2 (S1 + 35) 5A2 t = 3 (4PM) : S3 (S2 + 10) 5A3 t = 4 (7PM) : S4 = (S3 + 30) 5A4 S1 0; S2 0; S3 0; S4 = 0

    Problem 1.11(b)
    Objective function Car related costs C = 125(X11 + X21 + X31 + X41) + 215(X12 + X22 + X32) + 305(X13 + X23) + 395(X14) + Refreshment costs R = 15(S1 + S2 + S3 + S4) Objective: Minimize C+R

    Problem 1.11(b)
    Model: Minimize 125(X11 + X21 + X31 + X41) + 215(X12 + X22 + X32) + 305(X13 + X23) + 395(X14) + 15(S1 + S2 + S3 + S4) Subject to A1 = X11 + X12 + X13 + X14 6 A2 = X12 + X13 + X14 + X21 + X22 + X23 6 A3 = X13 + X14 + X22 + X23 + X31 + X32 6 A4 = X14 + X23 + X32 + X41 6 S1 15 5A1 S2 (S1 + 35) 5A2 S3 (S2 + 10) 5A3 S4 = (S3 + 30) 5A4 S1 0; S2 0; S3 0; S4 = 0; Xtj 0

    Das könnte Ihnen auch gefallen