DocumentCode
553975
Title
Elastic net with stochastic noise strategy and time-dependent parameters for TSP
Author
Gang Yang ; Junyan Yi ; Nan Yang
Author_Institution
Key Lab. of Data Eng. & Knowledge Eng., Renmin Univ. of China, Beijing, China
Volume
1
fYear
2011
fDate
26-28 July 2011
Firstpage
426
Lastpage
430
Abstract
In this paper, an improved elastic net algorithm is proposed to solve the traveling salesman problem by assembling a stochastic noise strategy and some time-dependent parameters. Based on the observation and analysis of solution status of TSP solving by elastic net, the stochastic noise strategy is introduced into elastic net to overcome the shortcoming of easily trapping in local minima. Being different with other stochastic algorithms, the stochastic noise strategy mainly modifies problem states by using city oscillation randomly and further affects elastic net performance. The time-dependent parameters controlling convergent process increase the ability of matching cities precisely and getting convergence quickly. It is verified by large numbers of simulations that the stochastic noise strategy and time-dependent parameters can enhance the performance of elastic net greatly. And especially the stochastic noise strategy to problem states probably reveals a novel way to optimize some deterministic algorithms.
Keywords
assembling; deterministic algorithms; stochastic processes; travelling salesman problems; TSP; city oscillation; convergent process; deterministic algorithm; improved elastic net algorithm; stochastic noise strategy; time-dependent parameters; traveling salesman problem; Algorithm design and analysis; Cities and towns; Neurons; Noise; Oscillators; Rubber; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2011 Seventh International Conference on
Conference_Location
Shanghai
ISSN
2157-9555
Print_ISBN
978-1-4244-9950-2
Type
conf
DOI
10.1109/ICNC.2011.6022064
Filename
6022064
Link To Document