Presentation	2011-03-10 Solving TSP by a tabu search with time-variant tabu tenure Takuya KURIHARA, Kenya JIN'NO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The most of scheduling problems and vehicle routing problems are formulated as combinatorial optimization problems. Therefore, solving the combinatorial optimization problems is important. However, it is difficult to find the exact solution. For such combinatorial optimization problems, to find feasible solution in applicative time is important. The heuristic algorithms are applied to such combinatorial optimization problems. The heuristic algorithms can find a close to the exact solution. One of such heuristic algorithms is a tabu search. In this article, we propose a tabu search with time-variant tabu tenure. Also, we confirm its performance by using traveling salesman problems.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	traveling salesman problems / tabu search
Paper #	NLP2010-163
Date of Issue

Conference Information
Committee	NLP
Conference Date	2011/3/3(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	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Solving TSP by a tabu search with time-variant tabu tenure
Sub Title (in English)
Keyword(1)	traveling salesman problems
Keyword(2)	tabu search
1st Author's Name	Takuya KURIHARA
1st Author's Affiliation	Nippon Institute of Technology()
2nd Author's Name	Kenya JIN'NO
2nd Author's Affiliation	Nippon Institute of Technology
Date	2011-03-10
Paper #	NLP2010-163
Volume (vol)	vol.110
Number (no)	465
Page	pp.pp.-
#Pages	6
Date of Issue