Please use this identifier to cite or link to this item:
Title: Generic Tabu Search
Authors: Kallab, Chadi
Haddad, Samir El 
Zakhem, Imad El 
Sayah, Jinane 
Chakroun, Mohamad
Turkey, Nisrine
Charafeddine, Jinan
Hamdan, Hani
Shakir, Wafaa
Affiliations: Department of Computer Science 
Department of Computer Science 
Department of Telecommunications and Networking Engineering 
Keywords: Generic
Tabu Search
Issue Date: 2022-07-25
Publisher: Scientific Research
Part of: Journal of Software Engineering and Applications
Volume: 15
Issue: 7
The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, to implement and run any of the main categories of heuristic. This paper intends to discuss our proposed generic implementation of the Tabu Search algorithm, a heuristic procedure proposed by Fred Glover to solve discrete combinatorial optimization problems. In this research, we try to coordinate and synchronize different designs/implementations discussed in many literatures, with some of the references mentioned in this paper. The basic idea is to avoid that the search for best solutions stops when a local optimum is found, by maintaining a list of non-acceptable or forbidden (taboo) solutions/costs, called Tabu list or Short-Term Memory (STM). In our algorithm, we attempt to add some executions tracing functionalities in order to help later analysis for initial parameters tuning. On the other hand, we propose to include the concept of a list called Long-Term Memory (LTM), so that some of the best solutions found so far can be saved, for search diversification.
DOI: 10.4236/jsea.2022.157016
Open URL: Link to full text
Type: Journal Article
Appears in Collections:Department of Computer Science

Show full item record

Record view(s)

checked on Apr 22, 2024

Google ScholarTM


Dimensions Altmetric

Dimensions Altmetric

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.