Presentation 2005-06-30
A parallel tabu search based on relinking of searched space
Hidekazu NAKA, Morikazu NAKAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Tabu search(TS) is one of the most powerful methods in the technique of calculating the approximate solution of combinatorial optimization problems. In this research, we try to improve search efficiency by the cooperation of processes in parallelizing TS. It is desired to take these into consideration by cooperation of parallel processing. Then, this research aims at realization of the new diversification and centralization of TS, by parallel processing based on the path relinking(PR) and the extrapolated relinking(ER).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Tabu Search / Path Relinking / Extrapolated Relinking / Searched Space / Parallelizaing
Paper # CST2005-5
Date of Issue

Conference Information
Committee CST
Conference Date 2005/6/23(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 Concurrent System Technology (CST)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A parallel tabu search based on relinking of searched space
Sub Title (in English)
Keyword(1) Tabu Search
Keyword(2) Path Relinking
Keyword(3) Extrapolated Relinking
Keyword(4) Searched Space
Keyword(5) Parallelizaing
1st Author's Name Hidekazu NAKA
1st Author's Affiliation Department of Information Engineering, University of the Ryukyus()
2nd Author's Name Morikazu NAKAMURA
2nd Author's Affiliation Department of Information Engineering, University of the Ryukyus
Date 2005-06-30
Paper # CST2005-5
Volume (vol) vol.105
Number (no) 159
Page pp.pp.-
#Pages 6
Date of Issue