On the Segment-Based Remove-and-Reinsert Heuristic for the Generalized Traveling Salesman Problem
Randomized arbitrary insertion (RAI), a well-known heuristic for the traveling salesman problem, is applied to the generalized traveling salesman problem (GTSP). The adaptation of the basic idea to the GTSP leads to eight variants of the basic heuristic. These basic constructive heuristics are followed by the iterative...