Buscar
Mostrando ítems 1-7 de 7
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015-05-01)
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents ...
Location-allocation of multiple-server service centers with constrained queues or waiting times
(KLUWER ACADEMIC PUBL, 2002)
Recently, the authors have formulated new models for the location of congested facilities, so to maximize population covered by service with short queues or waiting time. In this paper, we present an extension of these ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)
Probabilistic, maximal covering location-allocation models for congested systems
(BLACKWELL PUBLISHERS, 1998)
When dealing with the design of service networks, such as health and emergency medical services, banking or distributed ticket-selling services, the location of service centers has a strong influence on the congestion at ...
Ambulances deployment problems: categorization, evolution and dynamic problems review
(MDPI AGSwitzerland, 2022)
Multiobjective Optimization of Public Health Service Delivery NetworksOptimización multiobjetivo de las redes de prestación de servicios de salud pública
(Universidad Militar Nueva Granada, 2023)