maritime inventory routing problemのベンチマーク問題例 MIRPLIB: https://mirplib.scl.gatech.edu/home
定式化
max
\[
\sum_{n=(j,t) \in \mathcal{N}} \sum_{v \in \mathcal{V}} R_{j,t} f_{j,t}^v - \sum_{a \in \mathcal{A}^v} C_a^v x_a^v
\]
s.t.
\[
\sum_{a \in \mathcal{F}_{S_n}^v} x_a^v - \sum_{a \in \mathcal{R}_{S_n}^v} x_a^v =
\begin{cases}
+1 & \text{if } n = n_0 \\
-1 & \text{if } n = n_{T+1} \\
0 & \text{if } n \in \mathcal{N}
\end{cases}
\quad \forall n \in \mathcal{N}_0, T+1, \forall v \in \mathcal{V}
\]
\[
s_{j,t} = s_{j,t-1} + \Delta_j d_{j,t} - \sum_{v \in \mathcal{V}} \Delta_j f_{j,t}^v
\quad \forall n = (j,t) \in \mathcal{N}
\]
\[
s_{j,t}^v = s_{j,t-1}^v + \sum_{\{n=(j,t) \in \mathcal{N}\}} \Delta_j f_{j,t}^v
\quad \forall t \in \mathcal{T}, \forall v \in \mathcal{V}
\]
\[
\sum_{v \in \mathcal{V}} z_{j,t}^v \leq B_j
\quad \forall n = (j,t) \in \mathcal{N}
\]
\[
z_{j,t}^v \leq \sum_{a \in \mathcal{R}_{S_n}^v} x_a^v
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]
\[
F_{j,t}^{\text{min} v} z_{j,t}^v \leq f_{j,t}^v \leq F_{j,t}^{\text{max} v} z_{j,t}^v
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]
\[
D_{j,t}^{\text{min} v} \leq d_{j,t} \leq D_{j,t}^{\text{max} v}
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]
\[
S_{j,t}^{\text{min} v} \leq s_{j,t} \leq S_{j,t}^{\text{max} v}
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]
\[
0 \leq s_{j,t}^v \leq Q^v
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]
\[
x_a^v \in \{0, 1\}
\quad \forall v \in \mathcal{V}, \forall a \in \mathcal{A}^v
\]
\[
z_{j,t}^v \in \{0, 1\}
\quad \forall n = (j,t) \in \mathcal{N}, \forall v \in \mathcal{V}
\]