The stratified p-center problem
Stratified_Revision.pdf (510,0Kb) (Restricted access) Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
Rights accessRestricted access - publisher's policy (embargoed until 2022-09-01)
This work presents an extension of the discrete p-center problem. In this new model, called Stratified p-Center Problem (SpCP), the demand is concentrated in a set of sites and the population of these sites is divided into different strata depending on the kind of service that they require. The aim is to locate p centers to cover the different types of services demanded minimizing the weighted average of the largest distances associated with each of the different strata. In addition, it is considered that more than one stratum can be present at each site. Different formulations, valid inequalities and preprocessings are developed and compared for this problem. An application of this model is presented in order to implement a heuristic approach based on the Sample Average Approximation method (SAA) for solving the probabilistic p-center problem in an efficient way.
CitationAlbareda-Sambola, M.; Martínez-Merino, L.; Rodríguez-Chía, A.M. The stratified p-center problem. "Computers & operations research", 1 Agost 2019, vol. 108, p. 213-225.