IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2011-03-10 09:00
Solving TSP by a tabu search with time-variant tabu tenure
Takuya Kurihara, Kenya Jin'no (Nippon Inst. of Tech.) NLP2010-163
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) traveling salesman problems / tabu search / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 110, no. 465, NLP2010-163, pp. 1-6, March 2011.
Paper # NLP2010-163 
Date of Issue 2011-03-03 (NLP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NLP2010-163

Conference Information
Committee NLP  
Conference Date 2011-03-10 - 2011-03-11 
Place (in Japanese) (See Japanese page) 
Place (in English) Tokyo University of Science 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General 
Paper Information
Registration To NLP 
Conference Code 2011-03-NLP 
Language Japanese 
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  
Keyword(3)  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Takuya Kurihara  
1st Author's Affiliation Nippon Institute of Technology (Nippon Inst. of Tech.)
2nd Author's Name Kenya Jin'no  
2nd Author's Affiliation Nippon Institute of Technology (Nippon Inst. of Tech.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2011-03-10 09:00:00 
Presentation Time 25 minutes 
Registration for NLP 
Paper # NLP2010-163 
Volume (vol) vol.110 
Number (no) no.465 
Page pp.1-6 
#Pages
Date of Issue 2011-03-03 (NLP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan