Skip to main content
SpringerLink
Log in
Book cover

Metaheuristics for Bi-level Optimization pp 1–39Cite as

A Taxonomy of Metaheuristics for Bi-level Optimization

  • Chapter

Part of the book series: Studies in Computational Intelligence ((SCI,volume 482))

Abstract

In recent years, the application of metaheuristic techniques to solve multilevel and particularly bi-level optimization problems (BOPs) has become an active research area. BOPs constitute a very important class of problems with various applications in different domains. A wide variety of metaheuristics have been proposed in the literature to solve such hierarchical optimization problems. In this paper, a taxonomy of metaheuristics to solve BOPs is presented in an attempt to provide a common terminology and classification mechanisms. The taxonomy, while presented in terms of metaheuristics, is also applicable to most types of heuristics and exact optimization algorithms.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Aiyoshi, E., Shimizu, K.: A solution method for the static constrained stackelberg problem via penalty method. IEEE Transactions on Automatic Control 29, 1111–1114 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arroyo, J.M., Fernandez, F.J.: A genetic algorithm approach for the analysis of electric grid interdiction with line switching. In: 15th International Conference on Intelligent System Applications to Power Systems (ISAP 2009), pp. 1–6 (November 2009)

    Google Scholar 

  3. Arroyo, J.M., Galiana, F.D.: On the solution of the bilevel programming formulation of the terrorist threat problem. IEEE Transactions on Power Systems 20(2), 789–797 (2005)

    Article  Google Scholar 

  4. Bard, J.: Some properties of the bilevel programming problem. Optim. Theory Appl.

    Google Scholar 

  5. Bard, J.: Optimality conditions for the bilevel programming problems. Naval Research Logistics 31, 13–26 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bard, J.F.: Practical bilevel optimization. Algorithms and applications. Kluwer Academic Publishers, Boston (1998)

    Book  MATH  Google Scholar 

  7. Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Operations Research 21, 37–44 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Calamai, P., Vicente, L.: Generating bilevel and linear-quadratic programming problems. SIAM Journal on Scientific and Statistical Computing 14, 770–782 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Candler, W.: A linear bilevel programming algorithm: a comment. Computers and Operations Research 15(3), 297–298 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  10. Candler, W., Norton, R.: Multilevel programming. Technical Report 20, World Bank Development Research, Washington D. C (1977)

    Google Scholar 

  11. Chiou, S.: Bilevel programming formulation for the continuous network design problem. Transportation Research Part B 39(4), 361–383 (2005)

    Google Scholar 

  12. Clark, P.A., Westerberg, A.W.: A note on the optimality conditions for the bilevel programming problem. Naval Research Logistic Quarterly 35, 413–421 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  13. Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Annals of Operations Research (153), 235–256 (2007)

    Google Scholar 

  14. Côté, J.-P., Marcotte, P., Savard, G.: A bilevel modeling approach to pricing and fare optimization in the airline industry. Journal of Revenue and Pricing Management 2, 23–36 (2003)

    Article  Google Scholar 

  15. Cree, N.D., Maher, M., Paechter, B.: The continuous equilibrium optimal network design problem: a genetic approach. In: Transportation Networks: Recent Methodological Advances, pp. 163–174. Elsevier (1998)

    Google Scholar 

  16. Dempe, S.: Foundations of bilevel programming. Kluwer Academic Publishers, Boston (2002)

    MATH  Google Scholar 

  17. Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52(3), 333–359 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Dempe, S., Dutta, J., Lohse, S.: Optimality conditions for bilevel programming problems. Optimization 55(5), 505–524 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Deng, X.: Complexity issues in bilevel linear programming. In: Multilevel Optimization: Algorithms and Applications, pp. 149–164. Kluwer Academic Publishers, Dordrecht (1998)

    Chapter  Google Scholar 

  20. Dimitriou, L., Tsekeris, T., Stathopoulos, A.: Genetic Computation of Road Network Design and Pricing Stackelberg Games with Multi-class Users. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Drechsler, R., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., McCormack, J., O’Neill, M., Romero, J., Rothlauf, F., Squillero, G., Uyar, A.Ş., Yang, S. (eds.) EvoWorkshops 2008. LNCS, vol. 4974, pp. 669–678. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Fliege, J., Vicente, L.N.: Multicriteria approach to bilevel optimization. J. Optimization Theory Appl. 131(2), 209–225 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Friesz, T.L., Anandalingam, G., Mehta, N.J., Nam, K., Shah, S.J., Tobin, R.L.: The multiobjective equilibrium network design problem revisited: A simulated annealing approach. European Journal of Operational Research 65(1), 44–57 (1993)

    Article  MATH  Google Scholar 

  23. Fudenberg, D., Tirole, J.: Game theory. MIT Press (1993)

    Google Scholar 

  24. Gao, J., Zhang, G., Lu, J., Wee, H.-M.: Particle swarm optimization for bi-level pricing problems in supply chains. Journal of Global Optimization 51, 245–254 (2010)

    Article  MathSciNet  Google Scholar 

  25. Gao, Y.: bi-level decision making with fuzzy sets and particle swarm optimization. PhD thesis, UTS, Australia (2010)

    Google Scholar 

  26. Gendreau, M., Marcotte, P., Savard, G.: A hybrid tabu-ascent algorithm for the linear bilevel programming problem. Journal of Global Optimization 8, 217–233 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  27. Halter, W., Mostaghim, S.: Bilevel optimization of multi-component chemical systems using particle swarm optimization. In: World Congress on Computational Intelligence (WCCI 2006), pp. 1240–1247 (2006)

    Google Scholar 

  28. Hansen, P., Jaumard, B., Savard, G.: New branch and bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing 13, 1194–1217 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  29. Hecheng, L., Wang, Y.: A genetic algorithm for solving a special class of nonlinear bilevel programming problems. In: 7th International Conference on Computational Science (ICCS 2007), pp. 1159–1162 (2007)

    Google Scholar 

  30. Hejazia, S.R., Memariania, A., Jahanshahloob, G., Sepehria, M.M.: Linear bilevel programming solution by genetic algorithm. Computers and Operations Research 29, 1913–1925 (2002)

    Article  MathSciNet  Google Scholar 

  31. Herskovits, J., Leontiev, A., Dias, G., Santos, G.: Contact shape optimization:a bilevel programming approach. Struct. Multidisc. Optimization 20, 214–221 (2000)

    Article  Google Scholar 

  32. Huang, B., Liu, N.: Bilevel programming approach to optimizing a logistic distribution network with balancing requirements. Journal of the Transportation Research, 188–197 (1894, 2004)

    Google Scholar 

  33. Ciric, A.R., Sahin, K.H.: A dual temperature simulated annealing approach for solving bilevel programming problem. Computers and Chemical Engineering 23(1), 11–25 (1998)

    Article  Google Scholar 

  34. Koh, A.: Solving transportation bi-level programs with differential evolution. In: IEEE Congress on Evolutionary Computation (CEC 2007), pp. 2243–2250 (2007)

    Google Scholar 

  35. Küçükaydın, H., Aras, N., Altınel, İ.K.: A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 31–45. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  36. Kuo, R.J., Huang, C.C.: Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Computers and Mathematics with Applications 58, 678–685 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  37. LeBlanc, L., Boyce, D.E.: A bilevel programming for exact solution of the network design problem with user-optimal flows. Transportation Research 20(3), 259–265 (1986)

    Article  MathSciNet  Google Scholar 

  38. Legillon, F., Liefooghe, A., Talbi, E.-G.: Cobra: A cooperative coevolutionary algorithm for bi-level optimization. In: IEEE CEC 2012 Congress on Evolutionary Computation, Brisbane, Australia (June 2012)

    Google Scholar 

  39. Li, H., Wang, Y.: A hybrid genetic algorithm for solving nonlinear bilevel programming problems based on the simplex method. In: IEEE Third International Conference on Natural Computation (ICNC 2007), pp. 91–95 (2007)

    Google Scholar 

  40. Li, H., Wang, Y.: An evolutionary algorithm based on a new decomposition scheme for nonlinear bilevel programming problems. Int. J. Communications, Network and System Sciences 2, 87–93 (2009)

    Google Scholar 

  41. Li, X., Tian, P., Min, X.: A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 1169–1178. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  42. Loridan, P., Morgan, J.: Weak via strong stackelberg problem: New results. Journal of Global Optimization 8, 263–287 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  43. Luce, R., Raiffa, H.: Game and decisions. Wiley (1957)

    Google Scholar 

  44. Marcotte, P.: Network optimization with continuous control parameters. Transportation Science 17, 181–197 (1983)

    Article  Google Scholar 

  45. Mathieu, R., Pittard, L., Anandalingam, G.: Genetic algorithm based approach to bi-level linear programming. Operations Research 28(1), 1–21 (1994)

    MathSciNet  MATH  Google Scholar 

  46. Meng, Q., Yang, H., Bell, M.G.H.: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transportation Research Part B 35(1), 83–105 (2000)

    Article  Google Scholar 

  47. Migdalas, A.: Bilevel programming in traffic planning: Models, methods and challenge. Journal of Global Optimization 7(4), 381–405 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  48. Muu, L.D., Quy, N.V.: A global optimization method for solving convex quadratic bilevel programming problems. Journal of Global Optimization 26(2), 199–219 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  49. Oduguwa, V., Roy, R.: Bi-level optimisation using genetic algorithm. In: IEEE International Conference on Artificial Intelligence Systems (ICAIS 2002), pp. 322–327 (2002)

    Google Scholar 

  50. Osman, M.S., Abdel-Wahed, W.F., El-Shafei, M.K., Abdel-Wahab, B.H.: A solution methodology of bi-level linear programming based on genetic algorithm. Journal of Mathematics and Statistics 5(4), 352–359 (2009)

    Article  MATH  Google Scholar 

  51. Pei, Y., Ci, Y.: Study on bi-level planning model and algorithm optimizing highway network layout. In: Eastern Asia Society for Transportation Studies, pp. 750–761 (2005)

    Google Scholar 

  52. Savard, G., Gauvin, J.: The steepest descent direction for the nonlinear bilinear programming problem. Operations Research Letters 15, 275–282 (1994)

    Article  MathSciNet  Google Scholar 

  53. Shepherd, S.P., Sumalee, A.: A genetic algorithm based approach to optimal toll level and location problems. Network and Spatial Economics 4(2), 161–179 (2004)

    Article  MATH  Google Scholar 

  54. Shi, C.: Linear bilevel programming technology - models and algorithms. PhD thesis, University of Technology, Sydney, Australia (2005)

    Google Scholar 

  55. Stackelberg, H.: The theory of market economy. Oxford University Press, Oxford (1952)

    Google Scholar 

  56. Sun, D.: A bi-level programming formulation and heuristic solution approach for traffic control optimization in networks with dynamic demand and stochastic route choice. PhD thesis, University of Illinois, Urbana Champaign, USA (2005)

    Google Scholar 

  57. Sun, D., Benekohal, R.F., Waller, S.T.: Bi-level programming formulation and heuristic solution approach for dynamic traffic signal optimization. Computer-Aided Civil and Infrastructure Engineering 21(5), 321–333 (2006)

    Article  Google Scholar 

  58. Unlu, G.: A linear bilevel programming algorithm based on bicriteria programming. Computers and Operations Research 14, 173–179 (1987)

    Article  MathSciNet  Google Scholar 

  59. Vicente, L., Savarg, G., Judice, J.: Descent approaches for quadratic bilevel programming. Journal of Optimization Theory and Applications 81(2), 379–399 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  60. Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization 5(3), 291–306 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  61. Wang, G., Wan, Z., Wang, X., Fang, D.: Genetic algorithm for solving quadratic bilevel programming problem. Wuhan University Journal of Natural Sciences 12(3), 421–425 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  62. Wang, G., Wan, Z., Wang, X., Lu, Y.: Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem. Computers and Mathematics with Applications 56(10), 2550–2555 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  63. Wang, G.-M., Wang, X.-J., Wan, Z.-P., Jia, S.-H.: An adaptive genetic algorithm for solving bilevel linear programming problem. Applied Mathematics and Mechanics 28(12), 1605–1612 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  64. Wang, Y., Jiao, Y.-C., Li, H.: An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 35(2), 221–232 (2005)

    Article  Google Scholar 

  65. Wen, U.P., Hsu, S.T.: A note on a linear bilevel programming algorithm based on bicriteria programming. Computers and Operations Research 16(1), 79–83 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  66. Wu, C.-P.: Hybrid technique for global optimization of hierarchical systems. In: IEEE International Conference on Systems, Man and Cybernetics, Beijing, China, pp. 1706–1711. IEEE Press (October 2006)

    Google Scholar 

  67. Yang, H., Lam, H.K.: Optimal road tolls under conditions of queuing and congestion. Transportation Research 30(5), 319–332 (1996)

    Google Scholar 

  68. Yin, Y.: Genetic algorithm based approach for bilevel programming models. Journal of Transportation Engineering 126(2), 115–120 (2000)

    Article  Google Scholar 

  69. Zhang, Y., Lam, W.H.K., Sumalee, A.: Transit schedule design in dynamic transit network with demand and supply uncertainties. Journal of the Eastern Asia Society for Transportation Studies 7 (2009)

    Google Scholar 

  70. Zuo, Z., Kanamori, R., Miwa, T., Morikawa, T.: A study of both optimal locations and toll levels road pricing using genetic algorithm. Journal of the Eastern Asia Society for Transportation Studies 8, 145–156 (2010)

    Google Scholar 

  71. Polya, G.: How to solve it. Princeton University Press (1945)

    Google Scholar 

  72. Edmonds, J.: Matroids and the greedy algorithm. Mathematical Programming 1(1), 127–136 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  73. Yonezawa, Y., Kikuchi, T.: Ecological algorithm for optimal ordering used by collective honey bee behavior. In: 7th Int. Symposium on Micro Machine and Human Science, pp. 249–256 (1996)

    Google Scholar 

  74. Price, K.: Genetic annealing. Dr. Dobb’s Journal, 127–132 (October 1994)

    Google Scholar 

  75. Hansen, N., Ostermeier Adapting, A.: arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In: IEEE Conference on Evolutionary Computation, pp. 312–317 (1996)

    Google Scholar 

  76. Baluja, S.: Population based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Carnegie Mellon University CMU-CS-94-163, Pittsburgh, Pennsylvania, USA (1994)

    Google Scholar 

  77. Voudouris, C., Tsang, E.: Guided local search. University of Essex CSM-247, UK (1995)

    Google Scholar 

  78. Mladenovic, N.: A variable neighborhood algorithm - a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montreal, Canada (1995)

    Google Scholar 

  79. Aarts, E.H.L., Lenstra, J.K.: Local search in combinatorial optimization. John Wiley (1997)

    Google Scholar 

  80. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  81. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Ops. Res. 13(5), 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  82. Holland, J.H.: Adaptation in natural and artificial systems. Michigan Press University, Ann Arbor (1975)

    Google Scholar 

  83. Beyer, H.-G.: The theory of evolution strategies. Springer (2001)

    Google Scholar 

  84. Talbi, E.-G.: Metaheuristics: from design to implementation. Wiley (2009)

    Google Scholar 

  85. Koza, J.R.: Genetic programming. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  86. Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences 8, 156–166 (1977)

    Article  Google Scholar 

  87. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344, 243–278 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  88. Kuhn, H., Tucker, A.: Non linear programming. In: Neyman, J. (ed.) 2nd Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA, pp. 481–492. Univ. of California (1951)

    Google Scholar 

  89. Dorigo, M.: Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy (1992)

    Google Scholar 

  90. Farmer, J.D., Packard, N., Perelson, A.: The immune system, adaptation and machine learning. Physica D 2, 187–204 (1986)

    Article  MathSciNet  Google Scholar 

  91. Bersini, H., Varela, F.J.: Hints for adaptive problem solving gleaned from immune networks. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 343–354. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  92. Seeley, T.D.: The wisdom of the hive. Harvard University Press, Cambridge (1995)

    Google Scholar 

  93. Reynolds, R.G.: An introduction to cultural algorithms. In: Sebald, A.V., Fogel, L.J. (eds.) 3rd Annual Conf. on Evolutionary Programming, River Edge, NJ, pp. 131–139. World Scientific (1994)

    Google Scholar 

  94. Hillis, W.D.: Co-evolving parasites improve simulated evolution as an optimization procedure. Physica D 42(1), 228–234 (1990)

    Article  Google Scholar 

  95. Husbands, P., Mill, F.: Simulated co-evolution as the mechanism for emergent planning and scheduling. In: Belew, R., Booker, K. (eds.) 4th International Conference on Genetic Algorithms, San Diego, CA, USA, pp. 264–270. Morgan Kaufmann

    Google Scholar 

  96. Storn, R., Price, K.: Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, Int CS Institute, Univ. of California (Mar 1995)

    Google Scholar 

  97. Rechenberg, I.: Cybernetic solution path of an experimental problem. Technical report, Royal Aircraft Establishment Library Translation No.1112, Farnborough, UK (1965)

    Google Scholar 

  98. Schwefel, H.-P.: Kybernetische evolution als strategie der experimentellen forschung in der str\(\ddot{o}\)mungstechnik. Technical report, Diplomarbeit Hermann Fottinger Institut f\(\ddot{u}\)r Str\(\ddot{o}\)mungstechnik, Technische universit\(\ddot{a}\)t, Berlin, Germany (1965)

    Google Scholar 

  99. Fogel, L.J.: Toward inductive inference automata. In: Proc. of the International Federation for Information Processing Congress, Munich, pp. 395–399 (1962)

    Google Scholar 

  100. Holland, J.H.: Outline for a logical theory of adaptive systems. J. ACM 3, 297–314 (1962)

    Article  Google Scholar 

  101. Dueck, G.: New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics 104(1), 86–92 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  102. Voudouris, C.: Guided local search - an illustrative example in function optimization. BT Technology Journal 16(3), 46–50 (1998)

    Article  Google Scholar 

  103. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  104. Martin, O., Otto, S.W., Felten, E.W.: Large-step markov chains for the traveling salesman problem. Complex Systems 5(3), 299–326 (1991)

    MathSciNet  MATH  Google Scholar 

  105. Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters 14, 133–137 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  106. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  107. Cerny, V.: A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45, 41–51 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  108. Glover, F., Mc Millan, C.: The general employee scheduling problem: An integration of MS and AI. Computers and Operations Research 13(5), 563–573 (1986)

    Article  Google Scholar 

  109. Duech, G., Scheuer, T.: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90, 161–175 (1990)

    Article  MathSciNet  Google Scholar 

  110. Hansen, P.: The steepest ascent mildest descent heuristic for combinatorial programming. Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986)

    Google Scholar 

  111. Engelmore, R.S., Morgan, A.: Blackboard Systems. Addison-Wesley (1988)

    Google Scholar 

  112. Crainic, T.G., Toulouse, M.: Parallel strategies for metaheuristics. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 475–513. Springer (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, INRIA, University of Lille 1, Villeneuve d’Ascq, France

    El-Ghazali Talbi

Authors
  1. El-Ghazali Talbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to El-Ghazali Talbi .

Editor information

Editors and Affiliations

  1. , Cite Scientifique, University of Lille 1, Villeneuve d'Ascq, 59655, France

    El-Ghazali Talbi

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Talbi, EG. (2013). A Taxonomy of Metaheuristics for Bi-level Optimization. In: Talbi, EG. (eds) Metaheuristics for Bi-level Optimization. Studies in Computational Intelligence, vol 482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37838-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37838-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37837-9

  • Online ISBN: 978-3-642-37838-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation