The generalized traveling salesman problem solved with ant algorithms

The generalized traveling salesman problem solved with ant algorithms A well known $$\mathcal{NP}$$ NP -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 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Complex Adaptive Systems Modeling Springer Journals

The generalized traveling salesman problem solved with ant algorithms

, Volume 5 (1) – Aug 7, 2017
9 pages

/lp/springer_journal/the-generalized-traveling-salesman-problem-solved-with-ant-algorithms-P2dutKV2BQ
Publisher
Springer Berlin Heidelberg
Subject
Mathematics; Complex Systems; Operations Research/Decision Theory; Simulation and Modeling; Operations Research, Management Science
eISSN
2194-3206
D.O.I.
10.1186/s40294-017-0048-9
Publisher site
See Article on Publisher Site

Abstract

A well known $$\mathcal{NP}$$ NP -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 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.

Journal

Published: Aug 7, 2017

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve Freelancer DeepDyve Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations