WIN algorithm for discrete online TSP

Wu, Yonghua and Zhu, Guohun and Chen, Huaying and Qin, Jucun (2011) WIN algorithm for discrete online TSP. Journal of Advanced Computational Intelligence and Intelligent Informatics, 15 (9). pp. 1199-1202. ISSN 1343-0130

Abstract

Traveling Salesman Problem (TSP) which is proved as an NP-Complete problem is solved by many algorithms. In this paper, we propose online TSP which is based on general discrete metric space. A Waiting- If-Necessary (WIN) algorithm is proposed that involves with increasing cost caused by zealous algorithms and unnecessary waiting caused by cautious algorithms. We measure the performance of the WIN algorithm using competitive analysis and found that it is a 2-competitive algorithm. The competitive ratio of theWIN algorithm can be improved by setting parameter T0.


Statistics for USQ ePrint 21199
Statistics for this ePrint Item
Item Type: Article (Commonwealth Reporting Category C)
Refereed: Yes
Item Status: Live Archive
Additional Information: Permanent restricted access to published version due to publisher copyright policy.
Depositing User: epEditor USQ
Faculty / Department / School: Historic - Faculty of Sciences - Department of Maths and Computing
Date Deposited: 07 May 2012 10:11
Last Modified: 03 Jul 2013 01:10
Uncontrolled Keywords: competitive analysis; discrete metric space; metric TSP; online TSP; waiting-if-necessary
Fields of Research (FOR2008): 08 Information and Computing Sciences > 0805 Distributed Computing > 080599 Distributed Computing not elsewhere classified
01 Mathematical Sciences > 0103 Numerical and Computational Mathematics > 010303 Optimisation
01 Mathematical Sciences > 0101 Pure Mathematics > 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
Socio-Economic Objective (SEO2008): E Expanding Knowledge > 97 Expanding Knowledge > 970101 Expanding Knowledge in the Mathematical Sciences
URI: http://eprints.usq.edu.au/id/eprint/21199

Actions (login required)

View Item Archive Repository Staff Only