Article

A new heuristic for the continuous fixed-radius disc cover problem

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
Given a set P of n points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of P. We present a new 4-approximation algorithm with running time O(n log n) for this problem. Our proposed algorithm uses a simple approach and is easy to understand and implement.
Article
Full-text available
Since the 1950s, the number of natural and man-made disasters has increased exponentially and the facility location problem has become the preferred approach for dealing with emergency humanitarian logistical problems. To deal with this challenge, an exact algorithm and a heuristic algorithm have been combined as the main approach to solving this problem. Owing to the importance that an exact algorithm holds with regard to enhancing emergency humanitarian logistical facility location problems, this paper aims to conduct a survey on the facility location problems that are related to emergency humanitarian logistics based on both data modeling types and problem types and to examine the pre- and post-disaster situations with respect to facility location, such as the location of distribution centers, warehouses, shelters, debris removal sites and medical centers. The survey will examine the four main problems highlighted in the literature review: deterministic facility location problems, dynamic facility location problems, stochastic facility location problems, and robust facility location problems. For each problem, facility location type, data modeling type, disaster type, decisions, objectives, constraints, and solution methods will be evaluated and real-world applications and case studies will then be presented. Finally, research gaps will be identified and be addressed in further research studies to develop more effective disaster relief operations.
Article
Full-text available
One of the most important health care services is emergency medical service as it plays a vital role in saving people's lives and reducing the rate of mortality and morbidity. Over the last years, many review papers have discussed emergency medical services (EMS) location problems, however, only few review papers consider the full range of EMS systems. This review paper tries to fill this gap. Our review introduces the concept of emergency care pathway following the current trend in health care systems, i.e., shifting the central role from health care providers to patients. Considering the emergency care pathway, we provide a broad literature review and analysis in order to identify emerging challenges for future research.
Article
Full-text available
The minimum covering circle problem is widely utilized in the studies of single or multiple facility location problems. It may be employed to locate the essential locations of factories, schools, fire departments, hospital establishments, and other facilities, which could be considered as a point in a plane theoretically. In this paper, a new geometrical algorithm is presented which determines the minimum covering circle of all points on a plane in four steps. The model validity was considered by studying the coordinates of points with random numbers and different distributions. In order to show the accuracy of the proposed algorithm, numerical experiments were carried out and compared with other studies in the field. The results show that the proposed algorithm extremely outperforms other examined algorithms.
Article
Full-text available
Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We present a simple 4-approximation algorithm for this problem which runs in O(nlog n)-time. We also show how to extend this algorithm to other metrics, and to three dimensions.
Article
Full-text available
A VNS-based heuristic using both a facility as well as a customer type neighbourhood structure is proposed to solve the p-centre problem in the continuous space. Simple but effective enhancements to the original Elzinga-Hearn algorithm as well as a powerful ‘locate-allocate’ local search used within VNS are proposed. In addition, efficient implementations in both neighbourhood structures are presented. A learning scheme is also embedded into the search to produce a new variant of VNS that uses memory. The effect of incorporating strong intensification within the local search via a VND type structure is also explored with interesting results. Empirical results, based on several existing data set (TSP-Lib) with various values of p, show that the proposed VNS implementations outperform both a multi-start heuristic and the discrete-based optimal approach that use the same local search.
Article
Full-text available
Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max norm, by restricting the disk centers to lie on parallel lines. The run time and space of this algorithm is O(n log n) and O(n) respectively. This algorithm extends to any Lp norm and is asymptotically faster than known alternative approximation algorithms for the same approximation factor.
Article
Full-text available
Consider an infinite square grid G. How many discs of given radius r, centered at the vertices of G, are required, in the worst case, to completely cover an arbitrary disc of radius r placed on the plane? We show that this number is an integer in the set {3,4,5,6} whose value depends on the ratio of r to the grid spacing. One application of this result is to design facility location algorithms with constant approximation factors. Another application is to determine if a grid network design, where facilities are placed on a regular grid in a way that each potential customer is within a reasonably small radius around the facility, is cost effective in comparison to a nongrid design. This can be relevant to determine a cost effective design for base station placement in a wireless network
Article
Full-text available
We present a basic theorem in combinatorial geometry that leads to a family of approximation algorithms for the the geometric disk covering problem. These algorithms exhibit constant approximation factors, with a wide range of their choices. This exibility allows to achieve a running time that compares favourably with those of existing procedures. 1 Introduction and Main Results In this paper we present a basic theorem in combinatorial geometry and discuss its application to the well known problem of computing a geometric disk covering [1]. The theorem states as follows: Theorem 1 Consider a square lattice where the distance between two neighboring lattice vertices is one. Call a disk of xed radius r , centered at a lattice vertex, a grid disk. The number N of grid disks that are necessary and sucient to cover any disk of radius r placed on the plane, is given by: CASE 1. For r < p 2 2 , N does not exist. CASE 2. For p 2 2 r < p 10 4 , N = 6. CASE 3. For p 10 4...
Article
Many urban areas in developing countries are experiencing dramatic growth in both population and economy, which highlights the need for optimizing service affordance by the government. Driven by this demand, this article proposes a new concept, namely the hierarchical service facility (HSF), for managing services with multiple levels of service range. The challenge is to strategically position HSFs to cover all residents of a subdistrict at every service range level with a minimum cost. To this end, this location determination issue was formulated into a hierarchical discrete unit disk cover (H-DUDC) problem. An algorithmic solution using a multi-layered greedy heuristic was developed to solve the H-DUDC problem, and its effectiveness was validated through a practical case study. The experimental results indicate that the HSF concept is an effective tool for optimizing service resource distribution and balancing the use of public services in different sub-zones of a residential area.
Article
Given a set of n points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation algorithms have been designed over the last three decades. In this paper, we have engineered and experimentally compared practical performances of some of these algorithms on massive pointsets. The goal is to investigate which algorithms run fast and give good approximation in practice. We present a simple 7-approximation algorithm for UDC that runs in O(n) expected time and uses O(s) extra space, where s denotes the size of the generated cover. In our experiments, it turned out to be the speediest of all. We also present two heuristics to reduce the sizes of covers generated by it without slowing it down by much. To our knowledge, this is the first work that experimentally compares algorithms for the UDC problem. Experiments with them using massive pointsets (in the order of millions) throw light on their practical uses. We share the engineered algorithms via GitHub¹ for broader uses and future research in the domain of geometric optimization.
Article
We revisit the online Unit Covering problem in higher dimensions: Given a set of n points in Rd, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we work in Rd using the Euclidean distance. (I) We give an online deterministic algorithm with competitive ratio O(1.321d), thereby improving on the previous record, O(2ddlog⁡d), due to Charikar et al. (2004), by an exponential factor. In particular, the competitive ratios are 5 in the plane and 12 in 3-space (the previous ratios were 7 and 21, respectively). For d=3, the ratio of our online algorithm matches the ratio of the current best offline algorithm for the same problem due to Biniaz et al. (2017), which is remarkable (and rather unusual). (II) We show that the competitive ratio of every deterministic online algorithm for Unit Covering in Rd under the L2 norm is at least d+1 for every d≥1. This greatly improves upon the previous best lower bound, Ω(log⁡d/log⁡log⁡log⁡d), due to Charikar et al. (2004). (III) We generalize the above result to Unit Covering in Rd under the LC norm, where C is a centrally symmetric convex body, via the illumination number. (IV) We obtain lower bounds of 4 and 5 for the competitive ratio of any deterministic algorithm for online Unit Covering in R2 and R3, respectively; the previous best lower bounds were 3 for both cases. (V) When the input points are from the square or hexagonal lattice in R2, we give deterministic online algorithms for Unit Covering with an optimal competitive ratio of 3. For the cubic lattice in R3, we give a deterministic online algorithm with a competitive ratio of 5.
Article
Over the past 10 years, a considerable amount of research has been devoted to the development of models to support decision making in the particular yet important context of Emergency Medical Services (EMS). More specifically, the need for advanced strategies to take into account the uncertainty and dynamism inherent to EMS, as well as the pertinence of socially oriented objectives, such as equity, and patient medical outcomes, have brought new and exciting challenges to the field. In this context, this paper summarizes and discusses modern modelling approaches to address problems related to ambulance fleet management, particularly those related to vehicle location and relocation, as well as dispatching decisions. Although it reviews early works on static ambulance location problems, this review concentrates on recent approaches to address tactical and operational decisions, and the interaction between these two types of decisions. Finally, it concludes on the current state of the art and identifies promising research avenues in the field.
Article
We investigate the Within-Strip Discrete Unit Disk Cover problem (WSDUDC), where one wishes to find a minimal set of unit disks from an input set D so that a set of points P is covered. Furthermore, all points and disk centres are located in a strip of height h, defined by a pair of parallel lines. We give a general approximation algorithm which finds a 3[1√1- h2]-factor approximation to the optimal solution. We also provide a 4-Approximate solution given a strip where h ≤ 2√2/3, and a 3-Approximation in a strip if h ≥ 4/5, improving over the 6-Approximation for such strips using the general scheme. Finally, we show that WSDUDC is NPcomplete for a strip with any height h > 0.
Article
We present an 0(n(log n) 3 (loglogn) 2 ) algorithm for the problem of finding a point (x,y) in the plane that minimizes the maximal weighted distance to a point in a set of n given points. The algorithm can be extended to higher dimensional spaces. For any fixed dimension our bound is 0(n 1+ϵ ) for any ϵ>0.
Article
In this paper we consider the discrete unit disk cover problem and the rectangular region cover problem as follows. Given a set P{\cal P} of points and a set D{\cal D} of unit disks in the plane such that DiDDi\cup_{D_i\in \cal D} D_i covers all the points in P\cal P, select minimum cardinality subset DD{\cal D}^* \subseteq{\cal D} such that each point in P{\cal P} is covered by at least one disk in D{\cal D}^*. Given rectangular region R{\cal R} and a set D{\cal D} of unit disks in the plane such that RDiDDi{\cal R} \subseteq \cup_{D_i\in \cal D} D_i, select minimum cardinality subset DD{\cal D}^{**} \subseteq{\cal D} such that each point of a given rectangular region R{\cal R} is covered by at least one disk in D{\cal D}^{**}. For the first problem, we propose an (9 + ε)-factor (0 < ε ≤ 6) approximation algorithm. The previous best known approximation factor was 15 [Fraser, R., López-Ortiz, A.: The within-strip discrete unit disk cover problem, Can. Conf. on Comp. Geom. 61–66 (2012)]. For the second problem, we propose (i) an (9 + ε)-factor (0 < ε ≤ 6) approximation algorithm, (ii) an 2.25-factor approximation algorithm in reduce radius setup, improving previous 4-factor approximation result in the same setup [Funke, S., Kesseelman, A., Kuhn, F., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. Wir. Net. 13, 153–164 (2007)]. The solution of the discrete unit disk cover problem is based on a polynomial time approximation scheme (PTAS) for the subproblem line separable discrete unit disk cover, where all the points in P{\cal P} are on one side of a line and covered by the disks centered on the other side of that line.
Article
Let P = {p1, p2,…,pn} be a set of points in d-space. We study the problem of covering with the minimum number of fixed-size orthogonal hypersquares (CSd for short) all points in P. We present a fast approximation algorithm that generates provably good solutions and an improved polynomial-time approximation scheme for this problem. A variation of the CSd problem is the CRd problem, covering by fixed-size orthogonal hyperrectangles, where the covering of the points is by hyperrectangles with dimensions D1, D2,…,Dd instead of hypersquares of size D. Another variation is the CDd problem, where we cover the set of points with hyperdiscs of diameter D. Our algorithms can be easily adapted to these problems.
Conference Paper
I describe a C++ program for computing the smallest enclosing ball of a point set in d-dimensional space, using floating-point arithmetic only. The program is very fast for d ¿ 20, robust and simple (about 300 lines of code, excluding prototype definitions). Its new features are a pivoting approach resembling the simplex method for linear programming, and a robust update scheme for intermediate solutions. The program with complete documentation following the literate programming paradigm [3] is available on the Web.
Article
A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete problems. Such schemes consist of families of approximation algorithms for each desired performance bound on the relative error ε > Ο, with running time that is polynomial when ε is fixed. Though the polynomiality of these algorithms depends on the degree of approximation ε being fixed, they cannot be improved, owing to a negative result stating that there are no fully polynomial approximation schemes for strongly NP-complete problems unless NP = P. The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems. The method of using the technique and how it varies with problem parameters are illustrated. A similar technique, independently devised by B. S. Baker, was shown to be applicable for covering and packing problems on planar graphs.
Article
Presented is a simple O(n log n) algorithm for computing the smallest enclosing circle of a convex polygon. It can be easily extended to algorithms that compute the farthest-and the closest-point Voronoi diagram of a convex polygon within the same time bound.
Article
A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementation are presented. 1 Introduction During the recent years randomized algorithms have been developed for a host of problems in computational geometry. Many of these algorithms are not only attractive because of their efficiency, but also because of their appealing simplicity. This feature makes them easier to access for non-experts in the field, and for actual implementation. One of these simple algorithms is Seidel's Linear Programming algorithm, [Sei1], which solves a Linear Program with n constraints and d variables in expected O(n) time, provided d is constant