Hybrid heuristics for the probabilistic maximal covering location-allocation problem (original) (raw)
Related papers
A decomposition approach for the probabilistic maximal covering location-allocation problem
Computers & Operations Research, 2009
RePEc: Research Papers in Economics, 1996
2000
Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times
Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
Journal of Regional Science, 1998
PROBABILISTIC, MAXIMAL COVERING LOCATION– ALLOCATION MODELS FOR CONGESTED SYSTEMS
Vladimir Marianov, Daniel Serra
The queuing probabilistic location set covering problem and some extensions
Socio-Economic Planning Sciences, 1994
A decomposition heuristic for the maximal covering location problem
Marcos A Pereira, Luiz Antonio Nogueira Lorena, Edson L F Senne
2010
A LAGRANGEAN/SURROGATE HEURISTIC FOR THE MAXIMAL COVERING LOCATION PROBLEM USING HILLSMANS EDITION
2001
Maximal Covering Location Problem with Multiple Coverage Requirements
1997
Minimisation Of Network Covering Services With Predefined Centres
ECMS 2018 Proceedings edited by Lars Nolle, Alexandra Burger, Christoph Tholen, Jens Werner, Jens Wellhausen, 2018
A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem
Marcos A Pereira, Leandro C Coelho, Luiz Antonio Nogueira Lorena
2015
2012
Location Modeling Utilizing Maximum Service Distance Criteria
Geographical Analysis, 2010
The probabilistic gradual covering location problem on a network with discrete random demand weights
Computers & Operations Research, 2011
The k-centrum multi-facility location problem
Discrete Applied Mathematics, 2001
Distributed Placement of Service Facilities in Large-Scale Networks
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007
Location and allocation of service units on a congested network
IIE Transactions, 2008
Geographical Analysis, 2010
A Comparison of Exact and Heuristic Methods for a Facility Location Problem
International journal of simulation: systems, science & technology
Solving maximal covering location problem using genetic algorithm with local refinement
Solving Large Location-Allocation problems by Clustering and Simulated Annealing
2013
LOCAL SEARCH HEURISTICS FOR FACILITY LOCATION PROBLEMS
International Journal of Systems Science, 2013
The K-coverage concentrator location problem
Applied Mathematical Modelling, 1992
A practical heuristic for maximum coverage in large-scale continuous location problem
2021