Filtering Policies in Loss Queuing Network Location Problems

In this paper we deal with two stationary loss queuing network location models. We analyze the influence of filtering policies on the locational aspect of the problems. We assume that requests for service are placed at nodes of a transportation network and they arrive in time as independent homogene...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2005-04, Vol.136 (1), p.259-283
Main Authors: Fernández, Elena, Hinojosa, Yolanda, Puerto, Justo
Format: Article
Language:English
Subjects:
Computer networks
Localization
Location analysis
Operating costs
Operations research
Queuing
Random variables
Service centers
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we deal with two stationary loss queuing network location models. We analyze the influence of filtering policies on the locational aspect of the problems. We assume that requests for service are placed at nodes of a transportation network and they arrive in time as independent homogeneous Poisson processes with different input rates. The considered policies only cover a given proportion of requests even if there are idle service units. This proportion is stationary and fixed in advance and only depends on the node where the request is originated. The objective is to find the location of the facilities together with the filtering policy to be applied that minimize the expected total cost per unit time with respect to a given cost structure. Properties and computational results are presented enabling the resolution of these problems efficiently and showing the good performance of filtering policies in terms of both the overall operating costs, and the demand that is served. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-005-2048-y