On administrative borders and accessibility to public services: : The case of hospitals in Sweden.

Combinatorial optimization problems, are one of the most important types of problems in operational research. Heuristic and metaheuristics algorithms are widely applied to find a good solution. However, a common problem is that these algorithms do not guarantee that the solution will coincide with the optimum and, hence, many solutions to real world OR-problems are afflicted with an uncertainty about the quality of the solution. The main aim of this thesis is to investigate the usability of statistical bounds to evaluate the quality of heuristic solutions applied to large combinatorial problems. The contributions of this thesis are both methodological and empirical. From a methodological point of view, the usefulness of statistical bounds on p-median problems is thoroughly investigated. The statistical bounds have good performance in providing informative quality assessment under appropriate parameter settings. Also, they outperform the commonly used Lagrangian bounds. It is demonstrated that the statistical bounds are shown to be comparable with the deterministic bounds in quadratic assignment problems. As to empirical research, environment pollution has become a worldwide problem, and transportation can cause a great amount of pollution. A new method for calculating and comparing the CO2-emissions of online and brick-and-mortar retailing is proposed. It leads to the conclusion that online retailing has significantly lesser CO2-emissions. Another problem is that the Swedish regional division is under revision and the border effect to public service accessibility is concerned of both residents and politicians. After analysis, it is shown that borders hinder the optimal location of public services and consequently the highest achievable economic and social utility may not be attained.

[1]  Xun Shi,et al.  Spatial Access and Local Demand for Major Cancer Care Facilities in the United States , 2012 .

[2]  Igor Vasil'ev,et al.  An aggregation heuristic for large scale p-median problem , 2012, Comput. Oper. Res..

[3]  Charles ReVelle,et al.  Optimal location under time or distance constraints , 1972 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  B. Perry,et al.  Physical access to primary health care in Andean Bolivia. , 2000, Social science & medicine.

[6]  A. Monzón,et al.  Assessment of Cross‐Border Spillover Effects of National Transport Infrastructure Plans: An Accessibility Approach , 2009 .

[7]  G. Higgs A Literature Review of the Use of GIS-Based Measures of Access to Health Care Services , 2004, Health Services and Outcomes Research Methodology.

[8]  T. V. Levanova,et al.  Algorithms of Ant System and Simulated Annealing for the p-median Problem , 2004 .

[9]  Liam O'Dowd,et al.  Introduction: Why Study Borders Now? , 2002 .

[10]  Mengjie Han,et al.  Does Euclidean distance work well when the p-median model is applied in rural areas? , 2012, Ann. Oper. Res..

[11]  Markus Perkmann,et al.  Policy Entrepreneurship and Multilevel Governance: A Comparative Study of European Cross-Border Regions , 2007 .

[12]  R. Church,et al.  The maximal covering location problem , 1974 .

[13]  S. L. HAKIMIt AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

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

[15]  Martin McKee,et al.  Hospitals in a changing Europe , 2002 .

[16]  Kenneth Carling,et al.  On statistical bounds of heuristic solutions to location problems , 2016, J. Comb. Optim..

[17]  Frank Tanser,et al.  Modelling and understanding primary health care accessibility and utilization in rural South Africa: an exploration using a geographical information system. , 2006, Social science & medicine.

[18]  Fahui Wang,et al.  Measurement, Optimization, and Impact of Health Care Accessibility: A Methodological Review , 2012, Annals of the Association of American Geographers. Association of American Geographers.

[19]  S. Hakimi Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[20]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[21]  L Bach,et al.  The Problem of Aggregation and Distance for Analyses of Accessibility and Access Opportunity in Location-Allocation Models , 1981 .

[22]  G. Popescu,et al.  The conflicting logics of cross-border reterritorialization: Geopolitics of Euroregions in Eastern Europe , 2008 .

[23]  Subhash C. Narula,et al.  Minisum hierarchical location-allocation problems on a network: A survey , 1986 .

[24]  Mengjie Han,et al.  Distance measure and the $$p$$p-median problem in rural areas , 2015, Ann. Oper. Res..