Skip to main content

Variable Neighborhood Search for Robust Optimization and Applications to Aerodynamics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7116))

Abstract

Many real-life applications lead to the definition of robust optimization problems where the objective function is a black box. This may be due, for example, to the fact that the objective function is evaluated through computer simulations, and that some parameters are uncertain. When this is the case, existing algorithms for optimization are not able to provide good-quality solutions in general. We propose a heuristic algorithm for solving black box robust optimization problems, which is based on a bilevel Variable Neighborhood Search to solve the minimax formulation of the problem. We also apply this algorithm for the solution of a wing shape optimization where the objective function is a computationally expensive black box. Preliminary computational experiments are reported.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)

    MATH  Google Scholar 

  2. Canon, M.D.: Monoextremal representations of a class of minimax problems. Management Science 15(5), 228–238 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. van Damme, E.: Stability and Perfection of Nash Equilibria, 2nd edn. Springer, Heidelberg (2002)

    Google Scholar 

  4. Duvigneau, R.: Aerodynamic shape optimization with uncertain operating conditions using metamodels. Tech. Rep. INRIA/RR–6143–FR+ENG, INRIA (2007)

    Google Scholar 

  5. Fuchs, M., Neumaier, A.: Potential based clouds in robust design optimization. Journal of Statistical Theory and Practice 3(1), 225–238 (2008)

    Article  MathSciNet  Google Scholar 

  6. Hansen, P., Brimberg, J., Urosevic, D., Mladenovic, N.: Solving large p-median clustering problems by primal–dual variable neighborhood search. Data Mining and Knowledge Discovery 19(3), 351–375 (2009)

    Article  MathSciNet  Google Scholar 

  7. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195(3), 791–802 (2009)

    Article  MATH  Google Scholar 

  9. Herrmann, J.: A genetic algorithm for minimax optimization problems. In: IEEE Conference Proceedings Congress on Evolutionary Computation (CEC 1999), Washington, DC, USA, pp. 1–5 (1999)

    Google Scholar 

  10. Huyse, L., Lewis, R.: Aerodynamic shape optimization of twodimensional airfoils under uncertain operating conditions. Tech. Rep. 2001-1, NASA Langley Research Center Hampton, VA, USA (2001)

    Google Scholar 

  11. Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proceedings of the Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)

    Google Scholar 

  12. Mladenovic, M., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mucherino, A., Urtubia, A.: Consistent biclustering and applications to agriculture. In: Proceedings of the Industrial Conference on Data Mining (ICDM 2010), IbaI Conference Proceedings Workshop on Data Mining and Agriculture (DMA 2010), pp. 105–113. Springer, Berlin (2010)

    Google Scholar 

  14. Rogalsky, T., Derksen, R.W., Kocabiyik, S.: Differential evolution in aerodynamic optimization. In: Proceedings of the 46th Annual Conference of the Canadian Aeronautics and Space Institute, pp. 29–36. Canadian Aeronautics and Space Institute (1999)

    Google Scholar 

  15. Sahinidis, N.V.: Optimization under uncertainty: state-of-the-art and opportunities. Computers and Chemical Engineering 28, 971–983 (2004)

    Article  Google Scholar 

  16. Vicini, A., Quagliarella, D.: Airfoil and wing design through hybrid optimization strategies. American Institute of Aerodynamics and Astronautics 37(5) (1999)

    Google Scholar 

  17. Wen, Y., Xu, H., Yang, J.: A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Information Sciences 181(3), 567–581 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mucherino, A., Fuchs, M., Vasseur, X., Gratton, S. (2012). Variable Neighborhood Search for Robust Optimization and Applications to Aerodynamics. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2011. Lecture Notes in Computer Science, vol 7116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29843-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29843-1_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29842-4

  • Online ISBN: 978-3-642-29843-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics