Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- An ant colony algorithm based on clustering and partition optimization
- An improved ant colony algorithm for solving TSP problems
- Research on an improved multi-strategy ant colony algorithm for TSP problem
- An improved ant colony algorithm for traveling salesman problems
- scientific article; zbMATH DE number 6452666
Cited in
(7)- Using the ant colony algorithm and the simulated annealing parallel algorithm to solve the traveling salesman problem
- A new algorithm for traveling salesman problems based on negative feedback ant colony algorithm supervised by 2-optimization
- scientific article; zbMATH DE number 2013451 (Why is no real title available?)
- Research on an improved multi-strategy ant colony algorithm for TSP problem
- scientific article; zbMATH DE number 6452666 (Why is no real title available?)
- An ant colony algorithm based on clustering and partition optimization
- Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm
This page was built for publication: Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515191)
