Abstract
The p-hub problem is a facility location problem that can be viewed as a type of network design problem. Each node, within a given set of node, sends and receives some type of traffic to and from the other nodes. The hub location must be chosen from among these nodes to act as switching points for the traffic. Hubs are facilities that serve as transshipment and switching points for transportation and telecommunication systems with many origins and destinations. In this paper we consider the uncapacitated, single allocation, p-hub median problem. In the single allocation, each nonhub node must be allocated to exactly one of the p hubs. We provide a reduced size formulation and a competitive recurrent neural model for this problem. The neural network consists of a two layers (allocation layer and location layer) of np binary neurons, where n is the number of nodes and p is the number of hubs. The process units (neurons) are formed in groups, where one neuron per group is active at the same time and neurons of different groups are updated in parallel. Computational experience with another neural networks is provided using the data given in the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Aykin. The hub location an routing problem. European Journal of Operational Research, 83:200–219, 1995.
J. F. Campbell. Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72:387–405, 1994.
E. Domínguez and J. Mu noz. An efficient neural network for the p-median problem. Lecture Notes in Aritifitial Intelligence, 2527:460–469, 2002.
J. Ebery. Solving large single allocation p-hub problems with two or three hubs. European Journal of Operational Research, 128:447–458, 2001.
A. Ernst and M. Krishnamoorthy. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4:139–154, 1996.
M. Krishnamoorthy K. Smith and M. Palaniswami. Neural versus traditional approaches to the location of interacting hub facilities. Location Science, 4(3): 155–171, 1996.
J. G. Klincewicz. Avoiding local minima in the p-hub location problem using tabu search and grasp. Annals of Operational Ressearch, 40:283–302, 1992.
M. E. O'Kelly. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32:393–404, 1987.
James G. Morris Robert F. Love and George O. Wesolowsky. Facilities Location Models & Methods. North-Holland, 1998.
D. Skorin-Kapov and J. Skorin-Kapov. On tabu search for the location of interacting hub facilities. European Journal of Operational Research, 73:502–509, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domínguez, E., Muñoz, J., Mérida, E. (2003). A recurrent neural network model for the p-hub problem. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_93
Download citation
DOI: https://doi.org/10.1007/3-540-44869-1_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40211-4
Online ISBN: 978-3-540-44869-3
eBook Packages: Springer Book Archive