A hybrid artificial bee colony algorithm for the terminal assignment problem

dc.contributor.author	Banda, Jayalakshmi
dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T05:55:49Z
dc.date.available	2022-03-27T05:55:49Z
dc.date.issued	2015-01-01
dc.description.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.
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.8947
dc.identifier.issn	03029743
dc.identifier.uri	10.1007/978-3-319-20294-5_12
dc.identifier.uri	http://link.springer.com/10.1007/978-3-319-20294-5_12
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8815
dc.subject	Artificial bee colony algorithm
dc.subject	Heuristic
dc.subject	Swarm intelligence
dc.subject	Telecommunication networks
dc.subject	Terminal assignment problem
dc.title	A hybrid artificial bee colony algorithm for the terminal assignment problem
dc.type	Book Series. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1