A mean-shift algorithm for large-scale planar maximal covering location problems
文献类型：期刊论文
| 作者 | He, Zhou1; Fan, Bo2; Cheng, T. C. E.3; Wang, Shou-Yang4 ; Tan, Chin-Hon1
|
| 刊名 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
 |
| 出版日期 | 2016-04-01 |
| 卷号 | 250期号:1页码:65-76 |
| 关键词 | Location Large scale optimization Planar maximal covering location problem Mean shift |
| ISSN号 | 0377-2217 |
| DOI | 10.1016/j.ejor.2015.09.006 |
| 英文摘要 | 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. |
| 资助项目 | 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记录号 | WOS:000368951300005 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/21861]  |
| 专题 | 系统科学研究所 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。