By Topic

A mathematical framework for solving dynamic optimization problems with adaptive networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Takahashi, Y. ; NTT Inf. & Commun. Syst. Lab., Kanagawa, Japan

The paper develops a mathematical framework for solving dynamic optimization problems with adaptive networks (AN's) based on Hopfield networks. The dynamic optimization problem (DOP) includes a dynamic traveling salesman problem (TSP), in which the distance between any pair of cities in the conventional TSP is extended into a time variable. Compared to previous deterministic networks, such as the Hopfield network, the adaptive network has the most distinguished feature: it can change its states, continually reacting to inputs from the outside environment. From the scientific viewpoint, our framework demonstrates mathematically rigorously that the adaptive network produces as final states locally minimum solutions to the DOP. From the engineering viewpoint, it provides a mathematical basis for developing engineering devices, such as very large scale integration (VLSI), that can solve real world DOP's efficiently

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:28 ,  Issue: 3 )