Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

Author： Xu Shuhui   Wang Yong   Huang Aiqin  

Publisher： MDPI

E-ISSN： 1999-4893|7|2|229-242

ISSN： 1999-4893

Source： Algorithms, Vol.7, Iss.2, 2014-05, pp. : 229-242

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach

By Isaacs Jason T.   Hespanha João P.  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 84-99

MDPI

Access to resources Recommend Favorite

Imperialist Competitive Algorithm with Dynamic Parameter Adaptation Using Fuzzy Logic Applied to the Optimization of Mathematical Functions

By Bernal Emer   Castillo Oscar   Soria José   Valdez Fevrier  

Algorithms, Vol. 10, Iss. 1, 2017-01 ,pp. : 18-18

MDPI

Access to resources Recommend Favorite

Interaction Enhanced Imperialist Competitive Algorithms

By Lin Jun-Lin   Tsai Yu-Hsiang   Yu Chun-Ying   Li Meng-Shiou  

Algorithms, Vol. 5, Iss. 4, 2012-10 ,pp. : 433-448

MDPI

Access to resources Recommend Favorite

A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint

By Zhu Daxin   Wang Xiaodong  

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 485-493

MDPI

Access to resources Recommend Favorite

Solving the Examination Timetabling Problem in GPUs

By Kolonias Vasileios   Goulas George   Gogos Christos   Alefragis Panayiotis   Housos Efthymios  

Algorithms, Vol. 7, Iss. 3, 2014-07 ,pp. : 295-327

MDPI

Access to resources Recommend Favorite