Name
Abstract | ||
|---|---|---|
When planning a new development (facility/service site), location decisions are always the major issue. In this paper we introduce a novel query capacity constraint MaxBRNN, which can solve the facility location selection problem efficiently.The MaxBRNN (maximizing BRNN) query is based on bichromatic reverse nearest neighbor (BRNN) query which uses the number of reverse nearest customers to model the influence of a facility location. The MaxBRNN query has been appreciated extensively in spatial database studies because of its great potential in real life applications, such as, markets decision, sensor network clustering and the design of GSM (global system for mobile communication). The existing researches mostly suppose that the service facility's capacity is unlimited. However, in real cases, facilities are inevitably constrained by designed capacities. For example, if the government wants to select a new place to set up an emergency center to share the existing centers' patients, they need to know the current emergency centers' capacity so that they can estimate the new center's scale. Thus, the capacity constrained MaxBRNN query is significantly important in planning a new development. As far as we know, the capacity constrained MaxBRNN query has not been studied yet, so, we formulate this problem, propose a basic solution and develop some efficient algorithms for the query.Our major contributions are as follows: (1) we propose a novel query capacity constraint MaxBRNN which can solve the facility location selection problem effectively and efficiently; (2) we develop a basic algorithm CCMB and two improved algorithms which can find out the optimal region in terms of building a new facility, maximize its impact and deal with the complicated reassignment when adding new facilities into the dataset; (3) we prove the algorithms' effectiveness and efficiency by extensive experiments using both real and synthetic data sets. We propose and formalize the capacity constrained MaxBRNN query.We propose a basic algorithm CCMB which can solve the problem efficiently.We develop two improved methods: Prog-CCMB and Pruning-CCMB.We prove the algorithms' effectiveness and efficiency for facility selection query. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.eswa.2015.08.051 | Expert Systems with Applications |
Keywords | Field | DocType |
MaxBRNN query,Capacity constraint,Optimal region | Data mining,Computer science,Facility location problem,Artificial intelligence,Cluster analysis,Spatial database,Nearest neighbor search,Query optimization,Mathematical optimization,Need to know,Wireless sensor network,Machine learning,Mobile telephony | Journal |
Volume | Issue | ISSN |
43 | C | 0957-4174 |
Citations | PageRank | References |
2 | 0.37 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fangshu Chen | 1 | 12 | 2.20 |
| Huaizhong Lin | 2 | 67 | 12.34 |
| Yunjun Gao | 3 | 862 | 89.71 |
| Dongming Lu | 4 | 163 | 32.29 |