An improved ant colony algorithm for traveling salesman problems
From MaRDI portal
Publication:2923749
Recommendations
- An improved ant colony algorithm for solving TSP problems
- An improved ant colony algorithm based on pheromone and applications in the TSP
- An improved ant colony algorithm and its application in TSP
- Solution of TSP based on an improved ant colony algorithm and its simulations
- An ant colony algorithm based on clustering and partition optimization
Cited in
(48)- A new imperialist competitive algorithm for solving TSP problem
- Research of ant colony algorithm on TSP problems
- Solution of TSP problem by using algorithm of reactive ant colony with restricted candidate list
- An ant colony algorithm based on clustering and partition optimization
- An improved ant colony algorithm and its application in TSP
- An improved discrete butterfly optimization algorithm for solving TSP
- Ant colony algorithm with semi-dynamic candidates list
- scientific article; zbMATH DE number 1390344 (Why is no real title available?)
- An improved ant colony algorithm for solving TSP problems
- scientific article; zbMATH DE number 2092224 (Why is no real title available?)
- Improved fruit fly optimization algorithm-based traveling salesman problem
- Using a combination of the ant algorithm and an immune algorithm to solve TSP
- Adaptive temperature rising simulated annealing algorithm for traveling salesman problem
- An improved mixed ant colony algorithm to solve the TSP problems
- Ant colony optimization for the traveling purchaser problem
- A solution of TSP based on the ant colony algorithm improved by particle swarm optimization
- Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm
- scientific article; zbMATH DE number 5205609 (Why is no real title available?)
- An improved ant colony system for the sequential ordering problem
- A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
- Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
- Research on an improved multi-strategy ant colony algorithm for TSP problem
- New imperialist competitive algorithm to solve the travelling salesman problem
- Combining heuristics and modifying local information to guide ant-based search
- Solution of TSP based on an improved ant colony algorithm and its simulations
- Mixing behavior ant colony algorithm for solving minimum ratio traveling salesman problem
- Application of an ant colony optimization based on attractive field in TSP
- Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
- A new algorithm for traveling salesman problems based on negative feedback ant colony algorithm supervised by 2-optimization
- An improved bacterial foraging algorithm for traveling salesman problem
- An improved ant colony optimization algorithm based on particle swarm optimization
- Tourist routes optimization based on improved ant colony algorithm
- scientific article; zbMATH DE number 5927437 (Why is no real title available?)
- A TSP algorithm based on clustering ensemble ACO and restricted solution space
- Application of improved genetic simulated annealing algorithm in TSP optimization
- A changing index self-adaptive ant algorithm
- scientific article; zbMATH DE number 2158375 (Why is no real title available?)
- An ACO\&SS algorithm for traveling salesman problem
- scientific article; zbMATH DE number 1703864 (Why is no real title available?)
- Solve uncertain TSP problems by hybrid approach based on ant algorithm
- An improved immune genetic algorithm for optimal path of travelling salesman problems
- scientific article; zbMATH DE number 1960695 (Why is no real title available?)
- scientific article; zbMATH DE number 2156295 (Why is no real title available?)
- An improved ant colony algorithm based on pheromone and applications in the TSP
- Simulated annealing-based ant colony algorithm for traveling salesman problems
- A discrete artificial bee colony algorithm for TSP
- A DSS based on hybrid ant colony optimization algorithm for the TSP
- Using the ant colony algorithm and the simulated annealing parallel algorithm to solve the traveling salesman problem
This page was built for publication: An improved ant colony algorithm for traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923749)
