Advertisement

Industrial Applications of the Variable Neighborhood Search Metaheuristic

  • Pierre Hansen
  • Nenad Mladenović
Part of the Advances in Computational Management Science book series (AICM, volume 4)

Abstract

Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recalling its basic scheme, three industrial applications are presented: a pipeline design problem, the pooling problem and the spread spectrum radar polyphase code design problem. They illustrate the simplicity, versatility and efficiency of VNS.

Keywords

Tabu Search Variable Neighborhood Search Local Search Heuristic Pipeline Network Variable Neighborhood Descent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Audet, C, J. Brimberg, P. Hansen, N. Mladenovic. Pooling Problem: Alternate Formulations and Solution Methods. Les Cahiers du GERAD, G-2000–23, 2000.Google Scholar
  2. [2]
    Audet, C, P. Hansen, B. Jaumard, and G. Savard. A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical ProgrammingA87, 131–152, 2000.Google Scholar
  3. [3]
    Brimberg, J., P. Hansen, K.-W. Lih, N. Mladenovic, M. Breton. An Oil Pipeline Design Problem. Les Cahiers du GERAD, G-2000–73, 2000.Google Scholar
  4. [4]
    Dukic, M.L. and Z.S. Dobrosavljevic. A Method of Spread Spectrum Radar Polyphase Code Design. IEEE Journal on Selected Areas in Communications8, 743–749, 1990.CrossRefGoogle Scholar
  5. [5]
    Hansen, P., and B. Jaumard. Reduction of Indefinite Quadratic Programs to Bilinear Programs. Journal of Global Optimization2(1), 41–60, 1992.CrossRefGoogle Scholar
  6. [6]
    Hansen, P. and N. Mladenovic. Variable Neighborhood Search for thep-Median. Location Sei., 5, 207–226, 1998.CrossRefGoogle Scholar
  7. [7]
    Hansen, P. and N. Mladenovic. An Introduction to Variable Neigh-borhood Search, in S. Voss et al.(eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 433–458, Kluwer, Dordrecht (1999).CrossRefGoogle Scholar
  8. [8]
    Hansen, P., N. Mladenovic. Variable Neighborhood Search: Princi-ples and Applications. European Journal of Operational Research (in press), 2001.Google Scholar
  9. [9]
    Kovacevic-Vujcic, V., M. Cangalovic, M. Asie, L. Ivanovic, and M. Drazic. Tabu Search Methodology in Global Optimization, Computers and Mathematics with Applications 37, 125–133, 1999.CrossRefGoogle Scholar
  10. [10]
    Mladenovic, N., and P. Hansen. Variable Neighbourhood Search. Computers and Operations Research, 24, 1097–1100, 1997.CrossRefGoogle Scholar
  11. [11]
    Mladenovic, N., J. Petrovic, V. Kovacevic-Vujcic, and M. Cangalovic. Solving Spread Spectrum Radar Polyphase Code Design Problem by Tabu Search and Variable Neighbourhood Search. Research Report SMG, University of Brussels, 2000.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Pierre Hansen
  • Nenad Mladenović

There are no affiliations available

Personalised recommendations