Abstract
In recent years, intelligent algorithms have developed so fast and have obtained many achievements. Since ant colony optimization (ACO) algorithm was proposed, lots of improvements have been made. And it was applied to many problems, such as travel salesman problem (TSP), quadratic assignment problem (QAP), robot path planning, and so on. In this paper, a modified ant colony optimization based on the meta-heuristic ant colony algorithm is applied to solve power line path routing problem.
Author supplied keywords
Cite
CITATION STYLE
Feng, Q., Qi, F., & Liu, X. (2016). Ant colony optimization for power line routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9567, pp. 861–866). Springer Verlag. https://doi.org/10.1007/978-3-319-31854-7_90
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
