Soft Computing in Industrial Applications pp 171-179 | Cite as
Facility Location Using Neural Networks
Conference paper
Abstract
Facility location problems occur whenever more than one facility need to be assigned to an equal number of locations at a minimal cost. The quadratic assignment problem is an example within this class of problems. This paper presents a new self-organizing approach to solve quadratic assignment problems. Our neural approach uses neuron normalization as well as a conscience mechanism to consistently find good feasible solutions. To test our neural approach, a set of test problems from the literature has been used. Further research avenues are suggested.
Keywords
facility location neural networks self-organizing neural networkPreview
Unable to display preview. Download preview PDF.
References
- 1.Hopfield J J, Tank D W 1985 “Neural” computation of decisions in optimization problems. Biological Cybernetics 52: 141–152.MathSciNetMATHGoogle Scholar
- 2.Kohonen T 1982 Self-organized formation of topologically correct feature maps. Biological Cybernetics 43: 59–69.MathSciNetMATHCrossRefGoogle Scholar
- 3.Smith K 1999 Neural Networks for Combinatorial Optimisation: A review of more than a decade of research. INFORMS Journal on Computing 11: 15–34.MathSciNetMATHCrossRefGoogle Scholar
- 4.Smith K, Palaniswami M, Krishnamoorthy M 1996 A hybrid neural approach to combinatorial optimization. Computers and Operations Research 23: 597–610.MathSciNetMATHCrossRefGoogle Scholar
- 5.Smith K, Palaniswami M, Krishnamoorthy M 1998 Neural Techniques for Combinatorial Optimisation with applications. IEEE Transactions on Neural Networks 9: 1301–1318.CrossRefGoogle Scholar
- 6.Smith K, Palaniswami M 1997 Static and Dynamic Channel Assignment using Neural Networks. IEEE Journal on Selected Areas in Communications 15: 238–249.CrossRefGoogle Scholar
- 7.Lozano S, Guerrero F, Eguia I, Canca D, Smith K Cell formation using two neural networks in series. In: Dagli CH et al (eds) 1998 Intelligent Engineering Systems Through Artificial Neural Networks Vol 8. ASME Press, pp 341-346.Google Scholar
- 8.Burke L I, Damany P 1992 The Guilty Net for the Traveling Salesman Problem. Computers and Operations Research 19: 255–265.MATHCrossRefGoogle Scholar
- 9.Taillard E D 1991 Robust taboo search for the quadratic assignment problem. Parallel Computing 17: 443–455.MathSciNetCrossRefGoogle Scholar
- 10.Van de Bout D E, Miller III T K 1989 Improving the performance of the Hopfield-Tank neural network through normalization and annealing. Biological Cybernetics 62: 129–139.CrossRefGoogle Scholar
- 11.Nugent C E, Vollmann T E, Ruml J 1968 An experimental comparison of techniques for the assignment of facilities to locations. Operations Research 16: 150–173.CrossRefGoogle Scholar
- 12.Burkard R E, Karisch S E, Rendl F 1991 QAPLIB — A quadratic assignment problem library. European Journal of Operational Research 55: 115–119.MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag London 2000