A note on solutions to the maximal expected covering location problem

Authors:
Fernando Y. Chiyoshi;Roberto D. Galvão;Reinaldo Morabito
Affiliations:
Programa de Engenharia de Produção, COPPE/UFRJ, Caixa Postal 68507, 21945-970 Rio de Janeiro, RJ, Brazil;Programa de Engenharia de Produção, COPPE/UFRJ, Caixa Postal 68507, 21945-970 Rio de Janeiro, RJ, Brazil;Departamento de Engenharia de Produção, Universidade Federal de Sao Carlos, Caixa Postal 676, 13565-905 São Carlos, SP, Brazil
Venue:
Computers and Operations Research
Year:
2003

Citing 0
Cited 2

Towards unified formulations and extensions of two classical probabilistic location models

Computers and Operations Research
A multiperiod set covering location model for dynamic redeployment of ambulances

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The maximal expected covering location problem (MEXCLP) and its adjusted counterpart (AMEXCLP) compute expected coverage arising only from unqueued calls, whereas the interactive use of the hypercube queueing model (HQM) considers both unqueued and queued calls in this computation. In this note we show that the three models are not strictly comparable because of the structural differences in their objective functions and that, when using HQM, it is important to state clearly the factor being used to express traveling time in terms of service time units.