A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem

dc.contributor.author Jayalakshmi, B.
dc.contributor.author Singh, Alok
dc.date.accessioned 2022-03-27T05:53:25Z
dc.date.available 2022-03-27T05:53:25Z
dc.date.issued 2017-04-01
dc.description.abstract This paper proposes a hybrid artificial bee colony algorithm for the cooperative maximum covering location problem (CMCLP) on a network. In location covering problems, it is assumed that each facility generates a signal whose strength decreases with the increase in distance and a demand point is considered to be covered if the total signal strength received by it from various facilities exceeds a certain threshold. The objective of the CMCLP is to locate the facilities in such a way that maximizes the total demands covered. The proposed hybrid approach obtained better quality solutions in comparison to the methods available in the literature.
dc.identifier.citation International Journal of Machine Learning and Cybernetics. v.8(2)
dc.identifier.issn 18688071
dc.identifier.uri 10.1007/s13042-015-0466-y
dc.identifier.uri http://link.springer.com/10.1007/s13042-015-0466-y
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/8626
dc.subject Artificial bee colony algorithm
dc.subject Cooperative maximum covering location problem
dc.subject Heuristic
dc.subject Networks
dc.subject Swarm intelligence
dc.title A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem
dc.type Journal. Article
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: