Bayesian Immigrant Diploid Genetic Algorithm for Dynamic Environments
Pages 121 - 135
Abstract
In dynamic environments, the main aim of an optimization algorithm is to track the changes and to adapt the search process. In this paper, we propose an approach called the Bayesian Immigrant Diploid Genetic Algorithm (BIDGA). BIDGA uses implicit memory in the form of diploid chromosomes, combined with the Bayesian Optimization Algorithm (BOA), which is a form of Estimation of Distribution Algorithms (EDAs). Through the use of BOA, BIDGA is able to take into account epistasis in the form of binary relationships between the variables. Experiments show that the proposed approach is efficient and also indicates that exploiting interactions between variables is important to adapt to the newly formed environments.
References
[1]
Akandwanaho SM and Viriri S A spy search mechanism for memetic algorithm in dynamic environments Appl. Soft Comput. 2019 75 203-214
[2]
Baluja, S.: Population-based incremental learning. A method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie-Mellon Univ. Pittsburgh, PA, Dept. of Computer Science (1994)
[3]
Baykasoğlu A and Ozsoydan FB Dynamic optimization in binary search spaces via weighted superposition attraction algorithm Expert Syst. Appl. 2018 96 157-174
[4]
Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 3, pp. 1875–1882. IEEE (1999)
[5]
Branke J Branke J Optimization in dynamic environments Evolutionary Optimization in Dynamic Environments 2002 Boston Springer 13-29
[6]
Branke J Evolutionary Optimization in Dynamic Environments 2002 Boston Springer
[7]
Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical report, Naval Research Lab Washington DC (1990)
[8]
Cobb, H.G., Grefenstette, J.J.: Genetic algorithms for tracking changing environments. Technical report, Naval Research Lab Washington DC (1993)
[9]
De Bonet, J.S., Isbell Jr, C.L., Viola, P.A.: MIMIC: finding optima by estimating probability densities. In: Advances in Neural Information Processing Systems, pp. 424–430 (1997)
[10]
Gazioglu, E.: Bidga results (2019). https://web.itu.edu.tr/egazioglu/bidga/
[11]
Jin Y and Branke J Evolutionary optimization in uncertain environments-a survey IEEE Trans. Evol. Comput. 2005 9 3 303-317
[12]
Mavrovouniotis M and Yang S Squillero G and Burelli P Direct memory schemes for population-based incremental learning in cyclically changing environments Applications of Evolutionary Computation 2016 Cham Springer 233-247
[13]
Michalewicz Z and Arabas J Raś ZW and Zemankova M Genetic algorithms for the 0/1 knapsack problem Methodologies for Intelligent Systems 1994 Heidelberg Springer 134-143
[14]
Ozsoydan FB and Baykasoğlu A Quantum firefly swarms for multimodal dynamic optimization problems Expert Syst. Appl. 2019 115 189-199
[15]
Pelikan, M.: The Bayesian optimization algorithm (BOA) with decision graphs. IlliGAL Report (2000025) (2000)
[16]
Pelikan M, Hauschild MW, and Lobo FG Kacprzyk J and Pedrycz W Estimation of distribution algorithms Springer Handbook of Computational Intelligence 2015 Heidelberg Springer 899-928
[17]
Peng X, Gao X, and Yang S Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments Soft. Comput. 2011 15 2 311-326
[18]
Qian S, Liu Y, Ye Y, and Xu GAn enhanced genetic algorithm for constrained knapsack problems in dynamic environmentsNatural Comput.2019184913-9324029269
[19]
Uludağ G, Kiraz B, Etaner-Uyar AŞ, and Özcan E Coello CAC, Cutello V, Deb K, Forrest S, Nicosia G, and Pavone M A framework to hybridize PBIL and a hyper-heuristic for dynamic environments Parallel Problem Solving from Nature - PPSN XII 2012 Heidelberg Springer 358-367
[20]
Uludağ G, Kiraz B, Etaner-Uyar AŞ, and Özcan E A hybrid multi-population framework for dynamic environments combining online and offline learning Soft. Comput. 2013 17 12 2327-2348
[21]
Uyar AŞ and Harmanci AEA new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environmentsSoft. Comput.2005911803-8141084.68896
[22]
Vavak, F.: Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search. In: 7th International Conference on Genetic Algorithm. Morgan Kaufmann (1997)
[23]
Yang, S.: Constructing dynamic test environments for genetic algorithms based on problem difficulty. In: 2004 Congress on Evolutionary Computation (CEC 2004), vol. 2, pp. 1262–1269. IEEE (2004)
[24]
Yang, S.: Memory-based immigrants for genetic algorithms in dynamic environments. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 1115–1122. ACM (2005)
[25]
Yang S Giacobini M Genetic algorithms with elitism-based immigrants for changing optimization problems Applications of Evolutionary Computing 2007 Heidelberg Springer 627-636
[26]
Yang S Genetic algorithms with memory-and elitism-based immigrants in dynamic environments Evol. Comput. 2008 16 3 385-416
[27]
Yang S and Tinós R A hybrid immigrants scheme for genetic algorithms in dynamic environments Int. J. Autom. Comput. 2007 4 3 243-254
[28]
Yang S and Yao X Population-based incremental learning with associative memory for dynamic environments IEEE Trans. Evol. Comput. 2008 12 5 542-561
Index Terms
- Bayesian Immigrant Diploid Genetic Algorithm for Dynamic Environments
Index terms have been assigned to the content through auto-classification.
Recommendations
On the performance of a hybrid genetic algorithm in dynamic environments
The ability to track the optimum of dynamic environments is important in many practical applications. In this paper, the capability of a hybrid genetic algorithm (HGA) to track the optimum in some dynamic environments is investigated for different ...
Extracted global structure makes local building block processing effective in XCS
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computationMichigan-style learning classifier systems (LCSs), such as the accuracy-based XCS system, evolve distributed problem solutions represented by a population of rules. Recently, it was shown that decomposable problems may require effective processing of ...
Network crossover performance on NK landscapes and deceptive problems
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationPractitioners often have some information about the problem being solved, which may be represented as a graph of dependencies or correlations between problem variables. Similar information can also be obtained automatically, for example by mining the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Oct 2019
232 pages
ISBN:978-3-030-45714-3
DOI:10.1007/978-3-030-45715-0
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 29 October 2019
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024