A new imperialist competitive algorithm for solving TSP problem

被引：0

作者：

Zhang X.-L. ^{[1
]}

Chen X.-W. ^{[1
]}

Xiao H. ^{[1
]}

Li W. ^{[1
]}

机构：

[1] School of Earth and Space Sciences, Peking University, Beijing

来源：

Zhang, Xin-Long (mtxinlong@126.com) | 1600年 / Northeast University卷 / 31期

关键词：

Genetic algorithm; Imperialist competitive algorithm; Traveling salesman problem;

D O I：

10.13195/j.kzyjc.2015.0126

中图分类号：

学科分类号：

摘要：

Imperialist competitive algorithm is a new socio-political motivated strategy, which has better performance in continuous optimization problems. In order to apply this method to complex discrete combinatorial optimization problems appropriately, an improved imperialist competitive algorithm for solving traveling salesman problem is proposed. Based on the traditional algorithm, the proposed algorithm changes the way of forming initial empires. In the assimilation process, solutions are improved by a replacement-reconstruction policy. Then a method of adaptive adjustment of mutation probabilities is introduced in the revolution process, which enhances the search capability of the proposed algorithm. The method of colony allocation is adjusted in the imperialist competition process. An imperialist improvement mechanism is presented in order to enhance the optimization speed. The results of a set of TSP instances demonstrate the superiority of the proposed algorithm in both solution quality and convergence speed. © 2016, Editorial Office of Control and Decision. All right reserved.

引用

页码：586 / 592

页数：6

共 16 条

[1]

Gao H.C., Feng B.Q., Zhu L., Reviews of the meta-heuristic algorithm for TSP, Control and Decision, 21, 3, pp. 241-247, (2006)

[2]

Mohammadi-Ivatloo B., Rabiee A., Soroudi A., Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch, Energy, 44, 1, pp. 228-240, (2012)

[3]

Forouharfard S., Zandieh M., An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems, The Int J of Advanced Manufacturing Technology, 51, 9, pp. 1179-1193, (2010)

[4]

Devika K., Jafarian A., Nourbakhsh V., Designing a sustainable closed-loop supply chain network based on triple bottom line approach: A comparison of metaheuristics hybridization techniques, European J of Operational Research, 235, 3, pp. 594-615, (2014)

[5]

Rahimi A., Karimi H., Afshar-Nadjafi B., Using metaheuristics for project scheduling under mode identity constraints, Applied Soft Computing, 13, 4, pp. 2124-2135, (2013)

[6]

Hosseini S., Khaled A., A survey on the Imperialist Competitive Algorithm metaheuristic: Implementation in engineering domain and directions for future research, Applied Soft Computing, 24, 11, pp. 1078-1094, (2014)

[7]

Ardalan Z., Karimi S., Poursabzi O., Et al., A novel imperialist competitive algorithm for generalized traveling salesman problems, Applied Soft Computing, 26, 1, pp. 546-555, (2015)

[8]

Atashpaz-Gargari E., Lucas C., Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition, IEEE Congress on Evolutionary Computation, pp. 4661-4667, (2007)

[9]

Shabani H., Vahidi B., Ebrahimpour M., A robust PID controller based on imperialist competitive algorithm for load-frequency control of power systems, ISA Transactions, 52, 1, pp. 88-95, (2013)

[10]

Lian K.L., Colonial competitive algorithm and its applications in optimization of discrete manufacturing system, (2012)

← 1 2 →