The design of service systems with queueing time cost, workload capacities and backup service

Abstract This paper studies a reliable service system design problem that involves locating service facilities, determining their number and capacities and assigning user nodes to those facilities. The goal is to minimize total costs made of the costs of accessing facilities by users and waiting for service at these facilities as well as the cost of setting up and operating the facilities. The service system is designed in such a way that backup service is provided to user nodes while controlling facility workload. This problem arises mainly in the area of telecommunication network design. But is quite general and can be encountered in several planning contexts such as transportation planning, siting of emergency service facilities and refuse collection and disposal in the public sector. The paper represents a significant improvement over previous research by presenting a unified model of the problem that includes the number, locations, and capacities of service facilities as variables to be determined, incorporates in the total cost to be minimized the user waiting time (queueing) cost, and provides backup service to user nodes. An integer programming formulation of the problem with a nonlinear objective function is presented. Two heuristic solution procedures based on a Lagrangean relaxation of the problem are developed. Extensive computational results across a variety of problem structures are reported. These results indicate that the second solution procedure is very effective for a wide range of problem structures and traffic loads.

[1]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[2]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[3]  Hasan Pirkul,et al.  An assignment problem with queueing time cost , 1990 .

[4]  Hasan Pirkul,et al.  The siting of emergency service facilities with workload capacities and backup service , 1988 .

[5]  Sridhar Narasimhan.  The Concentrator Location Problem With Variable Coverage , 1990, Comput. Networks ISDN Syst..

[6]  Hasan Pirkul,et al.  Routing in packet-switched communication networks , 1994, Comput. Commun..

[7]  Larry J. LeBlanc,et al.  Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks , 1989, INFORMS J. Comput..

[8]  Bezalel Gavish,et al.  On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming , 1978, Comput. Oper. Res..

[9]  Hasan Pirkul,et al.  Hierarchical concentrator location problem , 1992, Comput. Commun..

[10]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[11]  H. Pirkul,et al.  New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[12]  Hasan Pirkul,et al.  Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..

[13]  S. C. Wirasinghe,et al.  An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region , 1983 .

[14]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[15]  Joseph Miller,et al.  Polishing the Big Apple: How Management Science Has Helped Make New York Streets Cleaner , 1986 .