Table 1 Variable description.
From: Dynamic routing for efficient waste collection in resource constrained societies
Variables           |                                  Description                                  |
|---|---|
\(i, j \in D\) | \(i{\text {th}}\) bin and \(j{\text {th}}\) bin respectively |
D | Total bins for a particular region including depot |
N | Bins for a particular CV excluding depot |
A | Set of all the arcs formed from \(i{\text {th}}\) bin to \(j{\text {th}}\) bin for \(\forall i,j \in\) D |
\(C_{ij}\in \mathbb {R}^+\) | Distance cost from bin i to bin j for a CV |
\(X_{ij} \in \{0, 1\}\) | Binary variable that is 1 if a CV is travelling between the bin i and bin j |
\(Y_{i} \in \{0, 1\}\) | A binary variable that is 1 if a CV has visited bin i |
\(P_{t} \in [0.0, 100.0]\) | Cumulative fill percentage of CV for the time interval t. |
\(u_{i} \in [0, 100 -P_{t}]\) | The fill percentage of the CV visiting bin i for a specific time interval |
\(st \in D\) | The starting bin of a CV in a new time interval |
\(w_{1} \in [0.0, 1.0]\) | The weight assigned to the distance in the objective function |
\(w_{2} \in [0.0, 1.0]\) | The weight assigned to the waste amount in the objective function |
\(f_{i} \in [0.0, 1.0]\) | The fill ratio of bin at bin i |
\(BT \in \mathbb {R}^+\) | The conversion factor for fill of smart bin to fill of CV |
