An Efficient Neural Network Algorithm for the p-Median Problem

In this paper we present a neural network model and new formulation for the p-median problem. The effectiveness and efficiency of our algorithm under varying problem sizes are analyzed in comparison to conventional heuristic methods. The results for small-scale problems (less than 100 points) indicate that our implementation of algorithm is effective. Furthermore, we also have applied our algorithm to solve large-scale problems, demonstrating that a simple recurrent neural network, with an adapted formulation of the problem, can generate good solutions in a few seconds.

[1]  Carlos Ivorra,et al.  An exact algorithm for the fuzzy p-median problem , 1999, Eur. J. Oper. Res..

[2]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[3]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .

[4]  Michelle R. Hribar,et al.  A dynamic programming heuristic for the P-median problem , 1997 .

[5]  Sebastián Lozano,et al.  Kohonen maps for solving a class of location-allocation problems , 1998, Eur. J. Oper. Res..

[6]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[7]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[8]  L. Cooper Location-Allocation Problems , 1963 .

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

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

[11]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[12]  A. Colorni,et al.  A search tree algorithm for plant location problems , 1981 .

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

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

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

[16]  Zvi Drezner,et al.  Application of decision analysis techniques to the Weber facility location problem , 1999, Eur. J. Oper. Res..

[17]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

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

[19]  Pierre Hansen,et al.  Heuristic solution of the multisource Weber problem as a p-median problem , 1996, Oper. Res. Lett..

[20]  M Ohlemüller Tabu search for large location–allocation problems , 1997 .

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

[22]  José Muñoz-Pérez,et al.  Design and analysis of maximum Hopfield networks , 2001, IEEE Trans. Neural Networks.