Tabu Search

Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 36)


Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallmark of tabu search approaches, founded on a quest for “integrating principles,” by which alternative forms of memory are appropriately combined with effective strategies for exploiting them. In this chapter we address the problem of training multilayer feed-forward neural networks. These networks have been widely used for both prediction and classification in many different areas. Although the most popular method for training these networks is backpropagation, other optimization methods such as tabu search have been applied to solve this problem. This chapter describes two training algorithms based on the tabu search. The experimentation shows that the procedures provide high quality solutions to the training problem, and in addition consume a reasonable computational effort.

Key words

Intelligent problem solving memory structures adaptive memory programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bishop, C. M., 1995, Neural Networks for Pattern Recognition, Oxford University Press.Google Scholar
  2. El-Fallahi A., 2002, Entrenamiento de Redes Neuronales, Trabajo de Investigatión, Dpto Estadśtica e I.O. University of Valencia.Google Scholar
  3. El-Fallahi, A., Martí, R., and Lasdon, L., 2005, Path relinking and GRG for artificial neural networks, European journal of operational research 169:508–519.CrossRefGoogle Scholar
  4. Fahlman, S. E., 1988, An empirical study of learning speed in back-propagation networks, in: Connectionist Models Summer School, T. J. Sejnowski, G. E. Hinton and D. S. Touretzky, eds., San Mateo, CA, Morgan Kaufmann, pp. 38–51.Google Scholar
  5. Glover, F., 1986, Future paths for integer programming and links to artificial intelligence, Computers and Operations Research 13:533–549.zbMATHMathSciNetCrossRefGoogle Scholar
  6. Glover, F., 1989, Tabu search part I, ORSA Journal on Computing 1:190–206.zbMATHMathSciNetGoogle Scholar
  7. Glover, F., and Laguna, M., 1993, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, C. Reeves, ed., Blackwell Scientific Publishing, Oxford, pp. 70–150.Google Scholar
  8. Glover, F., and Laguna, M., 1997, Tabu Search, Kluwer Academic Publishers, Boston.zbMATHGoogle Scholar
  9. Jacobs, R. A., 1988, Increased rates of convergence through learning rate adaptation, Neural Networks 1:295–307.CrossRefGoogle Scholar
  10. Laguna, M., Martí, R., 2003, Scatter Search—Methodology and Implementations in C, Kluwer Academic Publishers, Boston.Google Scholar
  11. Riedmiller, M., and Heinrich, B., 1993, A direct adaptive method for faster back-propagation learning: the RPROP algorithm, IEEE Intl. Conf. on Neural Networks, pp. 586–591.Google Scholar
  12. Rumelhart, D. E., and McClelland, J. L., 1986, Parallel distributed processing: explorations in the microstructure of cognition, Cambridge, MA: The MIT Press.Google Scholar
  13. Sexton, R. S., Alidaee, B., Dorsey, R. E., and Johnson, J. D., 1998, Global optimization for artificial neural networks: a tabu search application, European Journal of Operational Research 106:570–584.zbMATHCrossRefGoogle Scholar
  14. Smith, S., and Lasdon, L., 1992, Solving large nonlinear programs using GRG, ORSA Journal on Computing 4(1): 2–15.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Leeds School of BusinessUniversity of ColoradoBoulder
  2. 2.Dpto. de Estadística e Investigatión OperativaUniversidad de ValenciaBurjassol (Valencia)Spain

Personalised recommendations