DocumentCode :
393575
Title :
Solution to combinatorial problems by using chaotic global optimization method on a simplex
Author :
Masuda, Kazuaki ; Aiyoshi, Eitaro
Author_Institution :
Keio Univ., Kanagawa, Japan
Volume :
2
fYear :
2002
fDate :
5-7 Aug. 2002
Firstpage :
1313
Abstract :
The discretized maps of gradient models with Euler´s method generate chaos, which can be used for global optimization by applying the chaotic annealing. In this paper, we apply this approach to solve the traveling salesman problem. We formulate it as continuous optimization problems with particular constraints, and newly derive. gradient projection dynamics whose discretized maps generate chaos on a simplex.
Keywords :
chaos; combinatorial mathematics; optimisation; travelling salesman problems; Euler method; chaos; chaotic annealing; chaotic global optimization method; combinatorial problems; gradient projection dynamics; simplex; traveling salesman problem; Annealing; Argon; Chaos; Cities and towns; Genetics; Neural networks; Optimization methods; Probes; Sampling methods; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
SICE 2002. Proceedings of the 41st SICE Annual Conference
Print_ISBN :
0-7803-7631-5
Type :
conf
DOI :
10.1109/SICE.2002.1195379
Filename :
1195379
Link To Document :
بازگشت