Application of imperialist competitive algorithm on solving the traveling salesman problem

DOI10.3390/A7020229zbMATH Open1461.90126OpenAlexW1994756311MaRDI QIDQ1736616FDOQ1736616

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

Recommendations

• Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
• New imperialist competitive algorithm to solve the travelling salesman problem
• A new imperialist competitive algorithm for solving TSP problem
• An imperialist competitive algorithm for solving constrained optimization problem
• scientific article; zbMATH DE number 2111225
• An immune inspired-based optimization algorithm: application to the traveling salesman problem
• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

zbMATH Keywords

numerical experimentstraveling salesman problem2-opt algorithmdiscrete imperialist competitive algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (1)

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

Uses Software

• Concorde

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

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