Name
Abstract | ||
|---|---|---|
<P>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 |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1287/trsc.30.1.60 | Transportation Science |
Keywords | Field | DocType |
m g 1 queue,queuing,customers | Mathematical optimization,Queue,Nonlinear programming,Response time,Queueing theory,Fixed point,Convex optimization,Cost allocation,Mathematics,Operations management,Traffic congestion | Journal |
Volume | Issue | ISSN |
30 | 1 | 0041-1655 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Filippi | 1 | 168 | 13.77 |
| Giorgio Romanin-Jacur | 2 | 49 | 7.08 |