Presentation 2007-03-28
Stochastic State Selection in TSP : Simulated Annealing on many states
Hiroki Yamazaki, Tomoo Munehisa, Yasuko Munehisa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The simulated annealing is one of the methods for the optimization problem. A probabilistic selection is done to one state in the simulated annealing. We devise a stochastic state selection which treats many states in one time step. We discuss features of the stochastic state selection by comparing experiments of usual simulated annealing and stochastic state selection on the traveling salesman problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Stochastic State Selection / SimulatedAnnealing / Traveling Salesman Problem(TSP)
Paper # AI2006-68,KBSE2006-76
Date of Issue

Conference Information
Committee AI
Conference Date 2007/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 Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Stochastic State Selection in TSP : Simulated Annealing on many states
Sub Title (in English)
Keyword(1) Stochastic State Selection
Keyword(2) SimulatedAnnealing
Keyword(3) Traveling Salesman Problem(TSP)
1st Author's Name Hiroki Yamazaki
1st Author's Affiliation Faculty of Engineering, University of Yamanashi()
2nd Author's Name Tomoo Munehisa
2nd Author's Affiliation Faculty of Engineering, University of Yamanashi
3rd Author's Name Yasuko Munehisa
3rd Author's Affiliation Faculty of Engineering, University of Yamanashi
Date 2007-03-28
Paper # AI2006-68,KBSE2006-76
Volume (vol) vol.106
Number (no) 617
Page pp.pp.-
#Pages 3
Date of Issue