The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini mencadangkan kawalan aspirasi yang menghalang cawangan aspirasi dan mengekalkan carian berasaskan tabu asal dengan mempertimbangkan profil carian masa hadapan dan/atau (diramalkan). Untuk pelaksanaan kawalan aspirasi kami menggunakan bukan sahaja ingatan jangka pendek dan jangka panjang tetapi juga ingatan masa hadapan yang pertama kali diperkenalkan dalam kertas kerja ini sebagai konsep baharu dalam medan carian tabu. Carian tabu dengan kawalan aspirasi juga selari. Selain itu, dua jenis skim pencarian koperasi selari dicadangkan. Melalui eksperimen pengiraan, kami melihat kecekapan pendekatan kami berbanding dengan pendekatan tradisional. Terutamanya, kami mendapati bahawa pencarian koperasi mempunyai kemungkinan untuk meningkatkan kualiti penyelesaian dengan baik.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
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
Salinan
@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},}
Salinan
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 -