About the interprocess communications with parallel tabu search algorithms for the traveling salesperson problem
-
- OHMURA MASAHARU
- Graduate School for Creative Cities, Osaka City University
-
- ONISHI KATSUMI
- Graduate School for Creative Cities, Osaka City University
-
- NAKANO HIDEO
- Graduate School for Creative Cities, Osaka City University
Bibliographic Information
- Other Title
-
- 巡回セールスマン問題を対象とした並列タブーサーチにおけるプロセス間通信の効率化について(セッション2)
Search this article
Description
The traveling salesperson problem is one of the typical examples in the combinational optimization problems and many researches have been conducted so far. In this paper, the tabu search method which is one of the meta-heuristics method for this problem is parallelized. Especially we focus on the communication needed to share the information regarding to "the edge exchange" between processes, and examine a method which enable to share the informations more efficiently.
Journal
-
- IPSJ SIG technical reports
-
IPSJ SIG technical reports 2006 (135), 33-36, 2006-12-21
Information Processing Society of Japan (IPSJ)
- Tweet
Details 詳細情報について
-
- CRID
- 1572824502104012800
-
- NII Article ID
- 110006164305
-
- NII Book ID
- AA12055912
-
- ISSN
- 09196072
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles