Optimizing Location, Routing and Scheduling Decisions ... - gerad

More documents

Recommendations

Info

Introduction Problem Definition and Formulation Solution Methodology Conclusion References Set Partitioning-based model: Notation Problem Definition Set Partitioning Formulation Sets I = set of demand nodes J = set of candidate facility locations P j = set of all feasible pairings for facility j, ∀j ∈ J Parameters j 1 if demand node i is in pairing p of facility j, ∀i ∈ I, j ∈ J, p ∈ Pj a ip = 0 otherwise C p = cost of pairing p associated with facility j, ∀p ∈ P j, j ∈ J F j = fixed cost of opening facility j, ∀j ∈ J C F j = capacity of facility j, ∀j ∈ J Decision Variables j 1 if pairing p is selected for facility j, ∀p ∈ Pj and j ∈ J z p = 0 otherwise j 1 if facility j is selected, ∀j ∈ J t j = 0 otherwise Akça, Ralphs, Berger LRS PROBLEM
Introduction Problem Definition and Formulation Solution Methodology Conclusion References Set Partitioning Formulation Problem Definition Set Partitioning Formulation (SPP-LRS) Minimize subject to X j∈J F jt j + X X C pz p (1) j∈J p∈P j X X a ipz p = 1 ∀i ∈ I (π i ), (2) j∈J p∈P j X a ipD iz p ≤ Cj F t j ∀j ∈ J (µ j ), (3) X p∈P j i∈I z p ∈ {0, 1} ∀p ∈ P j, ∀j ∈ J, (4) t j ∈ {0, 1} ∀j ∈ J. (5) Akça, Ralphs, Berger LRS PROBLEM
Page 1 and 2: Introduction Problem Definition and
Page 7: Pairing Concept Introduction Proble
Page 15 and 16: Branching Rules Introduction Proble
Page 25 and 26: Conclusions Introduction Problem De

Optimizing Location, Routing and Scheduling Decisions ... - gerad

Create successful ePaper yourself

Delete template?

Save as template?