Change search
ReferencesLink to record
Permanent link

Direct link
Improving the Performance of Greedy Heuristics for TSPs Using Tolerances
P&QM Area, IIM Ahmedabad, India.
Faculty to Economics Sciences, University of Groningen, the Netherlands and Department of Applied Mathematics, Khmelnitsky National University, Ukraine.
Department of Computer Science, Royal Holloway University of London, UK and Department of Computer Science, University of Haifa, Israel.
Computer Science Institute, University of Halle-Wittenberg, Germany.
2007 (English)In: Communications in Dependability and Quality Management, Vol. 10, no 1, 52-70 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we introduce three greedy algorithms for the traveling salesman problem. These algorithms are unique in that they use arc tolerances, rather than arc weights, to decide whether or not to include an arx in a solution. We report extensive computational experiments on benchmark instances that clearly demonstrate that our tolerance-based algorithms outperform their weight-based counterpart. Along with other papers dealing with the Assignment Problem, this paper indicates that the potential for using tolerance-based algorithms for various optimization problems is high and motivates further investigation of the approach. We recommend one of our algorithms as a significantly better alternative to the weight-based greedy, which is often used to produce initial TSP tours.

Place, publisher, year, edition, pages
Germa and SOM Research Institute, University of Groningen, the Netherlands , 2007. Vol. 10, no 1, 52-70 p.
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-82913OAI: diva2:663913
Available from: 2013-11-13 Created: 2013-11-13 Last updated: 2015-02-23

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jäger, Gerold
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link