Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2016 | OriginalPaper | Buchkapitel

22. Dynamic, Multimodal, and Constrained Optimizations

verfasst von : Ke-Lin Du, M. N. S. Swamy

Erschienen in: Search and Optimization by Metaheuristics

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This chapter treats several hard problems associated with metaheuristic optimization, namely, dynamic, multimodal, and constrained optimization problems.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Search Based on Human Behaviors
Nächstes Kapitel Multiobjective Optimization
Literatur
1.
Baluja S. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA, Technical Report CMU-CS-94-163. 1994.
2.
Barbosa HJC, Lemonge ACC. An adaptive penalty scheme in genetic algorithms for constrained optimization problems. In: Proceedings of the genetic and evolutionary computation conference (GECCO), New York, July 2002. p. 287–294.
3.
Basak A, Das S, Tan KC. Multimodal optimization using a biobjective differential evolution algorithm enhanced with mean distance-based selection. IEEE Trans Evol Comput. 2013;17(5):666–85.CrossRef
4.
Beasley D, Bull DR, Martin RR. A sequential niche technique for multimodal function optimization. Evol Comput. 1993;1(2):101–25.CrossRef
5.
Blackwell TM, Bentley PJ. Dynamic search with charged swarms. In: Proceedings of the genetic and evolutionary computation conference (GECCO), New York, July 2002. p. 19–26.
6.
Blackwell T, Branke J. Multi-swarm optimization in dynamic environments. In: Applications of Evolutionary Computing, vol. 3005 of Lecture Notes in Computer Science. Berlin: Springer. p. 489–500.
7.
Branke J. Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the IEEE congress on evolutionary computation (CEC), Washington, DC, USA, July 1999. p. 1875–1882.
8.
Branke J, Kaubler T, Schmidt C, Schmeck H. A multi-population approach to dynamic optimization problems. In: Evolutionary design and manufacture: selected papers from adaptive computing in design and manufacture. London: Springer; 2000. p. 299–307.
9.
Brest J, Maucec MS. Population size reduction for the differential evolution algorithm. Appl Intell. 2008;29(3):228–47.CrossRef
10.
Brits R, Engelbrecht AP, van den Bergh F. Solving systems of unconstrained equations using particle swarm optimization. In: Proceedings of IEEE conference on systems, man, and cybernetics, Hammamet, Tunisia, October 2002, vol. 3, p. 102–107.
11.
Brits R, Engelbrecht AP, van den Bergh F. A niching particle swarm optimizer. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning, Singapore, November 2002. p. 692–696.
12.
Bui LT, Abbass HA, Branke J. Multiobjective optimization for dynamic environments. In: Proceedings of congress on evolutionary computation (CEC), Edinburgh, UK, September 2005. p. 2349–2356.
13.
Cai Z, Wang Y. A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans Evol Comput. 2006;10:658–75.CrossRef
14.
Chootinan P, Chen A. Constraint handling in genetic algorithms using a gradient-based repair method. Comput Oper Res. 2006;33:2263–81.CrossRefMATH
15.
Cioppa AD, De Stefano C, Marcelli A. Where are the niches? dynamic fitness sharing. IEEE Trans Evol Comput. 2007;11(4):453–65.
16.
Cobb HG, Grefenstette JJ. Genetic algorithms for tracking changing environments. In: Proceedings of the 5th International conference on genetic algorithms, Urbana-Champaign, IL, USA, June 1993. San Mateo, CA: Morgan Kaufmann; 1993. p. 523–530.
17.
Cuevas E, Gonzalez M. An optimization algorithm for multimodal functions inspired by collective animal behavior. Soft Comput. 2013;17:489–502.CrossRef
18.
Deb K, Goldberg DE. An investigation of niche and species formation in genetic function optimization. In: Schaffer JD, editor. Proceedings of the 3rd International conference on genetic algorithms, Fairfax, Virginia, USA, June 1989. San Mateo, CA: Morgan Kaufmann; 1989. p. 42–50
19.
Deb K, Pratab A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput. 2002;6(2):182–97.CrossRef
20.
Deb K, Saha A. Finding multiple solutions for multimodal optimization problems using a multiobjective evolutionary approach. In: Proceedings of the 12th Annual conference on genetic and evolutionary computation (GECCO), Portland, Oregon, USA, July 2010. p. 447–454.
21.
De Jong K. An analysis of the behavior of a class of genetic adaptive systems. PhD Thesis, University of Michigan, Ann Arbor, MI, USA, 1975.
22.
Dilettoso E, Salerno N. A self-adaptive niching genetic algorithm for multimodal optimization of electromagnetic devices. IEEE Trans Magn. 2006;42(4):1203–6.CrossRef
23.
Eshelman LJ, Schaffer JD. Preventing premature convergence in genetic algorithms by preventing incest. In: Proceedings of the 4th International conference on genetic algorithms, San Diego, CA, USA, July 1991. San Mateo, CA, USA: Morgan Kaufmann Publishers; 1991. p. 115–122.
24.
Farmani R, Wright J. Self-adaptive fitness formulation for constrained optimization. IEEE Trans Evol Comput. 2003;7(5):445–55.CrossRef
25.
Fonseca CM, Fleming PJ. Multiobjective optimization and multiple constraint handling with evolutionary algorithms—Part i: a unified formulation; Part ii: application example. IEEE Trans Syst, Man, Cybern Part A 28:1;1998: 26–37, 38–47.
26.
Galan SF, Mengshoel OJ. Generalized crowding for genetic algorithms. In: Proceedings of genetic and evolutionary computation conference (GECCO), Portland, Oregon, USA, July 2010. p. 775–782.
27.
Gan J, Warwick K. A genetic algorithm with dynamic niche clustering for multimodal function optimisation. In: Proceedings of the international conference on artificial neural networks and genetic algorithms, Portoroz, Slovenia. Vienna: Springer; 1999. p. 248–255
28.
Mc Ginley B, Maher J, O’Riordan C, Morgan F. Maintaining healthy population diversity using adaptive crossover, mutation, and selection. IEEE Trans Evol Comput. 15:5;2011: 692–714.
29.
Goldberg DE, Richardson J. Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette J, edtor. Proceedings of the 2nd International conference on genetic algorithms and their application, Cambridge, MA, USA, July 1987. Hillsdale, New Jersey: Lawrence Erlbaum; 1987. p. 41–49.
30.
Grefenstette JJ. Genetic algorithms for changing environments. In: Proceedings of the 2nd International conference on parallel problem solving from nature (PPSN II), Brussels, Belgium, September 1992. p. 137–144.
31.
Hansen N. Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), Montreal, Canada, July 2009, pp. 2389–2395.
32.
Harik GR. Finding multimodal solutions using restricted tournament selection. In: Proceedings of the 6th International conference on genetic algorithms, Pittsburgh, PA, USA, July 1995. San Mateo, CA: Morgan Kaufmann; 1995. p. 24–31.
33.
Homaifar A, Lai SHY, Qi X. Constrained optimization via genetic algorithms. Simulation. 1994;62(4):242–54.CrossRef
34.
Horn J. The nature of niching: genetic algorithms and the evolution of optimal, cooperative populations. Ph.D. Thesis, Genetic Algorithm Lab, University of Illinois at Urbana-Champaign Champaign, IL, USA, 1997.
35.
Horn J, Nafpliotis N, Goldberg DE. A niched pareto genetic algorithm for multiobjective optimization. In: Proceedings of the 1st IEEE Conference on evolutionary computation (CEC), Orlando, FL, USA, June 1994, vol. 1, p. 82–87.
36.
Janson S, Middendorf M. A hierarchical particle swarm optimizer for dynamic optimization problems. In: Applications of evolutionary computing, vol. 3005 of Lecture Notes in Computer Science. Berlin: Springer; 2004. p. 513–524.
37.
Joines JA, Houck CR. On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs. In: Proceedings of IEEE Congress on evolutionary computation (CEC), Orlando, FL, USA, June 1994, p. 579–584.
38.
Lemonge ACC, Barbosa HJC. An adaptive penalty scheme in genetic algorithms for constrained optimization problems. In: Proceedings of genetic and evolutionary computation conference (GECCO), New York, July 2002, p. 287–294.
39.
Li C, Yang S. A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evol Comput. 2012;16(4):556–77.CrossRef
40.
Li J-P, Balazs ME, Parks GT, Clarkson PJ. A species conserving genetic algorithm for multimodal function optimization. Evol Comput. 2002;10(3):207–34.CrossRef
41.
Li X. Adaptively choosing neighborhood bests using species in a particle swarm optimizer for multimodal function optimization. In: Proceedings of the genetic and evolutionary computation conference (GECCO), Seattle, WA, USA, June 2004. p. 105–116.
42.
Li X. Efficient differential evolution using speciation for multimodal function optimization. In: Proceedings of conference on genetic and evolutionary computation (GECCO), Washington, DC, USA, June 2005. p. 873–880.
43.
Li X. Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans Evol Comput. 2010;14(1):150–69.CrossRef
44.
Li L, Tang K. History-based topological speciation for multimodal optimization. IEEE Trans Evol Comput. 2015;19(1):136–50.CrossRef
45.
Liapis A, Yannakakis GN, Togelius J. Constrained novelty search: a study on game content generation. Evol Comput. 2015;23(1):101–29.CrossRef
46.
Lin CY, Wu WH. Self-organizing adaptive penalty strategy in constrained genetic search. Struct Multidiscip Optim. 2004;26(6):417–28.CrossRef
47.
Ling Q, Wu G, Yang Z, Wang Q. Crowding clustering genetic algorithm for multimodal function optimization. Appl Soft Comput. 2008;8(1):88–95.CrossRef
48.
Liu L, Yang S, Wang D. Particle swarm optimization with composite particles in dynamic environments. IEEE Trans Syst, Man, Cybern Part B. 2010;40(6):1634–48.CrossRef
49.
Mahfoud SW. Crowding and preselection revisited. In: Manner R, Manderick B, editors. Proceedings of the 2th International conference on parallel problem solving from nature (PPSN II), Brussels, Belgium, September 1992. Amsterdam: Elsevier; 1992. p. 27–36.
50.
Mahfoud SW. Niching methods for genetic algorithms. Technical Report 95001, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, USA, 1995.
51.
Menczer F, Belew RK. Local selection. In: Proceedings of the 7th International conference on evolutionary programming, San Diego, CA, USA, March 1998, vol. 1447 of Lecture Notes in Computer Science. Berlin: Springer; 1998. p. 703–712.
52.
Mengshoel OJ, Goldberg DE. Probability crowding: deterministic crowding with probabilistic replacement. In: Proceedings of genetic and evolutionary computation conference (GECCO), Orlando, FL, USA, July 1999. p. 409–416.
53.
Mengshoel OJ, Goldberg DE. The crowding approach to niching in genetic algorithms. Evol Comput. 2008;16(3):315–54.CrossRef
54.
Miller BL, Shaw MJ. Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: Proceedings of IEEE International conference on evolutionary computation (CEC), Nagoya, Japan, May 1996. p. 786–791.
55.
Morrison RW, De Jong KA. Triggered hyper mutation revisited. In: Proceedings of congress on evolutionary computation (CEC), San Diego, CA, USA, July 2000. p. 1025–1032.
56.
Parrott D, Li X. Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput. 2006;10(4):440–58.CrossRef
57.
Parsopoulos KE, Tasoulis DK, Pavlidis NG, Plagianakos VP, Vrahatis MN. Vector evaluated differential evolution for multiobjective optimization. In: Proceedings of IEEE congress on evolutionary computation (CEC), Portland, OR, USA, June 2004. p. 204–211.
58.
Petrowski A. A CLEARING procedure as a niching method for genetic algorithms. In: Proceedings of IEEE International conference on evolutionary computation (CEC), Nagoya, Japan, May 1996. p. 798–803.
59.
Qu BY, Suganthan PN, Liang JJ. Differential evolution with neighborhood mutation for multimodal optimization. IEEE Trans Evol Comput. 2012;16(5):601–14.CrossRef
60.
Richter H. Detecting change in dynamic fitness landscapes. In: Proceedings of congress on evolutionary computation (CEC), Trondheim, Norway, May 2009. p. 1613–1620.
61.
Runarsson TP, Yao X. Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput. 2000;4(3):284–94.CrossRef
62.
Runarsson TP, Yao X. Search bias in constrained evolutionary optimization. IEEE Trans Syst, Man, Cybern Part C. 2005;35:233–43.CrossRef
63.
Shir OM, Back T. Niche radius adaptation in the CMA-ES niching algorithm. In: Proceedings of the 9th International conference on parallel problem solving from nature (PPSN IX), Reykjavik, Iceland, September 2006, vol. 4193 of Lecture Notes in Computer Science. Berlin: Springer; 2006. p. 142–151.
64.
Shir OM, Emmerich M, Back T. Adaptive niche radii and niche shapes approaches for niching with the CMA-ES. Evol Comput. 2010;18(1):97–126.CrossRef
65.
Singh G, Deb K. Comparison of multimodal optimization1 algorithms based on evolutionary algorithms. In: Proceedings of the 8th Annual conference on genetic and evolutionary computation (GECCO), Seattle, WA, USA, June 2006. p. 1305–1312.
66.
Stoean C, Preuss M, Stoean R, Dumitrescu D. Multimodal optimization by means of a topological species conservation algorithm. IEEE Trans Evol Comput. 2010;14(6):842–64.CrossRef
67.
Takahama T, Sakai S. Constrained optimization by applying the \(\alpha \)-constrained method to the nonlinear simplex method with mutations. IEEE Trans Evol Comput. 2005;9(5):437–51.CrossRef
68.
Tessema B, Yen GG. An adaptive penalty formulation for constrained evolutionary optimization. IEEE Trans Syst, Man, Cybern Part A. 2009;39(3):565–78.CrossRef
69.
Thomsen R. Multimodal optimization using crowding-based differential evolution. In: Proceedings of IEEE Congress on evolutionary computation (CEC), Portland, OR, USA, June 2004. p. 1382–1389.
70.
Tsutsui S, Fujimoto Y, Ghosh A. Forking genetic algorithms: GAs with search space division schemes. Evol Comput. 1997;5:61–80.CrossRef
71.
Ursem RK. Multinational evolutionary algorithms. In: Proceedings of the IEEE Congress on evolutionary computation (CEC), Washington, DC, USA, July 1999. p. 1633–1640.
72.
Ursem RK. Multinational GAs: multimodal optimization techniques in dynamic environments. In: Proceedings of the genetic and evolutionary computation conference (GECCO), Las Vegas, NV, USA, July 2000. p. 19–26.
73.
Venkatraman S, Yen GG. A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput. 2005;9(4):424–35.CrossRef
74.
Wagner N, Michalewicz Z, Khouja M, McGregor RR. Time series forecasting for dynamic environments: the DyFor genetic program model. IEEE Trans Evol Comput. 2007;11(4):433–52.CrossRef
75.
Wang Y, Cai Z, Guo G, Zhou Y. Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst, Man, Cybern Part B. 2007;37(3):560–75.CrossRef
76.
Woldesenbet YG, Yen GG, Tessema BG. Constraint handling in multiobjective evolutionary optimization. IEEE Trans Evol Comput. 2009;13(3):514–25.CrossRef
77.
Yang S. Genetic algorithms with elitism-based immigrants for changing optimization problems. In: Applications of evolutionary computing, vol. 4448 of Lecture Notes in Computer Science. Berlin: Springer; 2007. p. 627–636.
78.
Yang S. Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evol Comput. 2008;16(3):385–416.CrossRef
79.
Yang S, Li C. A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments. IEEE Trans Evol Comput. 2010;14(6):959–74.CrossRef
80.
Yang S, Yao X. Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput. 2008;12(5):542–61.CrossRef
81.
Yao J, Kharma N, Grogono P. Bi-objective multipopulation genetic algorithm for multimodal function optimization. IEEE Trans Evol Comput. 2010;14(1):80–102.CrossRef
82.
Yin X, Germay N. A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In: Proceedings of the International conference on artificial neural nets and genetic algorithms, Innsbruck, Austria, 1993. Vienna: Springer; 1993. p. 450–457.
83.
Yu X, Tang K, Yao X. An immigrants scheme based on environmental information for genetic algorithms in changing environments. In: Proceedings of the IEEE Congress on evolutionary computation (CEC), Hong Kong, June 2008. p. 1141–1147.
Metadaten
Titel
Dynamic, Multimodal, and Constrained Optimizations
verfasst von
Ke-Lin Du
M. N. S. Swamy
Copyright-Jahr
2016
Buch
Search and Optimization by Metaheuristics

Print ISBN: 978-3-319-41191-0

Electronic ISBN: 978-3-319-41192-7

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-41192-7_22

Premium Partner

    Bildnachweise