371
Views
24
CrossRef citations to date
0
Altmetric
Section B

New Imperialist Competitive Algorithm to solve the travelling salesman problem

&
Pages 1495-1505 | Received 18 Jan 2012, Accepted 07 Dec 2012, Published online: 07 Mar 2013
 

Abstract

Imperialist Competitive Algorithm (ICA), which is a new socio-politically motivated global search strategy, is one of the intelligent computational algorithms. ICA has always been used to solve continuous problems. In this paper, however, ICA is applied to the travelling salesman problem (TSP), which is one of the most important discrete problems. The proposed algorithm is tested on 14 standard instances consisting of 50–199 nodes used in the literature. The computational results show that the ICA results are competitive with the results of other meta-heuristic algorithms used for solving the TSP. Furthermore, the proposed algorithm has been able to produce solutions which are very close to best-known solutions (BKS) for most of the instances in which 11 BKS are also found within a reasonable time.

2010 AMS Subject Classification:

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.