Our LNS follows the standard procedure described in [1]} by employing dedicated repair and destruction operators, but further extends it with a local search routine and by maintaining a small population of candidate solutions. The complete method is given in algorithm . In contrast to our construction heuristic which considers one node at a time, Hottung and Tierney[2]} directly learn a neural repair operator to recombine tour fragments resulting from random splits for the CVRP.
