Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood
Abstract
We discuss the way to group all 25 possible 4-OPT moves into 7 orbits of equivalent moves. We then describe two implementations, one for a (n3) algorithm by de Berg's et al. and one of a (n2) algorithm by Glover, for finding the best 4-OPT move via dynamic programming.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.