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:

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.