The generalized maximal covering location problem

Authors:
Oded Berman;Dmitry Krass
Affiliations:
Joseph L. Rotman School of Management, University of Toronto 105 St. George Street, Toronto, Ont., Canada;Joseph L. Rotman School of Management, University of Toronto 105 St. George Street, Toronto, Ont., Canada
Venue:
Computers and Operations Research - Location analysis
Year:
2002

Citing 1
Cited 13

The generalized maximal covering location problem

Computers and Operations Research - Location analysis

The generalized maximal covering location problem

Computers and Operations Research - Location analysis
Locating a semi-obnoxious facility with expropriation

Computers and Operations Research
Effective spatial clustering methods for optimal facility establishment

Intelligent Data Analysis
The Ordered Gradual Covering Location Problem on a Network

Discrete Applied Mathematics
Review: Generalized coverage: New developments in covering location models

Computers and Operations Research
Survey: Covering problems in facility location: A review

Computers and Industrial Engineering
Facility location and scale decision problem with customer preference

Computers and Industrial Engineering
Maximal covering location problem (MCLP) with fuzzy travel times

Expert Systems with Applications: An International Journal
A decision support system for locating weapon and radar positions in stationary point air defence

Information Systems Frontiers
Branch Reconfiguration Practice Through Operations Research in Industrial and Commercial Bank of China

Interfaces
A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii

Knowledge-Based Systems
A framework for electric vehicle charging-point network optimization

IBM Journal of Research and Development
Geo-spotting: mining online location-based services for optimal retail store placement

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a generalization of the maximal cover location problem which allows for partial coverage of customers, with the degree of coverage being a non-increasing step function of the distance to the nearest facility. Potential application areas for this generalized model to locating retail facilities are discussed.We show that, in general, our problem is equivalent to the uncapacitated facility location problem. We develop several integer programming formulations that capitalize on the special structure of our problem. Extensive computational analysis of the solvability of our model under a variety of conditions is presented.