 Location coverage models with demand originating from nodes and paths: Application to cellular network designElif Tokar Erdemir, Rajan Batta, Seth Spielman, Peter A. Rogerson, Alan Blatt and Marie Flanigan European Journal of Operational Research, 2008, vol. 190, issue 3, 610-632 Abstract: Location covering problems, though well studied in the literature, typically consider only nodal (i.e. point) demand coverage. In contrast, we assume that demand occurs from both nodes and paths. We develop two separate models - one that handles the situation explicitly and one which handles it implicitly. The explicit model is formulated as a Quadratic Maximal Covering Location Problem - a greedy heuristic supported by simulated annealing (SA) that locates facilities in a paired fashion at each stage is developed for its solution. The implicit model focuses on systems with network structure - a heuristic algorithm based on geometrical concepts is developed. A set of computational experiments analyzes the performance of the algorithms, for both models. We show, through a case study for locating cellular base stations in Erie County, New York State, USA, how the model can be used for capturing demand from both stationary cell phone users as well as cell phone users who are in moving vehicles. Date: 2008 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:190:y:2008:i:3:p:610-632 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.