In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served ...

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 ...

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 ...

Covering location models consider a demand "covered" if there is at least one facility sited within a preset threshold distance. If more than one facility satisfies this criterion, it is implicitly assumed that one of these ...

In this paper, we solve the Set Covering Problem with a meta-optimization approach. One of the most popular models among facility location models is the Set Covering Problem. The meta-level metaheuristic operates on solutions ...

The deterministic location set covering problem seeks the minimum number of servers and their positions such that each point of demand has at least one server initially stationed within a time or distance standard. In an ...

The natural salt meadows of Tilopozo in the hyperarid, Atacama Desert of northern Chile, which are located at approximately 2800 m above sea level, are under pressure from industrial activity, and cultivation and grazing ...

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 ...