A polynomial-time deterministic approach to the travelling salesperson problem

Ali Jazayeri*, Hiroki Sayama

*この研究の対応する著者

研究成果: Article査読

抄録

We propose a new polynomial-time deterministic algorithm that produces an approximated solution for the travelling salesperson problem. The proposed algorithm ranks cities based on their priorities calculated using a power function of means and standard deviations of their distances from other cities and then connects the cities to their neighbours in the order of their priorities. When connecting a city, a neighbour is selected based on their neighbours' priorities calculated as another power function that additionally includes their distance from the focal city to be connected. This repeats until all the cities are connected into a single loop. The time complexity of the proposed algorithm is (Formula presented.), where n is the number of cities. Numerical evaluation shows that, despite its simplicity, the proposed algorithm produces shorter tours with less time complexity than other conventional tour construction heuristics. The proposed algorithm can be used by itself or as an initial tour generator for other more complex heuristic optimisation algorithms.

本文言語English
ページ(範囲)454-460
ページ数7
ジャーナルInternational Journal of Parallel, Emergent and Distributed Systems
35
4
DOI
出版ステータスPublished - 2020 7 3
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ ネットワークおよび通信

フィンガープリント

「A polynomial-time deterministic approach to the travelling salesperson problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル