I have made some progress on my previous question (Is there a known MILP to schedule routes after routes are made).
I have derived the sets of the problem, which are:
1) Itineraries of vehicle: $i \in I$
2) Customer $j$ in itinerary $i$: $c_{ij} \in C$
With the following Parameters.
1) Start of $j$-th time window of itinerary $i$: $tws_{ij}$
2) End of $j$-th time window of itinerary $i$: $twe_{ij}$
3) Duration of travel from customer $j$ to customer $k$ of itinerary $i$: $d_{ijk}$
4) Processing Time of customer $j$ of itinerary $i$: $P_{ij}$
5) Waiting time: $wt$
With decision variables:
1) $c_{ij}$: Start of service at customer $j$ of itinerary $i$
The certain constraints up to now are:
\begin{align}c_{ij} + P_{ij} + d_{ij(j+1)} - c_{i(j+1)} &\leqslant 0, &&\forall i\in I,j\in C\\c_{ij} + wt &\geqslant tws_{ij} , &&\forall i\in I,j\in C\\c_{ij} &\leqslant twe_{ij}, &&\forall i\in I,j\in C\end{align}
These three sets of constraints ensure the time windows violations for each itinerary, and the ban of overlapping customers within an itinerary. My question is the following. How can I ensure the ban of overlapping for each itinerary with the other?
Thank you very much!