Presentation 2008-03-28
A New Chaotic Algorithm for Solving Traveling Salesman Problems by Using 2-opt and Or-opt Algorithms
Takafumi MATSUURA, Tohru IKEGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) To find the near optimum solutions of TSPs, a method introducing chaotic neurodynamics for solving TSPs has already been proposed. To avoid a local minimum, in this method, 2-opt algorithm for solving TSP is driven by chaotic neurodynamics. As a result, although 2-opt algorithm is the simplest local search, this method showed good performance. In this paper, we propose a new method to solve TSP introducing Or-opt algorithm, which is one of the powerful local search. In the proposed method, the 2-opt and Or-opt algorithms are driven by the chaotic neurodynamics. As a result, the proposed method shows higher performance than the previous chaotic search methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Combinatorial Optimization Problem / Traveling Salesman Problem (TSP) / Or-opt algorithm / Chaotic Neural Network / Chaotic Dynamics
Paper # NLP2007-173
Date of Issue

Conference Information
Committee NLP
Conference Date 2008/3/21(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A New Chaotic Algorithm for Solving Traveling Salesman Problems by Using 2-opt and Or-opt Algorithms
Sub Title (in English)
Keyword(1) Combinatorial Optimization Problem
Keyword(2) Traveling Salesman Problem (TSP)
Keyword(3) Or-opt algorithm
Keyword(4) Chaotic Neural Network
Keyword(5) Chaotic Dynamics
1st Author's Name Takafumi MATSUURA
1st Author's Affiliation Graduate School of Science and Engineering, Saitama University()
2nd Author's Name Tohru IKEGUCHI
2nd Author's Affiliation Graduate School of Science and Engineering, Saitama University
Date 2008-03-28
Paper # NLP2007-173
Volume (vol) vol.107
Number (no) 561
Page pp.pp.-
#Pages 6
Date of Issue