Location coverage models with demand originating from nodes and paths: Application to cellular network design (original) (raw)
Related papers
A practical heuristic for maximum coverage in large-scale continuous location problem
2021
This paper presents a new heuristic algorithm for the following covering problem. For a set of nnn demand points in continuous space, locate a given number of facilities or sensors anywhere on the plane in order to obtain maximum coverage. This means, in this problem an infinite set of potential locations in continuous space should be explored. We present a heuristic algorithm that finds a near-optimal solution for large-scale instances of this problem in a reasonable time. Moreover, we compare our results with previous algorithms on randomly generated datasets that vary in size and distribution. Our experiments show that in comparison to other methods in the literature, the proposed algorithm is scalable and can find solutions for large-scale instances very fast, when previous algorithms unable to handle these instances. Finally, some results of the tests performed on a real-world dataset are also presented.
Location Modeling Utilizing Maximum Service Distance Criteria
Geographical Analysis, 2010
The location set-covering problem (LSCP) and the maximal covering location problem (MCLP) have been the subject of considerable interest. As originally defined, both problems allowed facility placement d y at nodes. This paper deals with both problems for the case when facility placement is allowed anywhere on the network. Two theorems are presented that show that when facility placement is unrestricted for either the LSCP or MCLP at least one optimal solution exists that is composed entirely of pdnts belonging to a finite set of points called the network intersect point set (NIPS). Optimal solution approaches to the unrestricted site LSCP and MCLP problems that utilize the NIPS and previously developed solution methodologies are presented. Example solutions show that considerable improvement in the amount of coverage or the number of facilities needed to insure total coverage can be achieved by allowing facility p h e m e n t a h g arcs of the network. In addition, extensions to the arc-covering model and the ambulance-hospital model of ReVeUe, Toregas, and Falkson are developed and solved. 1. INTRODUCTION Recent interest in public facilities location has led to the development of several modeling approaches, differing principally in the measure of effectiveness used. A measure of effectiveness describes how well a particular location configuration performs with respect to the overall purpose the facilities are intended to serve. One measure used, the maximal service distance, is the distance or time that a user most distant from a facility would have to travel to reach that facility [ 8 ]. For a given locational configuration, the maximum distance that any user would have to travel to reach a facility represents the worst possible performance of the system.
Maximal Covering Location Problem with Multiple Coverage Requirements
1997
In this paper we examine the maximal covering location problem applied to a network in the context of multiple units being required by some demands. A demand node i which needs c i units is totally covered if for every j = 1, 2, ..., c i , the j th unit that responds to it, is within the time interval t jci . A weight w i is associated with every demand node i, that expresses the population to be served at demand node i. Every j response unit to a node i covers a fraction f ij of demands of node i which needs c i units. Finally number ∂ ij indicates the importance weight of the j th unit attached with covering demands from node i which needs c i units. The objective regarding the above assumptions is to find the location of a fixed number of units so as to maximize the weighted coverage of demand within the imposed service time. We develop a heuristic algorithm that finds a near-optimal solution for the above described model.
Applications of the Location Set-covering Problem
Geographical Analysis, 2010
The location set-covering problem is extended to a p p l y to three new situations. (1) The demands are assumed to occur continuously along arcs of a network. (2) A mobile unit departs from one of the locations to be chosen and picks up the demand, providing service at a still more distant point. (3) New demands and sites occur over time. N , = (j E Jlt, I s) for all p E P. Charles ReVelle is professor of geography and enuironmental engineering, The. Johns Hopkins Uniuersity. Constantine Toregas is affiliated with Public Technology, Inc. Louis Fa1 kson is economist, Cornell Uniuersity.
1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363), 1999
The cost and complexity of a network is closely related to the number of base-stations (BSs) required to achieve the system operator's service objectives. The location of BSs is not an easy task and there are numerous factors that must be taken into account when deciding the optimum position of BSs. This paper discusses the performance of three different algorithms developed to solve the BS location problem: the greedy algorithm (GR), the genetic algorithm (GA) and the combination algorithm for total optimisation (CAT). These three methods are compared and results are given for a typical test scenario.
Adaptive Cell Tower Location Using Geostatistics
2010
In this article, we address the problem of allocating an additional cell tower (or a set of towers) to an existing cellular network, maximizing the call completion probability. Our approach is derived from the adaptive spatial sampling problem using kriging, capitalizing on spatial correlation between cell phone signal strength data points and accounting for terrain morphology. Cell phone demand is reflected by population counts in the form of weights. The objective function, which is the weighted call completion probability, is highly nonlinear and complex (nondifferentiable and discontinuous). Sequential and simultaneous discrete optimization techniques are presented, and heuristics such as simulated annealing and Nelder-Mead are suggested to solve our problem. The adaptive spatial sampling problem is defined and related to the additional facility location problem. The approach is illustrated using data on cell phone call completion probability in a rural region of Erie County in western New York, and accounts for terrain variation using a line-of-sight approach. Finally, the computational results of sequential and simultaneous approaches are compared. Our model is also applicable to other facility location problems that aim to minimize the uncertainty associated with a customer visiting a new facility that has been added to an existing set of facilities.
An Optimized Approach for Selecting an Optimal Number of Cell Site Locations in Cellular Networks
2013
Wireless communication has seen gigantic advancement all the way through past years. The maturity of newer generations of technology and boost up in user mobility has created the need and demand for wireless networks that has triggered considerable technological advances as well as the investigation of optimization algorithms to support design and planning decisions. Wireless system providers will be vital to enlarge their infrastructure rapidly in order to meet this swift escalation in wireless data demand. Demand for cheaper and better wireless communication services from customers are the key factors to optimally design the cell geometry and select the minimum number of cell sites to provide maximum possible coverage. In this paper, we consider how to optimally determine the cell site locations such that, number of base stations (N) is minimum while coverage is maximum so that best possible service is possible with minimum infrastructural costs. An optimized algorithm is presente...
A decomposition approach for the probabilistic maximal covering location-allocation problem
Computers & Operations Research, 2009
The maximal covering location problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with a constraint in waiting time or queue length for congested systems, with one or more servers per service center. This paper