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
|HTML Citation||EndNote||Dublin Core||Reference Manager|
Full text not available from this archive.
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.
|Item Type:||Article (Commonwealth Reporting Category C)|
|Additional Information:||Permanent restricted access to published version due to publisher copyright policy.|
|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|
|Deposited On:||07 May 2012 20:11|
|Last Modified:||31 May 2012 11:55|
Archive Staff Only: edit this record