Optimized Design of Large-Scale Social Welfare Supporting Systems on ComplexNetworks

Our contemporary societies are supported by several systems of high importance providing large-scale services substantial for citizens everyday life. Typically, these systems are built or rely on various types of complex networks such as road networks, railway networks, electricity networks, communication networks etc. Examples of such systems are a set of emergency medical stations, fire or police stations covering the area of a state, social or administration infrastructure. The problem of how to design these systems efficiently, fairly, and reliably is still timely and it brings along many new research challenges. This book chapter presents a brief survey of optimization models and approaches applicable to the problem. We pay special attention to the methods based on the branch and bound principle and show how their computational properties can be improved. Furthermore, we discuss how some of these models can be rearranged in order to allow using the existing solving techniques as approximative methods. The presented numerical experiments are conducted on realistic data describing the topology of the Slovak road network. On the one hand, we hope that this chapter can come handy to researchers working in the area of complex networks, as it presents efficient methods to design public service systems on the networks. On the other hand, we can picture the benefits potentially resulting from the knowledge of the network properties and possibly being utilized in the algorithms design.

[1]  Jaroslav Janáček,et al.  A two‐phase method for the capacitated facility problem of compact customer sub‐sets , 2009 .

[2]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[3]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[4]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[5]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[6]  Cesar Beltran-Royo,et al.  Semi-Lagrangian relaxation applied to the uncapacitated facility location problem , 2010, Computational Optimization and Applications.

[7]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[8]  Z. Vale,et al.  Optimal Location of Natural Gas Sources in the Iberian System , 2006 .

[9]  Daniel Serra,et al.  Locating emergency services with different priorities: the priority queuing covering location problem , 2008, J. Oper. Res. Soc..

[10]  Pierre Hansen,et al.  A note on duality gap in the simple plant location problem , 2002, Eur. J. Oper. Res..

[11]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[12]  Dirk Helbing,et al.  Scaling laws in the spatial structure of urban road networks , 2006 .

[13]  Poompat Saengudomlert,et al.  Topology Design of Optical Networks Based on Existing Power Grids , 2007, Fifth Annual Conference on Communication Networks and Services Research (CNSR '07).

[14]  Erhan Erkut,et al.  Optimal ambulance location with random delays and travel times , 2008, Health care management science.

[15]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[16]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[17]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[18]  Martin Butler,et al.  The allocation of shared fixed costs , 2006, Eur. J. Oper. Res..

[19]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[20]  Lubos Buzna,et al.  An acceleration of Erlenkotter-Körkel’s algorithms for the uncapacitated facility location problem , 2008, Ann. Oper. Res..

[21]  Roberto D. Galvão,et al.  Uncapacitated facility location problems: contributions , 2004 .

[22]  M Butler,et al.  Fairness versus efficiency in charging for the use of common facilities , 2002, J. Oper. Res. Soc..

[23]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[24]  Dritan Nace,et al.  Max-min fairness in multi-commodity flows , 2008, Comput. Oper. Res..

[25]  Manfred Körkel On the exact solution of large-scale simple plant location problems , 1989 .

[26]  T. Crainic Long-Haul Freight Transportation , 2003 .

[27]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[28]  John Harte,et al.  Response of complex food webs to realistic extinction sequences. , 2007, Ecology.

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[31]  Gilbert Laporte,et al.  OBJECTIVES IN LOCATION PROBLEMS. , 1995 .

[32]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[33]  Thomas A. Grossman,et al.  Location with Market Externalities , 1995 .