A Parallel Tabu Search Based on Aspiration Control and Its Cooperative Execution

Takashi MATSUMURA; Morikazu NAKAMURA; Shiro TAMAKI; Kenji ONAGA

A Parallel Tabu Search Based on Aspiration Control and Its Cooperative Execution

Takashi MATSUMURA, Morikazu NAKAMURA, Shiro TAMAKI, Kenji ONAGA

Full Text Views

0

Cite this

Summary :

This paper proposes aspiration controls which restrains aspiration branches and keeps the original tabu-based searching by considering past and/or (predicted) future searching profiles. For implementation of the aspiration control we employ not only the short-term and long-term memory but also future memory which is first introduced in this paper as a new concept in the tabu search field. The tabu search with the aspiration control is also parallelized. Moreover two types of parallel cooperative searching scheme are proposed. Through computational experiment, we observe efficiency of our approach comparing to the traditional ones. Especially, we find that cooperative searching has possibility to improve the solution quality very well.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.11 pp.2196-2202

Publication Date: 2000/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems Technology)

Category

Cite this

Copy

Takashi MATSUMURA, Morikazu NAKAMURA, Shiro TAMAKI, Kenji ONAGA, "A Parallel Tabu Search Based on Aspiration Control and Its Cooperative Execution" in IEICE TRANSACTIONS on Fundamentals, vol. E83-A, no. 11, pp. 2196-2202, November 2000, doi: .
Abstract: This paper proposes aspiration controls which restrains aspiration branches and keeps the original tabu-based searching by considering past and/or (predicted) future searching profiles. For implementation of the aspiration control we employ not only the short-term and long-term memory but also future memory which is first introduced in this paper as a new concept in the tabu search field. The tabu search with the aspiration control is also parallelized. Moreover two types of parallel cooperative searching scheme are proposed. Through computational experiment, we observe efficiency of our approach comparing to the traditional ones. Especially, we find that cooperative searching has possibility to improve the solution quality very well.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_11_2196/_p

Copy

@ARTICLE{e83-a_11_2196,
author={Takashi MATSUMURA, Morikazu NAKAMURA, Shiro TAMAKI, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Parallel Tabu Search Based on Aspiration Control and Its Cooperative Execution},
year={2000},
volume={E83-A},
number={11},
pages={2196-2202},
abstract={This paper proposes aspiration controls which restrains aspiration branches and keeps the original tabu-based searching by considering past and/or (predicted) future searching profiles. For implementation of the aspiration control we employ not only the short-term and long-term memory but also future memory which is first introduced in this paper as a new concept in the tabu search field. The tabu search with the aspiration control is also parallelized. Moreover two types of parallel cooperative searching scheme are proposed. Through computational experiment, we observe efficiency of our approach comparing to the traditional ones. Especially, we find that cooperative searching has possibility to improve the solution quality very well.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - A Parallel Tabu Search Based on Aspiration Control and Its Cooperative Execution
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2196
EP - 2202
AU - Takashi MATSUMURA
AU - Morikazu NAKAMURA
AU - Shiro TAMAKI
AU - Kenji ONAGA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2000
AB - This paper proposes aspiration controls which restrains aspiration branches and keeps the original tabu-based searching by considering past and/or (predicted) future searching profiles. For implementation of the aspiration control we employ not only the short-term and long-term memory but also future memory which is first introduced in this paper as a new concept in the tabu search field. The tabu search with the aspiration control is also parallelized. Moreover two types of parallel cooperative searching scheme are proposed. Through computational experiment, we observe efficiency of our approach comparing to the traditional ones. Especially, we find that cooperative searching has possibility to improve the solution quality very well.
ER -