Summary
International Symposium on Nonlinear Theory and its Applications
2008
Session Number:A1L-F
Session:
Number:A1L-F4
An Effective Chaotic Search by Using 2-opt and Or-opt Algorithms for Traveling Salesman Problem
Takafumi MATSUURA, Tohru IKEGUCHI,
pp.-
Publication Date:2008/9/7
Online ISSN:2188-5079
Summary:
We have already proposed chaotic search methods to find near optimum solutions of TSPs. In these methods, local search method is driven by chaotic neurodynamics to avoid a local minimum. Due to effective control by the chaotic dynamics, the chaotic search methods shows good performance. In this paper, we propose a new method to solve TSP by using two different types of simple local searches, 2-opt algorithm and Or-opt algorithm. 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.