A generic object-oriented Tabu Search framework

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+...

Full description

Saved in:
Bibliographic Details
Main Authors: LAU, Hoong Chuin, WAN, Wee Chong, JIA, Xiaomin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2003
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1123
https://ink.library.smu.edu.sg/context/sis_research/article/2122/viewcontent/MIC03_TSF.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-2122
record_format dspace
spelling sg-smu-ink.sis_research-21222017-01-04T09:32:24Z A generic object-oriented Tabu Search framework LAU, Hoong Chuin WAN, Wee Chong JIA, Xiaomin 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. 2003-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1123 https://ink.library.smu.edu.sg/context/sis_research/article/2122/viewcontent/MIC03_TSF.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
LAU, Hoong Chuin
WAN, Wee Chong
JIA, Xiaomin
A generic object-oriented Tabu Search framework
description 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.
format text
author LAU, Hoong Chuin
WAN, Wee Chong
JIA, Xiaomin
author_facet LAU, Hoong Chuin
WAN, Wee Chong
JIA, Xiaomin
author_sort LAU, Hoong Chuin
title A generic object-oriented Tabu Search framework
title_short A generic object-oriented Tabu Search framework
title_full A generic object-oriented Tabu Search framework
title_fullStr A generic object-oriented Tabu Search framework
title_full_unstemmed A generic object-oriented Tabu Search framework
title_sort generic object-oriented tabu search framework
publisher Institutional Knowledge at Singapore Management University
publishDate 2003
url https://ink.library.smu.edu.sg/sis_research/1123
https://ink.library.smu.edu.sg/context/sis_research/article/2122/viewcontent/MIC03_TSF.pdf
_version_ 1770570864339714048