An empirical comparison of five efficient heuristics for Maximal Covering Location Problems

2009 ◽  
Author(s):  
Li Xia ◽  
Ming Xie ◽  
Weida Xu ◽  
Jinyan Shao ◽  
Wenjun Yin ◽  
...  
Keyword(s):  
Location Problems ◽  
Empirical Comparison ◽  
Maximal Covering

Minmax Regret Maximal Covering Location Problems with Edge Demands

2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía
Keyword(s):  
Location Problems ◽  
Maximal Covering ◽  
Minmax Regret

A mean-shift algorithm for large-scale planar maximal covering location problems

2016 ◽  
Vol 250 (1) ◽  
pp. 65-76 ◽  
Author(s):  
Zhou He ◽  
Bo Fan ◽  
T.C.E. Cheng ◽  
Shou-Yang Wang ◽  
Chin-Hon Tan
Keyword(s):  
Large Scale ◽  
Mean Shift ◽  
Location Problems ◽  
Mean Shift Algorithm ◽  
Maximal Covering

scholarly journals Maximal Covering Location Problems on networks with regional demand

Omega ◽  
2016 ◽  
Vol 64 ◽  
pp. 77-85 ◽  
Author(s):  
Rafael Blanquero ◽  
Emilio Carrizosa ◽  
Boglárka G.-Tóth
Keyword(s):  
Location Problems ◽  
Maximal Covering ◽  
Regional Demand

scholarly journals A Decomposition Heuristic for the Maximal Covering Location Problem

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Edson Luiz França Senne ◽  
Marcos Antonio Pereira ◽  
Luiz Antonio Nogueira Lorena
Keyword(s):  
Location Problem ◽  
Optimal Solution ◽  
Real Data ◽  
Upper Bounds ◽  
Location Problems ◽  
Exact Methods ◽  
Maximal Covering ◽  
Facility Locations ◽  
Coupling Constraints ◽  
Partitioning Technique

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature.

scholarly journals A separation based optimization approach to Dynamic Maximal Covering Location Problems with switched structure

2017 ◽  
Vol 13 (5) ◽  
pp. 0-0
Author(s):  
Vadim Azhmyakov ◽  
◽  
Juan P. Fernández-Gutiérrez ◽  
Erik I. Verriest ◽  
Stefan W. Pickl ◽  
...  
Keyword(s):  
Location Problems ◽  
Optimization Approach ◽  
Maximal Covering
Sign in / Sign up

Export Citation Format

Share Document