Optimal Allocation of Two Fixed Service Units Acting as M / G /1 Queues

Carlo Filippi and Giorgio Romanin-Jacur
Additional contact information
Carlo Filippi: Department of Pure and Applied Mathematics, University of Padova, Via Belzoni, 7, 35131 Padova, Italy
Giorgio Romanin-Jacur: Department of Electronics and Informatics, University of Padova, Via Gradenigo 6/A, 35131 Padova, Italy

Transportation Science, 1996, vol. 30, issue 1, 60-74

Abstract: We consider a districting problem placed in the general context of optimal allocation of urgent services in the presence of congestion. Customers are located in fixed points of a physical space and ask for urgent service according to Poisson processes. Two facilities, located in fixed points, supply the service by acting as M / G /1 queues. Each customer shall be assigned to one of the two facilities so that the mean expected response time is minimized, where the response time is the sum of the transportation time, the wait-in-queue time and the service time. We formalize the problem as an integer nonlinear programming model and we exactly solve it by a suitable branch-and-bound procedure. We show that the problem, if relaxed with respect to integrality constraints, can be reduced to an equivalent convex minimization problem with only one variable. Actually, each step of the branch-and-bound procedure is performed by quickly solving a continuous single-variable minimization problem. We randomly generate a large amount of instances of practical size, and we solve them on a workstation. Short computing times (

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.1.60 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:30:y:1996:i:1:p:60-74

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().