Covering Part of a Planar Network

Zvi Drezner () and George Wesolowsky ()

Networks and Spatial Economics, 2014, vol. 14, issue 3, 629-646

Abstract: The problem of locating facilities in a feasible area covering some parts of network links within a given radius is analyzed. The feasible area can be the interior (convex hull of the nodes) of a planar network or any union of convex polygons. Both minimization and maximization of coverage are considered. The single facility location problem is solved by the global optimization approach “Big Triangle Small Triangle.” The multiple facility maximization problem is solved by a specially designed heuristic algorithm. The idea of the heuristic algorithm may prove to work well on other planar multiple facility location problems. Computational experience with problems of up to 40,000 links demonstrate the effectiveness of the single facility and multiple facilities algorithms. The largest single facility minimal cover problem is solved in about one minute and the largest single facility maximal cover problem is solved in less than 4 minutes. Copyright Springer Science+Business Media New York 2014

Keywords: Networks; Maximal covering; Minimal covering; Obnoxious facilities (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s11067-014-9263-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:netspa:v:14:y:2014:i:3:p:629-646

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11067/PS2

DOI: 10.1007/s11067-014-9263-5

Access Statistics for this article

Networks and Spatial Economics is currently edited by Terry L. Friesz

More articles in Networks and Spatial Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().