Worst-case analysis of two travelling salesman heuristics

  • Authors:

  • Hoon Liong Ong;J. B. Moore

  • Affiliations:

  • Department of Industrial & Systems Engineering, National University of Singapore, Kent Ridge, Singapore 0511;Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

  • Venue:
  • Operations Research Letters
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we analyze the worst-case performance of some heuristics for the symmetric travelling salesman problem. We show that the worst-case ratios of tour length produced by the savings and greedy heuristics to that of a minimum tour are bounded by [log"2n]+1 and 0.5([log"2n]+1) respectively, where n is the number of cities.