Translator Disclaimer
5 March 2007 Application of modified Kohnen's network to optimization problems
Author Affiliations +
Proceedings Volume 6595, Fundamental Problems of Optoelectronics and Microelectronics III; 65951N (2007) https://doi.org/10.1117/12.725812
Event: Fundamental Problems of Optoelectronics and Microelectronics III, 2006, Harbin, China
Abstract
The traveling salesman problem, which is one of combinatorial optimization problems, is solved by using two different methods: the Hopfield type network and the Kohonen type network. In the Hopfield type network the energy function is defined, whose global minimum must be searched. The energy is shown analytically to decrease monotonically. The time behavior can be discussed analytically, because the input-output function is piecewise linear. The network can always find the optimum solution. In the Kohonen type network the modified version is proposed, in which the mechanism of choice of winner neuron is included automatically in the time evolution equation of the internal state. In usual Hopfield 's network N x N neurons are needed to solve TSP with N cities. It is shown that only N neurons are needed in modified Kohonen's network, which means that the network has a great advantage in the case of the application to TSP with higher number of cities or in the application to more complicated combinatorial optimization problems. The relation between the Hopfield type network and the modified Kohonen type network is discussed.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Toshihiro Shimizu "Application of modified Kohnen's network to optimization problems", Proc. SPIE 6595, Fundamental Problems of Optoelectronics and Microelectronics III, 65951N (5 March 2007); https://doi.org/10.1117/12.725812
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top