Next Article in Journal
Efficient Algorithms for Subgraph Listing
Next Article in Special Issue
Solving the Examination Timetabling Problem in GPUs
Previous Article in Journal / Special Issue
Stochastic Diffusion Search: A Comparison of Swarm Intelligence Parameter Estimation Algorithms with RANSAC
Article Menu

Export Article

Open AccessArticle
Algorithms 2014, 7(2), 229-242; doi:10.3390/a7020229

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

1
School of Mechanical Engineering, Shandong University, Jinan 250061, China
2
Key Laboratory of High-efficiency and Clean Mechanical Manufacture (Shandong University), Ministry of Education, Jinan 250061, China
*
Author to whom correspondence should be addressed.
Received: 9 March 2014 / Revised: 5 May 2014 / Accepted: 5 May 2014 / Published: 13 May 2014
(This article belongs to the Special Issue Bio-inspired Algorithms for Combinatorial Problems)
View Full-Text   |   Download PDF [265 KB, 15 May 2014; original version 13 May 2014]   |  

Abstract

The imperialist competitive algorithm (ICA) is a new heuristic algorithm proposed for continuous optimization problems. The research about its application on solving the traveling salesman problem (TSP) is still very limited. Aiming to explore its ability on solving TSP, we present a discrete imperialist competitive algorithm in this paper. The proposed algorithm modifies the original rules of the assimilation and introduces the 2-opt algorithm into the revolution process. To examine its performance, we tested the proposed algorithm on 10 small-scale and 2 large-scale standard benchmark instances from the TSPLIB and compared the experimental results with that obtained by two other ICA-based algorithms and six other existing algorithms. The proposed algorithm shows excellent performance in the experiments and comparisons. View Full-Text
Keywords: discrete imperialist competitive algorithm; traveling salesman problem; 2-opt algorithm; numerical experiments discrete imperialist competitive algorithm; traveling salesman problem; 2-opt algorithm; numerical experiments
Figures

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Xu, S.; Wang, Y.; Huang, A. Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem. Algorithms 2014, 7, 229-242.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top