5
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems

&
Pages 71-87 | Published online: 14 Aug 2013
 

SYNOPTIC ABSTRACT

The use of assignment ranking techniques for solving the traveling salesman problem is considered in a probabilistic framework. The principal focus of the paper is on the assumptions required for a valid mathematical analysis. For the asymmetric case, we show that the assumptions are violated when clustering of cites is present; for the symmetric problem, we show that a valid analysis can be made when 2-city subtours are eliminated. Prior probabilistic results developed by Panayiotopoulos for asymmetric problems are extended to the symmetric case.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.