Variable Neighbourhood Search

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


The basic idea of VNS is the change of neighbourhoods in the search for a better solution. VNS proceeds by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this solution. Each time, one or several points within the current neighbourhood are used as initial solutions for a local descent. The method jumps from the current solution to a new one if and only if a better solution has been found. Therefore, VNS is not a trajectory following method (as Simulated Annealing or Tabu Search) and does not specify forbidden moves. In this work, we show how the variable neighbourhood search metaheuristic can be applied to train an artificial neural network. We define a set of nested neighbourhoods and follow the basic VNS scheme to carry out our experiments

Key words

Variable neighbourhood search neural networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Blum, E. K., and Li, L. K., 1991, Approximation theory and feedforward networks, Neural Networks 4(4):511–515.CrossRefGoogle Scholar
  2. Brimberg, J., Hansen, P., Mladenović, N., and Taillard, E., 2000, Improvements and comparison of heuristics for solving the multisource Weber problem, Operations Research 48:444–460.CrossRefGoogle Scholar
  3. El-Fallahi, A., Martí, R., and Lasdon, L., 2005, Path relinking and GRG for artificial neural networks, European Journal of Operational Research (to appear).Google Scholar
  4. Gallant, A. R., and White, H., 1992, On learning the derivatives of an unknown mapping with multilayer feedforward networks, Neural Networks 5:129–138.CrossRefGoogle Scholar
  5. Glover, F., and Kochenberger, G., 2003, Handbook of Metaheuristics, Kluwer.Google Scholar
  6. Hansen, P., and Mladenović, N., 2001, Variable neighbourhood search: principles and applications, European Journal of Operational Research 130:449–467.zbMATHMathSciNetCrossRefGoogle Scholar
  7. Hansen, P., and Mladenović, N., 2003, Variable neighbourhood search, in: Handbook of Metaheuristics, F. Glover, and G. Kochenberger, eds., Kluwer, pp. 145–184.Google Scholar
  8. Johnson, D. S., and McGeoch, L. A., 1997, The travelling salesman problem: A case study in local optimization, in: Local Search in Combinatorial Optimization, E. H. L. Aarts, and J. K. Lenstra, eds., John Wiley & Sons, pp. 215–310.Google Scholar
  9. Lourenco, H. R., Martin, O., and Stuetzle, T., 2003, Iterated Local Search, in: Handbook of Metaheuristics, Glover, F., and Kochenberger, G., eds., Kluwer, pp. 321–353.Google Scholar
  10. Mladenović, N., and Hansen, P., 1997, Variable neighbourhood search, Computers and Operations Research 24:1097–1100.MathSciNetCrossRefGoogle Scholar
  11. Nelder, J. A., and Mead, R., 1965, A Simplex method for function minimization, Computer Journal 7:308–313.zbMATHGoogle Scholar
  12. Reeves, C. R., 1993, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Press.Google Scholar
  13. Rumelhart, D. E., Hilton, G. E., and Williams, R. J., 1986, Learning internal representations by error propagation, in: D. E. Rumhelhart, J. L. McClelland, and the PDP Research Group, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Volume 1: Foundations, Cambridge, MA: MIT Press. Reprinted in Aderson and Rosenfeld (1988), pp. 318–362.Google 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.Grupo de Computatión Inteligente, Instituto Universitario de Desarrollo Regional, ETS Ingeniería InformáticaUniversidad de La LagunaLa LagunaSpain
  2. 2.School of MathematicsBrunei UniversityWest LondonUK

Personalised recommendations