The impact of energy function structure on solving generalized assignment problem using Hopfield neural network

Abstract In the last 20 years, neural networks researchers have exploited different penalty based energy functions structures for solving combinatorial optimization problems (COPs) and have established solutions that are stable and convergent. These solutions, however, have in general suffered from lack of feasibility and integrality. On the other hand, operational researchers have exploited different methods for converting a constrained optimization problem into an unconstrained optimization problem. In this paper we have investigated these methods for solving generalized assignment problems (GAPs). Our results concretely establishes that the augmented Lagrangean method can produce superior results with respect to feasibility and integrality, which are currently the main concerns in solving neural based COPs.

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

[2]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[3]  G. Pawley,et al.  On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank , 2004, Biological Cybernetics.

[4]  Vassilis Zissimopoulos,et al.  Extended Hopfield models for combinatorial optimization , 1999, IEEE Trans. Neural Networks.

[5]  Michael P. Walsh,et al.  Augmented Hopfield network for mixed-integer programming , 1999, IEEE Trans. Neural Networks.

[6]  Mitsuo Gen,et al.  Neural network approach for general assignment problem , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  Shu-Cherng Fang,et al.  Neurocomputing with time delay analysis for solving convex quadratic programming problems , 2000, IEEE Trans. Neural Networks Learn. Syst..

[8]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[9]  Kotaro Hirasawa,et al.  Solving inequality constrained combinatorial optimization problems by the hopfield neural networks , 1992, Neural Networks.

[10]  Mohamad H. Hassoun,et al.  A coupled gradient network approach for static and temporal mixed-integer optimization , 1996, IEEE Trans. Neural Networks.

[11]  Fred W. Glover,et al.  An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..

[12]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms, 3/E. , 2019 .

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