Abstract
The terminal assignment (TA) problem is an important problem in the design of telecommunication networks. The problem consists in determining the best links for connecting a given set of terminals to a given set of concentrators so that a given cost function is optimized. In this paper, we have proposed an artificial bee colony algorithm based approach for solving the TA problem. In comparison with the best methods available in the literature, the proposed approach obtained better quality solutions in shorter time.
Author supplied keywords
Cite
CITATION STYLE
Banda, J., & Singh, A. (2015). A hybrid artificial bee colony algorithm for the terminal assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8947, pp. 134–144). Springer Verlag. https://doi.org/10.1007/978-3-319-20294-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
