The authors 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. The authors formalize the problem as an integer nonlinear programming model and we exactly solve it by a suitable branch-and-bound procedure. They 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. The authors randomly generate a large amount of instances of practical size, and they solve them on a workstation. Short computing times (¸<50secs CPU for the worst experimented case) are evidenced. Since the problem is recognized to be NP-hard, the authors also suggest a simple heuristic method with a low complexity.
