Application of imperialist competitive algorithm on solving the traveling salesman problem

DOI10.3390/a7020229zbMath1461.90126OpenAlexW1994756311MaRDI QIDQ1736616

Aiqin Huang, Shuhui Xu, Yong Wang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a7020229

zbMATH Keywords

numerical experimentstraveling salesman problem2-opt algorithmdiscrete imperialist competitive algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Multi-period mean-semivariance portfolio optimization based on uncertain measure

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• The Euclidean traveling salesman problem is NP-complete
• The traveling salesman problem and its variations
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Genetic operators for combinatorial optimization in TSP and microarray gene ordering
• New Imperialist Competitive Algorithm to solve the travelling salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: Application of imperialist competitive algorithm on solving the traveling salesman problem