A new imperialist competitive algorithm for solving TSP problem

DOI10.13195/J.KZYJC.2015.0126MaRDI QIDQ2823547zbMATH OpenFDO

Authors Xinlong Zhang, Xiuwan Chen, Han Xiao, Wei Li

Publication date 6 October 2016

Published in Control and Decision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13195/J.KZYJC.2015.0126

zbMATH Keywords

genetic algorithmimperialist competitive algorithmtraveling salesman problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New imperialist competitive algorithm to solve the travelling salesman problem
• Application of imperialist competitive algorithm on solving the traveling salesman problem
• Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
• An imperialist competitive algorithm for solving constrained optimization problem
• An improved ant colony algorithm for traveling salesman problems

Cited in

(6)

• Interaction enhanced imperialist competitive algorithms
• Application of imperialist competitive algorithm on solving the traveling salesman problem
• New imperialist competitive algorithm to solve the travelling salesman problem
• Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
• Colonial competitive algorithm
• An imperialist competitive algorithm for solving constrained optimization problem

This page was built for publication: A new imperialist competitive algorithm for solving TSP problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823547)