Scatter Search

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


This chapter discusses the principles and foundations behind scatter search and its application to the problem of training neural networks. Scatter search is an evolutionary method that has been successfully applied to a wide array of hard optimization problems. Scatter search constructs new trial solutions by combining so-called reference solutions and employing strategic designs that exploit context knowledge. In contrast to other evolutionary methods like genetic algorithms, scatter search is founded on the premise that systematic designs and methods for creating new solutions afford significant benefits beyond those derived from recourse to randomization. Our implementation goal is to create a combination of the five elements in the scatter search methodology that proves effective when searching for optimal weight values in a multilayer neural network. Through experimentation, we show that our instantiation of scatter search can compete with the best-known training algorithms in terms of training quality while keeping the computational effort at a reasonable level.

Key words

Metaheuristics neural networks optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. El-Fallahi, A., and Martí, R., 2003, Tabu and Scatter Search for Training Neural Networks, in: Computational Modeling and Problem Solving in the Networked World, H. K. Bhargava, and N. Ye, ed., Interfaces in Computer Science and Operations Research, pp. 79–96.Google Scholar
  2. Glover F., 1963, Parametric combinations of local job shop rules, ONR Research Memorandum. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
  3. Glover, F., 1977, Heuristics for integer programming using surrogate constraints, Decision Sciences 8; 156–166.Google Scholar
  4. Glover, F., 1994, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Discrete Applied Mathematics 49: 231–255.zbMATHMathSciNetCrossRefGoogle Scholar
  5. Glover, F., 1998, A template for scatter search and path relinking, in: Artificial Evolution, Lecture Notes in Computer Science 1363, J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers, eds., Springer, pp. 13–54.Google Scholar
  6. Glover, F., 2004, Parametric tabu search for mixed integer programming, Technical Report, University of Colorado at Boulder; Scholar
  7. Glover, F., and Laguna, M., 1997, Tabu Search, Kluwer Academic Publishers, Boston.zbMATHGoogle Scholar
  8. Glover, F., Laguna, M., and Martí, R., 2000, Fundamentals of scatter search and path relinking, Control and Cybernetics 29(3): 653–684.zbMATHMathSciNetGoogle Scholar
  9. Laguna, M., and Martí, R., 2000, Neural network prediction in a system for optimizing simulations, HE Transaction 34(3): 273–282.Google Scholar
  10. Laguna, M., and Martí, R., 2003, Scatter Search — Methodology and Implementations in C, Kluwer Academic Publishers, Boston.Google Scholar
  11. Nelder, J. A., and Mead, R., 1965, A simplex method for function minimization, Computer Journal 7: 308–313.zbMATHGoogle Scholar
  12. Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P., 1992, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press ( 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

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Leeds School of BusinessUniversity of Colorado at BouldeUSA
  2. 2.Dpto. de Estadística e Investigación OperalivaUniversidad de ValenciaSpain

Personalised recommendations