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 welldesigned 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. Key words: Tabu Search, software framework, reusability, combinatorial optimization.
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
MIC 2003: 5th Metaheuristics International Conference, August 25-28, 2003
City or Country
LAU, Hoong Chuin; WAN, Wee Chong; and JIA, Xiaomin.
A generic object-oriented Tabu Search framework. (2003). MIC 2003: 5th Metaheuristics International Conference, August 25-28, 2003. 1-10. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1123
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.