An ant colony algorithm based on clustering and partition optimization
From MaRDI portal
Publication:5319792
zbMATH Open1174.68592MaRDI QIDQ5319792FDOQ5319792
Authors: Junzhong Ji, Zhen Huang, Chunnian Liu
Publication date: 22 July 2009
Recommendations
- An improved ant colony algorithm for solving TSP problems
- An improved ant colony algorithm for traveling salesman problems
- 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
- scientific article; zbMATH DE number 2158375
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (28)
- 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
- PNACO: parallel algorithm for neighbour joining hybridized with ant colony optimization on multi-core system
- Ant colony optimization with clustering for solving the dynamic location routing problem
- Title not available (Why is that?)
- The fuzzy ant colony algorithm and its application in TSP
- Research on an improved multi-strategy ant colony algorithm for TSP problem
- A hybrid-behavior ant-colony optimization algorithm with pheromone updated by multiple good solutions
- Ant colony optimization algorithm based on visual feedback and behavioral memory
- An ant colony optimisation-based approach for clustering in a data matrix
- Distributed multi-agent system for solving traveling salesman problem using ant colony optimization
- Title not available (Why is that?)
- An enhanced Ant Colony System for the Sequential Ordering 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?)
- 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
- Combining heuristics and modifying local information to guide ant-based search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm
- A TSP algorithm based on clustering ensemble ACO and restricted solution space
- Ant colony algorithm with semi-dynamic candidates list
- An improved ant colony algorithm for traveling salesman problems
- Title not available (Why is that?)
- Adaptive ant colony optimization algorithm based on information entropy: foundation and application
- Ant Colony Optimization with a Genetic Restart Approach toward Global Optimization
This page was built for publication: An ant colony algorithm based on clustering and partition optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5319792)