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
Due to scheduled maintenance work on our core network, there may be short service disruptions on this website between 16:00 and 16:30 CEST on September 25th.
Article

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

by 1,2, 1,2,* and 1,2
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.
Algorithms 2014, 7(2), 229-242; https://0-doi-org.brum.beds.ac.uk/10.3390/a7020229
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)
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
Show Figures

Graphical abstract

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. https://0-doi-org.brum.beds.ac.uk/10.3390/a7020229

AMA Style

Xu S, Wang Y, Huang A. Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem. Algorithms. 2014; 7(2):229-242. https://0-doi-org.brum.beds.ac.uk/10.3390/a7020229

Chicago/Turabian Style

Xu, Shuhui, Yong Wang, and Aiqin Huang. 2014. "Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem" Algorithms 7, no. 2: 229-242. https://0-doi-org.brum.beds.ac.uk/10.3390/a7020229

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop