How does data quality in a network affect heuristic solutions

To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly usedp-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p).The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limitedimprovement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (lowp) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.

[1]  Mark Goh,et al.  Covering problems in facility location: A review , 2012, Comput. Ind. Eng..

[2]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[3]  James G. Morris,et al.  On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP , 1978 .

[4]  Nicos Christofides,et al.  A tree search algorithm for the p-median problem , 1982 .

[5]  Fernando Y. Chiyoshi,et al.  A statistical analysis of simulated annealing applied to the p-median problem , 2000, Ann. Oper. Res..

[6]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

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

[8]  Timothy J. Lowe,et al.  Aggregation error for location models: survey and analysis , 2009, Ann. Oper. Res..

[9]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

[10]  Dominique Peeters,et al.  The Effect of Spatial Structure on p-Median Results , 1995, Transp. Sci..

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

[12]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[13]  Saudi Arabia,et al.  Simulated Annealing Metaheuristic for Solving P-Median Problem 1 , 2008 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[16]  David A. Schilling,et al.  Network distance characteristics that affect computational effort in p-median location problems , 2000, Eur. J. Oper. Res..

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

[18]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[19]  Richard L. Church,et al.  Applying simulated annealing to location-planning models , 1996, J. Heuristics.

[20]  Roy E. Marsten,et al.  An Algorithm for Finding Almost All Of The Medians of a Network , 1972 .

[21]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

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

[23]  Pierre Hansen,et al.  Solving large p-median clustering problems by primal–dual variable neighborhood search , 2009, Data Mining and Knowledge Discovery.

[24]  David K. Smith,et al.  A Comparison of Two Heuristic Methods for the p‐Median Problem with and without Maximum Distance Constraints , 1991 .

[25]  R.M.J. Heuts,et al.  A modified simple heuristic for the p-median problem, with facilities design applications , 2005 .