An Efficient Neural Network Algorithm for the p-Median Problem

Authors:
Enrique Dominguez Merino;José Muñoz-Perez
Affiliations:
-;-
Venue:
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2002

Citing 3
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic solution of the multisource Weber problem as a p-median problem

Operations Research Letters
Design and analysis of maximum Hopfield networks

IEEE Transactions on Neural Networks

A neural model for the p-median problem

Computers and Operations Research
A recurrent neural network model for the p-hub problem

IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Moving object detection and tracking by using annealed background subtraction method in videos: Performance optimization

Expert Systems with Applications: An International Journal
Applying bio-inspired techniques to the p-median problem

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.