In this paper we introduce a new kind of immobile Location-Allocation problem that consists in determining the service each facility has to offer in order to maximize the covered demand given the positions of the customers and their service requirements and the positions of the immobile facilities. First, we provide a formalization of the problem and then we tackle the problem using two heurist...

The Simple Plant Location Problem is well known in the literature: it consists in deciding which facilities to open among a set of potential nodes and allocating a set of customers to the open facilities in such a way that the total cost is minimum, allocation process which is carried out by the locator. However, customers may be free to choose the facility they will be allocated to. This fact ...

Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....

(1) Design. A collection of part geometry and part features for cars, pickup trucks, and vans. (2) Process planning. A hierarchy of alternative sequences of operations for fabricating specific parts of a car such as the body, seats, and engine; robot programs; numerical control programs; inspection programs; and kitting instructions for materials packaging. (3) Resource planning. Classes and in...

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. In thi...