8、带时间窗的单阶段选址 - 路径规划问题及相关算法研究

带时间窗的单阶段选址 - 路径规划问题及相关算法研究

1. 多仓库带时间窗车辆路径问题（MDVRPTW）求解

在解决多仓库带时间窗车辆路径问题（MDVRPTW）时，可采用以下算法：

Algorithm 1. MDVRPTW
1: for each depot and its assigned customers do
2:
    Construct routes with the savings method.
3: end for
4: for each depot and its routes do
5:
    Improve routes by arc - exchange operators in the following sequence: 2 - opt, 2 - opt∗, Or - opt, relocate, exchange, cross - exchange.
6:
    if
        an operator improves a solution then
7:
        Stop and update the route(s). Go to 4.
8:
    end if
9: end for
10: for each pair of depots and their routes do
11:
    Improve routes by arc - exchange operators in the following sequence: relocate, exchange.
12:
    if
        an operator improves a solution t