After ob- taining the initial solution of the greedy randomized algorithm, the large neighborhood search can effectively find the optimal solution or the near-optimal solution. The large neighborhood search process is shown in Figure 5. 12 of 32 Breaking process 11 1 2 4 5 6 7 8 12 3 ...