Presentation 2009-05-15
Solving Asymmetric TSP by Combination of Chaotic Neurodynamics and Block Shift operations
Toshihiro TACHIBANA, Masaharu ADACHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, a method for solving Asymmetric Traveling Salesman Problems is proposed. Where the asymmetric TSP means that the costs for traveling between a city and another one are not symmetric. The proposed method is based on previous work by Hasegawa. It uses Chaos Neural Network and Tabu search. In this method, the exchanging method uses Block Shift Operations. The proposed method obtains the solutions of the previous method proposed by the authors with shorter computational time than that of the previous one.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) asymmetric TSP / chaos neural network / block shift operation / tabu search
Paper # NLP2009-13
Date of Issue

Conference Information
Committee NLP
Conference Date 2009/5/8(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) Solving Asymmetric TSP by Combination of Chaotic Neurodynamics and Block Shift operations
Sub Title (in English)
Keyword(1) asymmetric TSP
Keyword(2) chaos neural network
Keyword(3) block shift operation
Keyword(4) tabu search
1st Author's Name Toshihiro TACHIBANA
1st Author's Affiliation Graduate School of Advanced Science and Technology, Tokyo Denki University()
2nd Author's Name Masaharu ADACHI
2nd Author's Affiliation Graduate School of Advanced Science and Technology, Tokyo Denki University
Date 2009-05-15
Paper # NLP2009-13
Volume (vol) vol.109
Number (no) 30
Page pp.pp.-
#Pages 4
Date of Issue