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

被引:0
作者
B. Jayalakshmi
Alok Singh
机构
[1] University of Hyderabad,School of Computer and Information Sciences
来源
International Journal of Machine Learning and Cybernetics | 2017年 / 8卷
关键词
Artificial bee colony algorithm; Cooperative maximum covering location problem; Heuristic; Networks; Swarm intelligence.;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:691 / 697
页数:6
相关论文
共 41 条
[1]  
Averbakh I(2014)Cooperative covering problems on networks Networks 63 334-349
[2]  
Berman O(1994)The p maximal cover—p partial center problem on networks Eur J Oper Res 72 432-442
[3]  
Krass D(2010)Cooperative cover location problems: the planar case IIE Trans 42 232-246
[4]  
Kalcsics J(2011)Discrete cooperative covering problems J Oper Res Soc 62 2002-2012
[5]  
Nickel S(1974)The maximal covering location problem Pap Reg Sci Assoc 32 101-118
[6]  
Berman O(1981)On a modified one-center model Manag Sci 27 848-851
[7]  
Berman O(1986)The p-cover problem Eur J Oper Res 26 312-313
[8]  
Drezner Z(2004)The big triangle small triangle method for the solution of nonconvex facility location problems Oper Res 52 128-135
[9]  
Krass D(2010)Covering continuous demand in the plane J Oper Res Soc 61 878-881
[10]  
Berman O(2007)A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm J Glob Optim 39 459-471