A Deterministic Annealing Neural Network Algorithm for the Minimum Concave Cost Transportation Problem

In this article, a deterministic annealing neural network algorithm is proposed to solve the minimum concave cost transportation problem. Specifically, the algorithm is derived from two neural network models and Lagrange–barrier functions. The Lagrange function is used to handle linear equality constraints, and the barrier function is used to force the solution to move to the global or near-global optimal solution. In both neural network models, two descent directions are constructed, and an iterative procedure for the optimization of the neural network is proposed. As a result, two corresponding Lyapunov functions are naturally obtained from these two descent directions. Furthermore, the proposed neural network models are proved to be completely stable and converge to the stable equilibrium state, therefore, the proposed algorithm converges. At last, the computer simulations on several test problems are made, and the results indicate that the proposed algorithm always generates global or near-global optimal solutions.

[1]  Leon S. Lasdon,et al.  Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming , 1978, TOMS.

[2]  Giorgio Gallo,et al.  Concave cost minimization on networks , 1979 .

[3]  Hong Qiao,et al.  An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[4]  Ferrante Neri,et al.  An Optimization Spiking Neural P System for Approximately Solving Combinatorial Optimization Problems , 2014, Int. J. Neural Syst..

[5]  Lacra Pavel,et al.  On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems , 2018, Journal of Global Optimization.

[6]  S. Andradóttir,et al.  A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization , 1999 .

[7]  Hamid Reza Karimi,et al.  Improved Stability and Stabilization Results for Stochastic Synchronization of Continuous-Time Semi-Markovian Jump Neural Networks With Time-Varying Delay , 2017, IEEE Transactions on Neural Networks and Learning Systems.

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

[9]  Hamid Reza Karimi,et al.  Stability of Markovian Jump Generalized Neural Networks With Interval Time-Varying Delays , 2017, IEEE Transactions on Neural Networks and Learning Systems.

[10]  Shu-Cherng Fang,et al.  Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems , 1995, Transp. Sci..

[11]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[12]  K. M. Lau,et al.  Comparison of the Hopfield scheme to the hybrid of Lagrange and transformation approaches for solving the traveling salesman problem , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.

[13]  Andrzej Cichocki,et al.  Neural networks for optimization and signal processing , 1993 .

[14]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[15]  Lei Xu,et al.  Input Convex Neural Networks : Supplementary Material , 2017 .

[16]  Samy Bengio,et al.  Neural Combinatorial Optimization with Reinforcement Learning , 2016, ICLR.

[17]  Yunpeng Wang,et al.  Optimal Formation of Multirobot Systems Based on a Recurrent Neural Network , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[18]  Danilo Comminiello,et al.  Group sparse regularization for deep neural networks , 2016, Neurocomputing.

[19]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[20]  Jinde Cao,et al.  A Novel Recurrent Neural Network With One Neuron and Finite-Time Convergence for $k$-Winners-Take-All Operation , 2010, IEEE Transactions on Neural Networks.

[21]  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.

[22]  Ismail Karaoglan,et al.  An adaptive tabu-simulated annealing for concave cost transportation problems , 2008, J. Oper. Res. Soc..

[23]  Jean-Jacques E. Slotine,et al.  Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks , 2018, Neural Computation.

[24]  George L. Nemhauser,et al.  On the computational complexity of minimum-concave-cost flow in a two-dimensional grid , 2016, SIAM J. Optim..

[25]  Chuandong Li,et al.  A Recurrent Neural Network for Solving Bilevel Linear Programming Problem , 2014, IEEE Transactions on Neural Networks and Learning Systems.

[26]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[27]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[28]  Fernando de la Prieta,et al.  Artificial neural networks used in optimization problems , 2018, Neurocomputing.

[29]  Chuandong Li,et al.  An Inertial Projection Neural Network for Solving Variational Inequalities , 2017, IEEE Transactions on Cybernetics.

[30]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[31]  Yuping Wang,et al.  A deterministic annealing algorithm for the minimum concave cost network flow problem , 2011, Neural Networks.

[32]  J. N. Kapur.  Maximum-entropy models in science and engineering , 1992 .

[33]  Michael L. Scott,et al.  Algorithms for scalable synchronization on shared-memory multiprocessors , 1991, TOCS.

[34]  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.