Application of imperialist competitive algorithm on solving the traveling salesman problem

DOI10.3390/A7020229MaRDI QIDQ1736616zbMATH OpenOpenAlexFDO

Authors Shuhui Xu, Yong Wang, Aiqin Huang

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

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

Cited in

(9)

• A new imperialist competitive algorithm for solving TSP problem
• An imperialist competitive algorithm for solving constrained optimization problem
• New imperialist competitive algorithm to solve the travelling salesman problem
• Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem
• Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
• A discrete gravitational search algorithm for solving combinatorial optimization problems
• Multi-period mean-semivariance portfolio optimization based on uncertain measure
• Interaction enhanced imperialist competitive algorithms
• A discrete artificial bee colony algorithm for TSP

Describes a project that uses

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)