Please use this identifier to cite or link to this item:
Title: A generic object-oriented tabu search framework
Authors: Lau, H.C. 
Jia, X.
Wan, W.C. 
Keywords: Combinatorial optimization
Software framework
Tabu search
Issue Date: 2005
Citation: Lau, H.C.,Jia, X.,Wan, W.C. (2005). A generic object-oriented tabu search framework. Operations Research/ Computer Science Interfaces Series 32 : 203-226. ScholarBank@NUS Repository.
Abstract: Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well-designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is capable of solving a wide range of combinatorial optimization problems using various tabu search techniques and adaptive strategies. The applications of TSF are demonstrated on the implementation of two NP-hard problems, the Vehicle Routing Problem with Time Windows (VRPTW) and Quadratic Assignment Problem (QAP). We show that TSF is able to obtain quality solutions within reasonable implementation as well as computation time.
Source Title: Operations Research/ Computer Science Interfaces Series
ISSN: 1387666X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 16, 2023

Google ScholarTM


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