A mean-shift algorithm for large-scale planar maximal covering location problems

doi:10.1016/j.ejor.2015.09.006

CSpace > 系统科学研究所

	A mean-shift algorithm for large-scale planar maximal covering location problems
	He, Zhou 1; Fan, Bo 2; Cheng, T. C. E.3; Wang, Shou-Yang4 ; Tan, Chin-Hon 1
	2016-04-01
发表期刊	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
ISSN	0377-2217
卷号	250 期号:1 页码:65-76
摘要	The planar maximal covering location problem (PMCLP) concerns the placement of a given number of facilities anywhere on a plane to maximize coverage. Solving PMCLP requires identifying a candidate locations set (CLS) on the plane before reducing it to the relatively simple maximal covering location problem (MCLP). The techniques for identifying the CLS have been mostly dominated by the well-known circle intersect points set (CIPS) method. In this paper we first review PMCLP, and then discuss the advantages and weaknesses of the CIPS approach. We then present a mean-shift based algorithm for treating large-scale PMCLPs, i.e., MSMC. We test the performance of MSMC against the CIPS approach on randomly generated data sets that vary in size and distribution pattern. The experimental results illustrate MSMC's outstanding performance in tackling large-scale PMCLPs. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
关键词	Location Large scale optimization Planar maximal covering location problem Mean shift
DOI	10.1016/j.ejor.2015.09.006
语种	英语
资助项目	Singapore National Research Foundation under the Campus for Research Excellence and Technological Enterprise (CREATE) programme[E2S2] ; National Science Foundation of China[91024007] ; National Science Foundation of China[71371122] ; National Social Science Foundation of China[14ZDB152] ; Hong Kong Polytechnic University under the Fung Yiu King - Wing Hang Bank Endowed Professorship in Business Administration
WOS研究方向	Business & Economics ; Operations Research & Management Science
WOS类目	Management ; Operations Research & Management Science
WOS记录号	WOS:000368951300005
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/21862
专题	系统科学研究所
通讯作者	Fan, Bo
作者单位	1.Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 117548, Singapore 2.Shanghai Jiao Tong Univ, Sch Int & Publ Affairs, 1954 Huashan Rd, Shanghai 200030, Peoples R China 3.Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China 4.Chinese Acad Sci, Acad Math & Syst Sci, Being 100190, Peoples R China
推荐引用方式 GB/T 7714	He, Zhou,Fan, Bo,Cheng, T. C. E.,et al. A mean-shift algorithm for large-scale planar maximal covering location problems[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,2016,250(1):65-76.
APA	He, Zhou,Fan, Bo,Cheng, T. C. E.,Wang, Shou-Yang,&Tan, Chin-Hon.(2016).A mean-shift algorithm for large-scale planar maximal covering location problems.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,250(1),65-76.
MLA	He, Zhou,et al."A mean-shift algorithm for large-scale planar maximal covering location problems".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 250.1(2016):65-76.