THE NODE REDUCTION TECHNIQUE FOR SOLVING THE TRAVELING SALESMAN PROBLEM
Abstract
The Node Reduction Technique for solving the Traveling Salesman Problem is a 3-phase procedure that reduces the size of the problem by: (1) assigning a set of mandatory arcs and deleting a set of prohibited arcs; (2) further reducing the number of nodes, using a multistep matching scheme to one super node that contains a good traveling salesman tour; and (3) applying an arc exchange procedure in an attempt to improve the solution obtained at the end of Phase 2. Empirical results indicate that the NRT is computationally efficient, it is versatile in finding solutions for various types of Hamiltonian graphs, and it produces solutions that are usually superior to other techniques described in the literature.
Degree
Ph.D.
Subject Area
Civil engineering
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.