Generalized Traveling Salesman Problem Reduction Algorithms

Details Generalized Traveling Salesman Problem Reduction Algorithms Generalized Traveling Salesman Problem Reduction Algorithms

2008-04-04

arxiv.org/abs/0804.0735v2

Algorithmic Operations Research 4 (2009) 144-154

Computer Science

Data Structures and Algorithms

To appear in Algorithmic Operations Research

Scientific paper

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the optimal solution. The algorithm's running time is O(N^3) in the worst case, but it is significantly faster in practice. The algorithm has reduced the problem size by 15-20% on average in our experiments and this has decreased the solution time by 10-60% for each of the considered solvers.

Affiliated with

Also associated with

No associations

Rating

Generalized Traveling Salesman Problem Reduction Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized Traveling Salesman Problem Reduction Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Traveling Salesman Problem Reduction Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-191014