| Article ID: | iaor20084297 |
| Country: | Brazil |
| Volume: | 23 |
| Issue: | 1 |
| Start Page Number: | 61 |
| End Page Number: | 78 |
| Publication Date: | Jan 2003 |
| Journal: | Pesquisa Operacional |
| Authors: | Galvo Roberto D., Espejo Luis Gonzalo Acosta, Chiyoshi F.Y. |
The Maximum Availability Location Problem (MALP) seeks to locate m servers so that the maximum number of calls for an emergency service has a server available within a predefined critical distance S, with reliability α. In this paper MALP is extended for the case where the busy fractions are calculated individually, for each server. This is achieved through the use of the Hypercube Model, embedded into a single vertex substitution heuristic. Computational results are given for networks of up to 150 vertices available in the literature.