Solving the Assignment Problem with the Improved Dual Neural Network

During the last two decades, several neural networks have been proposed for solving the assignment problem, and most of them either consist of O(n2) neurons (processing units) or contain some time varying parameters. In the paper, based on the improved dual neural network proposed recently, we present a new assignment network with 2n neurons and some constant parameters only. Compared with the existing neural networks for solving the assignment problem, its more favorable for implementation. Numerical simulation results indicate that the time complexity of the network is O(n).

[1]  Alan L. Yuille,et al.  The invisible hand algorithm: Solving the assignment problem with statistical physics , 1994, Neural Networks.

[2]  Kiichi Urahama.  Analog circuit for solving assignment problems , 1994 .

[3]  Jun Wang.  Analogue neural network for solving the assignment problem , 1992 .

[4]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[5]  Ralph Arnote,et al.  Hong Kong (China) , 1996, OECD/G20 Base Erosion and Profit Shifting Project.

[6]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[7]  Mauro Forti,et al.  Generalized neural network for nonsmooth nonlinear programming problems , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Xiaolin Hu,et al.  An Improved Dual Neural Network for Solving a Class of Quadratic Programming Problems and Its $k$-Winners-Take-All Application , 2008, IEEE Transactions on Neural Networks.

[9]  Jun Wang,et al.  A deterministic annealing neural network for convex programming , 1994, Neural Networks.

[10]  Xiaolin Hu,et al.  A New Recurrent Neural Network for Solving Convex Quadratic Programming Problems With an Application to the $k$-Winners-Take-All Problem , 2009, IEEE Transactions on Neural Networks.

[11]  M. Ghavami.  A new adaptive recursive delay filter , 1993 .

[12]  Jun Wang,et al.  Primal and dual assignment networks , 1997, IEEE Trans. Neural Networks.

[13]  J Wang,et al.  Analysis and design of primal-dual assignment networks , 1998, IEEE Trans. Neural Networks.

[14]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[15]  Timothy X. Brown,et al.  Competitive neural architecture for hardware solution to the assignment problem , 1991, Neural Networks.

[16]  Long Cheng,et al.  A Delayed Projection Neural Network for Solving Linear Variational Inequalities , 2009, IEEE Transactions on Neural Networks.

[17]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming , 2008, IEEE Transactions on Neural Networks.

[18]  Xiaolin Hu,et al.  An Alternative Recurrent Neural Network for Solving Variational Inequalities and Related Optimization Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).