Back to Search
Start Over
Solving TSP based on an Improved Ant Colony Optimization Algorithm
- Source :
- Journal of Physics: Conference Series. 1982:012061
- Publication Year :
- 2021
- Publisher :
- IOP Publishing, 2021.
-
Abstract
- Traveling Salesman Problem (TSP) is a typical Problem in combinatorial optimization field in modern times. Most of the problems in reality can be transformed into TSP problems for solving. Such as postal problems, communication network design, etc. Ant colony algorithm, as a heuristic algorithm, has been successfully applied to solving TSP problems. Based on the improved ant colony algorithm, this paper solves the travel agent problem, evaluates the population according to the membership degree, and updates the pheromone in turn, so as to achieve a good balance in solving speed and quality.
- Subjects :
- History
Mathematical optimization
education.field_of_study
Degree (graph theory)
Computer science
Communication network design
Ant colony optimization algorithms
Population
MathematicsofComputing_NUMERICALANALYSIS
ComputingMethodologies_ARTIFICIALINTELLIGENCE
Travelling salesman problem
Field (computer science)
Computer Science Applications
Education
Combinatorial optimization
education
Subjects
Details
- ISSN :
- 17426596 and 17426588
- Volume :
- 1982
- Database :
- OpenAIRE
- Journal :
- Journal of Physics: Conference Series
- Accession number :
- edsair.doi...........77d2c9a24e563499669c1a937864dba3