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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. Ahuja, J. B. Orlin, O. Ergun, and A. Punnen A Survey of Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem, Discrete Applied Mathematics 23, 75–102, 2002.
R. E. Burkard, S.E. Karisch and F. Rendl. QAPLIB — A Quadratic Assignment Problem Library, European Journal of Operational Research, 55:99, 115–119, 1991.
A. Fink, S. Voß: HotFrame: A Heuristic Optimization Framework. In: S. Voß, D.L. Woodruff (Eds.), Optimization Software Class Libraries, Kluwer, Boston, 81–154, 2002.
F. Glover and M. Laguna, Tabu Search, Reading, Kluwer Academic Publishers, Boston/Dorderecht/London, 1997.
L. Di Gaspero and A. Schaerf, EasyLocal++: An object-oriented framework for flexible design of local search algorithms, Reading, Kluwer Academic Publishers, 2001.
R. Harder, IBM OpenTS Homepage, see http://opents.iharder.net, 2003.
ILOG S.A. www.ilog.com, 2003.
H. C. Lau, M. K. Lim, W. C. Wan and S. Halim. A Development Framework for Rapid Meta-heuristics Hybridization, Proc. 28th Annual International Computer Software and Applications Conference (COMPSAC), 362–367, Hong Kong, 2004.
L. Michel and P. Van Hentenryck. Localizer++: A modeling language for local search. INFORMS Journal of Computing, 11, 1–14, 1999.
M. M Solomon. Algorithms for Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research 35, 254–265, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Lau, H.C., Jia, X., Wan, W.C. (2005). A Generic Object-Oriented Tabu Search Framework. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers. Operations Research/Computer Science Interfaces Series, vol 32. Springer, Boston, MA. https://doi.org/10.1007/0-387-25383-1_9
Download citation
DOI: https://doi.org/10.1007/0-387-25383-1_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25382-4
Online ISBN: 978-0-387-25383-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)