The minimum weighted covering location problem with distance constraints

Authors:
Oded Berman;Rongbing Huang
Affiliations:
Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ont., Canada M5S 3E6;School of Administrative Studies, York University, Atkinson Building, 4700 Keele Street, Toronto, Ont., Canada M3J 1P3
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 3

The maximal covering location problem with capacities on total workload

Management Science
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
Solving the anti-covering location problem using Lagrangian relaxation

Computers and Operations Research
Tabu Search

Tabu Search

Fuzzy logic based algorithms for maximum covering location problems

Information Sciences: an International Journal
Survey: Covering problems in facility location: A review

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

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The objective is to locate undesirable facilities on a network so as to minimize the total demand covered subject to the condition that no two facilities are allowed to be closer than a pre-specified distance. We prove that there exists a dominating location set and that it is a challenging problem to determine the consistency of the distance constraints. We compare several different mathematical formulations to solve the problem. Heuristics with computational experiments are provided.