A Generic Object-Oriented Tabu Search Framework

  • Hoong C. Lau
  • Xiaomin Jia
  • Wee C. Wan
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 32)


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.

Key words

Tabu Search software framework reusability combinatorial optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ahuja et al., 2002]
    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.CrossRefGoogle Scholar
  2. [Burkard et al., 1991]
    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.CrossRefGoogle Scholar
  3. [Fink and Voß, 2002]
    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.Google Scholar
  4. [Glover and Laguna, 1997]
    F. Glover and M. Laguna, Tabu Search, Reading, Kluwer Academic Publishers, Boston/Dorderecht/London, 1997.Google Scholar
  5. [Gaspero and Schaerf, 2001]
    L. Di Gaspero and A. Schaerf, EasyLocal++: An object-oriented framework for flexible design of local search algorithms, Reading, Kluwer Academic Publishers, 2001.Google Scholar
  6. [Harder, 2003]
    R. Harder, IBM OpenTS Homepage, see, 2003.Google Scholar
  7. [ILOG, 2003]
    ILOG S.A., 2003.Google Scholar
  8. [Lau et al., 2004]
    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.Google Scholar
  9. [Michel and Hentenryck, 1999]
    L. Michel and P. Van Hentenryck. Localizer++: A modeling language for local search. INFORMS Journal of Computing, 11, 1–14, 1999.MathSciNetGoogle Scholar
  10. [Solomon, 1987]
    M. M Solomon. Algorithms for Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research 35, 254–265, 1987.MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Hoong C. Lau
    • 1
  • Xiaomin Jia
    • 1
  • Wee C. Wan
    • 1
  1. 1.School of ComputingNational University of SingaporeSingapore

Personalised recommendations