Connected infrastructure location design under additive service utilities

An infrastructure system usually contains a number of inter-connected infrastructure links that connect users to services or products. Where to locate these infrastructure links is a challenging problem that largely determines the efficiency and quality of the network. This paper studies a new location design problem that aims to maximize the total weighted benefits between users and multiple services that are measured by the amount of connectivity between users and links in the network. This problem is investigated from both analytical and computational points of view. First, analytical properties of special cases of the problem are described. Next, two integer programming model formulations are presented for the general problem. We also test intuitive heuristics including greedy and interchange algorithms, and find that the interchange algorithm efficiently yields near-optimum solutions. Finally, a set of numerical examples demonstrate the proposed models and reveal interesting managerial insights. In particular, we found that a more distance-dependent utility measure and a higher concentration of users help achieve a better total utility. As the population becomes increasingly concentrated, the optimal link design evolves from a linear path to a cluster of links around the population center. As the budget level increases, the installed links gradually sprawl from the population center towards the periphery, and in the case of multiple population centers, they grow and eventually merge into one connected component.

[1]  Kyung-Yong Chwa,et al.  A 6.55 factor primal-dual approximation algorithm for the connected facility location problem , 2009, J. Comb. Optim..

[2]  M. Karnaugh A New Class of Algorithms for Multipoint Network Optimization , 1976, IEEE Trans. Commun..

[3]  R. Hartshorne The Twin City District: A Unique Form of Urban Landscape , 1932 .

[4]  Richard L. Church,et al.  Improving accessibility to rural health services: The maximal covering network improvement problem , 2009 .

[5]  Debbie A. Niemeier,et al.  Measuring Accessibility: An Exploration of Issues and Alternatives , 1997 .

[6]  Ahmed M El-Geneidy,et al.  Measuring Nonmotorized Accessibility: Issues, Alternatives, and Execution , 2008 .

[7]  A. Kanafani,et al.  AIRLINE HUBBING : SOME IMPLICATIONS FOR AIRPORT ECONOMICS , 1985 .

[8]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[9]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[10]  Markus Leitner,et al.  Branch-and-Cut-and-Price for Capacitated Connected Facility Location , 2011, J. Math. Model. Algorithms.

[11]  C. Mundia,et al.  Analysis of land use/cover changes and urban expansion of Nairobi city using remote sensing and GIS , 2005 .

[12]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Ivana Ljubic,et al.  Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem , 2013, INFORMS J. Comput..

[14]  B. Gavish,et al.  Heuristics with Constant Error Guarantees for the Design of Tree Networks , 1988 .

[15]  Balaji Raghavachari,et al.  Improved approximation algorithms for the single-sink buy-at-bulk network design problems , 2009, J. Discrete Algorithms.

[16]  Weili Wu,et al.  Algorithms for connected set cover problem and fault-tolerant connected set cover problem , 2009, Theor. Comput. Sci..

[17]  Luis Filipe Lages,et al.  The SERPVAL scale: a multi-item instrument for measuring service personal values , 2005 .

[18]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[19]  Luís Gouveia,et al.  Using generalized capacitated trees for designing the topology of local access networks , 1997, Telecommun. Syst..

[20]  P. Camerini,et al.  Complexity of spanning tree problems: Part I , 1980 .

[21]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[22]  Hanan Luss,et al.  Telecommunications Access Network Design , 2006, Handbook of Optimization in Telecommunications.

[23]  Walter M. Carlson,et al.  Absolutely, Positively Operations Research: The Federal Express Story , 1997 .

[24]  R. Sharma Design of an Economical Multidrop Network Topology with Capacity Constraints , 1983, IEEE Trans. Commun..

[25]  George Athanasopoulos,et al.  Interoperability among Heterogeneous Services , 2006, 2006 IEEE International Conference on Services Computing (SCC'06).

[26]  L. R. Foulds A multi-commodity flow network design problem , 1981 .

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

[28]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[29]  Paul H. Zipkin,et al.  Foundations of Inventory Management , 2000 .

[30]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[31]  Kyung-Yong Chwa,et al.  Approximation algorithms for connected facility location problems , 2008, J. Comb. Optim..

[32]  Yanfeng Ouyang,et al.  Infrastructure deployment under uncertainties and competition: The biofuel industry case , 2015 .

[33]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[34]  Donald E. Vinson,et al.  The Role of Personal Values in Marketing and Consumer Behavior , 1977 .

[35]  Chaitanya Swamy,et al.  Primal-Dual Algorithms for Connected Facility Location Problems , 2002, APPROX.

[36]  E. Mills An Aggregative Model of Resource Allocation in a Metropolitan Area , 2007 .

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

[38]  M. Goldstein Design of long-distance telecommunication networks -The Telpak problem , 1973 .

[39]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[40]  Fabrizio Grandoni,et al.  Improved Approximation for Single-Sink Buy-at-Bulk , 2006, ISAAC.

[41]  G. Michael Schneider,et al.  An Algorithm for the Design of Multilevel Concentrator Networks , 1982, Comput. Networks.

[42]  M. Ferguson,et al.  Topological Design of Multipoint Teleprocessing Networks , 1974, IEEE Trans. Commun..

[43]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[44]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[45]  A. Kershenbaum,et al.  Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design , 1980, IEEE Trans. Commun..

[46]  Yanfeng Ouyang,et al.  Reliable Traffic Sensor Deployment Under Probabilistic Disruptions and Generalized Surveillance Effectiveness Measures , 2012, Oper. Res..

[47]  Larry J. LeBlanc,et al.  Telecommunication access network design with reliability constraints , 2004, IEEE Transactions on Reliability.

[48]  Wushow Chou,et al.  A Unified Algorithm for Designing Multidrop Teleprocessing Networks , 1974, IEEE Trans. Commun..

[49]  Markus Leitner,et al.  Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location , 2011, EUROCAST.

[50]  Hai Yang,et al.  Facility location design under continuous traffic equilibrium , 2015 .

[51]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[52]  Christine M. Hoehner,et al.  Measuring the built environment for physical activity: state of the science. , 2009, American journal of preventive medicine.

[53]  D. West Introduction to Graph Theory , 1995 .

[54]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[55]  Weili Wu,et al.  Complexity and approximation of the connected set-cover problem , 2011, Journal of Global Optimization.

[56]  Susan L Handy,et al.  How the built environment affects physical activity: views from urban planning. , 2002, American journal of preventive medicine.

[57]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[58]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[59]  Gunhak Lee,et al.  Maximal covering with network survivability requirements in wireless mesh networks , 2010, Comput. Environ. Urban Syst..

[60]  Xiao-Dong Hu,et al.  Connected Set Cover Problem and Its Applications , 2006, AAIM.

[61]  Dimitris C. Paraskevopoulos,et al.  The congested multicommodity network design problem , 2016 .

[62]  Chung-Lun Li,et al.  Mixed truck delivery systems with both hub-and-spoke and direct shipment , 2003 .

[63]  Shing Chung Josh Wong,et al.  Transport Network Design Problem under Uncertainty: A Review and New Developments , 2011 .

[64]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[65]  Francesco Maffioli,et al.  On the complexity of finding multi-constrained spanning trees , 1983, Discret. Appl. Math..

[66]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[67]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[68]  H Lee Willis,et al.  Power distribution planning reference book , 2000 .

[69]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

[70]  Rex S. Toh,et al.  THE IMPACT OF HUB AND SPOKE NETWORK CENTRALIZATION AND ROUTE MONOPOLY ON DOMESTIC AIRLINE PROFITABILITY , 1985 .