Insertion heuristics for central cycle problems

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A central cycle problem requires a cycle that is reasonably short and keeps the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low. The objective may be to minimize maximum distance or cycle length. Most classes of central cycle problems are NP-hard. This article investigates insertion heuristics for central cycle problems, drawing on insertion heuristics for p centers and travelling salesman tours. It shows that a modified farthest insertion heuristic has reasonable worst-case bounds. It then compares the performance of two farthest insertion heuristics on a range of problems from TSPLIB. It shows that a simple farthest insertion heuristic performs well in practice.
Original languageEnglish
Pages (from-to)70–80
Number of pages11
Issue number1
Early online date19 Sep 2009
Publication statusPublished - Aug 2010


  • tour
  • cycle center
  • eccentricity
  • cycle-length


Dive into the research topics of 'Insertion heuristics for central cycle problems'. Together they form a unique fingerprint.

Cite this