A Linear Time Algorithm for the 3-neighbour Traveling Salesman Problem on Halin graphs and extensions release_sgki4xxk45fp7jhegekflsiuhe

by Brad Woods, Abraham Punnen, Tamon Stephen

Released as a article .

2017  

Abstract

The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs are defined on all pairs of edges contained in the Hamilton cycle. This is a more general version than the commonly studied QTSP which only considers pairs of adjacent edges. We define a restricted version of QTSP, the k-neighbour TSP (TSP(k)), and give a linear time algorithm to solve TSP(k) on a Halin graph for k≤ 3. This algorithm can be extended to solve TSP(k) on any fully reducible class of graphs for any fixed k in polynomial time. This result generalizes corresponding results for the standard TSP. TSP(k) can be used to model various machine scheduling problems as well as an optimal routing problem for unmanned aerial vehicles (UAVs).
In text/plain format

Archived Files and Locations

application/pdf  525.8 kB
file_q6b643527naqtpbvchm76dcl3i
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-09-04
Version   v5
Language   en ?
arXiv  1504.02151v5
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 51a553bc-5893-48f6-8c2f-7ba1fb4d2203
API URL: JSON