Presentation 2000/10/13
A Division Method of Traveling Salesman Problem for Analog VLSI Implementation
Atsushi Shigeta, Yoshihiko Horio, Kazuyuki Aihara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A method to solve the traveling salesman problems(TSP)combining the chaotic neurodynamics and the 2-opt algorithm has benn proposed. Chaotic neural networks excute a parallel computation with a complex dynamics that is suitable for an analog integrated circuit implementation. However, a division of the TSP is necessary to solve a large-scale problems using such a chaotic neural network. This paper proposes a novel division method of the TSP suitable for the analog VLSI implementation. Moreover, the relations between the number of divisions and the processing efficiency, and that between division number and quality of the solution are discussed throufh simulations. Furthermore, a measure that gives an upper bound for the number of the divisions will be given.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Traveling Salesman Problem / 2-opt Method
Paper # NLP2000-77
Date of Issue

Conference Information
Committee NLP
Conference Date 2000/10/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Division Method of Traveling Salesman Problem for Analog VLSI Implementation
Sub Title (in English)
Keyword(1) Traveling Salesman Problem
Keyword(2) 2-opt Method
1st Author's Name Atsushi Shigeta
1st Author's Affiliation Graduate School of Electronic Engineering, Tokyo Denki University()
2nd Author's Name Yoshihiko Horio
2nd Author's Affiliation Graduate School of Electronic Engineering, Tokyo Denki University
3rd Author's Name Kazuyuki Aihara
3rd Author's Affiliation University of Tokyo, :CREST, JST
Date 2000/10/13
Paper # NLP2000-77
Volume (vol) vol.100
Number (no) 381
Page pp.pp.-
#Pages 6
Date of Issue