The Generalized Traveling Salesman Problem solved with Ant Algorithms


A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cost tour passing through exactly one node from each cluster. An exact exponential time algorithm and an effective meta-heuristic algorithm for the problem are presented. The meta-heuristic proposed is a modified Ant Colony System (ACS) algorithm called Reinforcing Ant Colony System (RACS) which introduces new correction rules in the ACS algorithm. Computational results are reported for many standard test problems. The proposed algorithm is competitive with the other already proposed heuristics for the GTSP in both solution quality and computational time.

DOI: 10.1186/s40294-017-0048-9

Extracted Key Phrases

3 Figures and Tables

Showing 1-10 of 12 references

Handbook of Metaheuristics

  • F W Glover, G A Kochenberger
  • 2002
1 Excerpt

The Generalized Traveling Salesman and Orienteering Problem

  • M Fischetti, J J S Gonzales, P Toth
  • 2002
2 Excerpts

The Max-Min Ant System and local search for the traveling salesman problem

  • T Stützle, H H Hoos
  • 1997
1 Excerpt

TSPLIB–a library of travelling salesman and related problem instances

  • B Bixby, G Reinelt
  • 1995

Optimization, Learning and Natural Algorithms

  • M Dorigo
  • 1992
2 Excerpts