G Reinelt

GA Croes

S Lin

Lancia, Giuseppe

Dalpasso, Marcello

Archivio istituzionale della ricerca - Università di Padova

Speeding-up the Exploration of the 3-OPT Neighborhood for the TSP

A move of the 3-OPT neighborhood for the Traveling Salesman Problem consists in removing any three edges of the tour and replacing them with three new ones. The standard algorithm to find the best possible move is cubic, both in its worst and average time complexity. Since TSP instances of interest can have thousands of nodes, up to now it has been impossible to use the 3-OPT local search on anything other than quite small instances. In this paper we describe an alternative algorithm whose average complexity appears to be quadratic and which allowed us to use 3-OPT on instances with several thousand nodes. The algorithm is based on a rule for quickly choosing two out of three edges in a good way, and then completing the choice in linear time. To this end, the algorithm uses max-heaps as a suitable data structure

Giuseppe Lancia

Marcello Dalpasso

Archivio istituzionale della ricerca - Università degli Studi di Udine

English

Speeding-up the exploration of the 3-OPT neighborhood for the TSP

Crossref

Speeding-up the Exploration of the $$3$$-OPT Neighborhood for the TSP

Speeding-up the exploration of the 3-OPT neighborhood for the TSP

Abstract

Similar works

Full text

Available Versions

Archivio istituzionale della ricerca - Università di Padova

Archivio istituzionale della ricerca - Università degli Studi di Udine

Crossref