An improved ant colony algorithm for traveling salesman problems
From MaRDI portal
Publication:2923749
zbMATH Open1313.90267MaRDI QIDQ2923749FDOQ2923749
Authors: Peidong Wang, Gongyou Tang, Xixin Yang, Yang Li
Publication date: 3 November 2014
Published in: Periodical of Ocean University of China (Search for Journal in Brave)
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (48)
- A solution of TSP based on the ant colony algorithm improved by particle swarm optimization
- Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
- Ant colony optimization for the traveling purchaser problem
- An ant colony algorithm based on clustering and partition optimization
- Research on an improved multi-strategy ant colony algorithm for TSP problem
- Title not available (Why is that?)
- New imperialist competitive algorithm to solve the travelling salesman problem
- Application of a modified imperialist competitive algorithm for solving the traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved bacterial foraging algorithm for traveling salesman problem
- An improved ant colony algorithm based on pheromone and applications in the TSP
- An ACO\&SS algorithm for traveling salesman problem
- A DSS based on hybrid ant colony optimization algorithm for the TSP
- An improved ant colony system for the sequential ordering problem
- An improved discrete butterfly optimization algorithm for solving TSP
- Mixing behavior ant colony algorithm for solving minimum ratio traveling salesman problem
- A new imperialist competitive algorithm for solving TSP problem
- Improved fruit fly optimization algorithm-based traveling salesman problem
- Adaptive temperature rising simulated annealing algorithm for traveling salesman problem
- A new algorithm for traveling salesman problems based on negative feedback ant colony algorithm supervised by 2-optimization
- Title not available (Why is that?)
- Solution of TSP problem by using algorithm of reactive ant colony with restricted candidate list
- A discrete artificial bee colony algorithm for TSP
- Research of ant colony algorithm on TSP problems
- Title not available (Why is that?)
- Simulated annealing-based ant colony algorithm for traveling salesman problems
- Using the ant colony algorithm and the simulated annealing parallel algorithm to solve the traveling salesman problem
- An improved ant colony algorithm for solving TSP problems
- Using a combination of the ant algorithm and an immune algorithm to solve TSP
- An improved mixed ant colony algorithm to solve the TSP problems
- Solution of TSP based on an improved ant colony algorithm and its simulations
- Combining heuristics and modifying local information to guide ant-based search
- Application of an ant colony optimization based on attractive field in TSP
- Title not available (Why is that?)
- An improved ant colony optimization algorithm based on particle swarm optimization
- Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm
- Title not available (Why is that?)
- Tourist routes optimization based on improved ant colony algorithm
- A TSP algorithm based on clustering ensemble ACO and restricted solution space
- A changing index self-adaptive ant algorithm
- Ant colony algorithm with semi-dynamic candidates list
- Application of improved genetic simulated annealing algorithm in TSP optimization
- An improved immune genetic algorithm for optimal path of travelling salesman problems
- An improved ant colony algorithm and its application in TSP
- A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
- Solve uncertain TSP problems by hybrid approach based on ant algorithm
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)