Optimizing Location, Routing and Scheduling Decisions ... - gerad
Optimizing Location, Routing and Scheduling Decisions ... - gerad
Optimizing Location, Routing and Scheduling Decisions ... - gerad
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Introduction<br />
Problem Definition <strong>and</strong> Formulation<br />
Solution Methodology<br />
Conclusion<br />
References<br />
Set Partitioning-based model: Notation<br />
Problem Definition<br />
Set Partitioning Formulation<br />
Sets<br />
I = set of dem<strong>and</strong> nodes<br />
J = set of c<strong>and</strong>idate facility locations<br />
P j = set of all feasible pairings for facility j, ∀j ∈ J<br />
Parameters<br />
j 1 if dem<strong>and</strong> node i is in pairing p of facility j, ∀i ∈ I, j ∈ J, p ∈ Pj<br />
a ip =<br />
0 otherwise<br />
C p = cost of pairing p associated with facility j, ∀p ∈ P j, j ∈ J<br />
F j = fixed cost of opening facility j, ∀j ∈ J<br />
C F j = capacity of facility j, ∀j ∈ J<br />
Decision Variables<br />
j 1 if pairing p is selected for facility j, ∀p ∈ Pj <strong>and</strong> j ∈ J<br />
z p =<br />
0 otherwise<br />
j 1 if facility j is selected, ∀j ∈ J<br />
t j =<br />
0 otherwise<br />
Akça, Ralphs, Berger<br />
LRS PROBLEM