Fast Tabu Search Implementation for Large Asymmetric Traveling Salesman Problems Defined on Sparse Graphs

By: Material type: ArticleArticlePublication details: Description: 50 (1) Jan-Mar2013, 75-88pSubject(s): In: BV- Opsearch (Jan-Jun 2013)Summary: Real life traveling salesman problem (TSP) instances are often defined on large, sparse, and asymmetric graphs. Tabu search implementations for the TSP that have been reported in the literature almost always deal with small, dense, and symmetric instances. In this paper, we outline a tabu search implementation which can solve TSP instances much faster than conventional implementations if the graph defining the instance is asymmetric and sparse. We present results from computational experiments with this implementation which validate our claim.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Articles Articles Main Library Available AR16036

Real life traveling salesman problem (TSP) instances are often defined on large, sparse, and asymmetric graphs. Tabu search implementations for the TSP that have been reported in the literature almost always deal with small, dense, and symmetric instances. In this paper, we outline a tabu search implementation which can solve TSP instances much faster than conventional implementations if the graph defining the instance is asymmetric and sparse. We present results from computational experiments with this implementation which validate our claim.

There are no comments on this title.

to post a comment.

Powered by Koha