Solving dynamic optimization problems with adaptive networks

Abstract This paper solves dynamic optimization problems with adaptive networks based on Hopfield networks. The dynamic optimization problem includes, as a sample, a dynamic traveling salesman problem where the intercity distance of the conventional TSP is extended to time variables. In marked contrast with deterministic networks including the Hopfield network, the adaptive network can change its states adaptively reacting to inputs from the outside. It is then demonstrated that the adaptive network produces as final states locally minimum solutions to the dynamic optimization problem. It is also expected that the adaptive network is substantiated with efficient engineering devices such as VLSI.

[1]  C. Berge Théorie des graphes et ses applications , 1958 .

[2]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[5]  Alan L. Yuille,et al.  Generalized Deformable Models, Statistical Physics, and Matching Problems , 1990, Neural Computation.

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

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[9]  Yoshikane Takahashi,et al.  Mathematical improvement of the Hopfield model for TSP feasible solutions by synapse dynamical systems , 1997, Neurocomputing.

[10]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[12]  Behrooz Kamgar-Parsi,et al.  On problem solving with Hopfield neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[13]  Richard Szeliski,et al.  An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.

[14]  D. Koenig Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[15]  F. L. Hitchcock The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[16]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Carver Mead,et al.  Analog VLSI and neural systems , 1989 .

[18]  Andrew H. Gee,et al.  An analytical framework for optimizing neural networks , 1993, Neural Networks.

[19]  O. H. Brownlee,et al.  ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[20]  Gintaras V. Reklaitis,et al.  Generalized Hopfield Networks and Nonlinear Optimization , 1989, NIPS.

[21]  Marco Budinich,et al.  A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing , 1996, Neural Computation.

[22]  Andrew H. Gee,et al.  Polyhedral Combinatorics and Neural Networks , 1994, Neural Computation.

[23]  Gadi Pinkas,et al.  Reasoning, Nonmonotonicity and Learning in Connectionist Networks that Capture Propositional Knowledge , 1995, Artif. Intell..

[24]  Gadi Pinkas,et al.  Symmetric Neural Networks and Propositional Logic Satisfiability , 1991, Neural Computation.

[25]  Carsten Peterson,et al.  A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..

[26]  Teuvo Kohonen,et al.  Associative memory. A system-theoretical approach , 1977 .

[27]  Petar D. Simic,et al.  Statistical mechanics as the underlying theory of ‘elastic’ and ‘neural’ optimisations , 1990 .

[28]  Marco Budinich,et al.  A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing , 1994 .

[29]  A. Hodgkin,et al.  A quantitative description of membrane current and its application to conduction and excitation in nerve , 1990 .

[30]  Kiichi Urahama,et al.  Gradient Projection Network: Analog Solver for Linearly Constrained Nonlinear Programming , 1996, Neural Computation.