Abstract
In this paper, we propose a neural network algorithm—multi-start stochastic competitive Hopfield neural network (MS-SCHNN) for the p-median problem. The proposed algorithm combines two mechanisms to improve neural network’s performance. First, it introduces stochastic dynamics into the competitive Hopfield neural network (CHNN) to help the network escape from local minima. Second, it adopts multi-start strategy to further improve the performance of SCHNN. Experimental results on a series of benchmark problems show that MS-SCHNN outperforms previous neural network algorithms for the p-median problem.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hakimi, S.: Optimum Distribution of Switching Centers in to Communication Network and Some Related Graph Theoretic Problems. Operations Research 13 (1965)
Kariv, O., Hakimi, S.: An Algorithmic Approach to Network Location Problem. Part2: The P-median. SIAM Journalon Applied Mathematics. 37, 539–560 (1979)
Mladenović, N., Brimberg, J., Hansen, P., Moreno-Perez, J.A.: The P-median Problem: A Survey of Metaheuristic Approaches. European Journal of Operational Research 179, 927–939 (2007)
Hopfield, J.J., Tank, D.W.: “Neural” Computation of Decisions in Optimization Problems. Biological Cybernetics 52, 141–152 (1985)
Smith, K.A.: Neural Networks for Combinatorial Optimization: A Review of More than a Decade of Research. INFORMS Journal on Computing 11, 15–34 (1999)
Domínguez, E., Muñoz, J.: A Neural Model for the p-median Problem. Computers & Operations Research 35, 404–416 (2008)
Kuo, C.C., Glover, F., Dhir, K.S.: Analyzing and Modeling the Maximum Diversity Problem by Zero-one Programming. Decision Sciences 24, 1171–1185 (1993)
ReVelle, C., Swain, R.: Central Facilities Location. Geographical Analysis 2, 30–42 (1970)
Smith, K., Palaniswami, M., Krishnamoorthy, M.: Neural Techniques for Combinatorial Optimisation with Applications. IEEE Transactions on Neural Networks 9, 1301–1318 (1998)
Wang, J., Zhou, Y.: Stochastic Optimal Competitive Hopfield Network for Partitional Clustering. Expert Systems with Applications 31, 2072–2080 (2008)
Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35, 268–308 (2003)
Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society 41, 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/orlib/pmedinfo.html
Galán-Marín, G., Muńoz-Pérez, J.: Design and Analysis of Maximum Hopfield Networks. IEEE Transactions on Neural Networks 12, 329–339 (2001)
Wang, L.P., Liu, W., Shi, H.: Noisy Chaotic Neural Networks with Variable Thresholds for the Frequency Assignment Problem in Satellite Communications. IEEE Transactions on Systems, Man, and Cybernetics – Part C: Applications and reviews 38, 209–217 (2008)
Huang, J.Z., Ng, M.K., Rong, H., Li, Z.: Automated Variable Weighting in k-means Type Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 1–12 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, Y., Wang, J., Yin, J., Li, C., Zhang, Y. (2009). Multi-start Stochastic Competitive Hopfield Neural Network for p-Median Problem. In: Yu, W., He, H., Zhang, N. (eds) Advances in Neural Networks – ISNN 2009. ISNN 2009. Lecture Notes in Computer Science, vol 5551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01507-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-01507-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01506-9
Online ISBN: 978-3-642-01507-6
eBook Packages: Computer ScienceComputer Science (R0)