A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
- 5 August 2008
- journal article
- Published by Springer Science and Business Media LLC in Soft Computing
- Vol. 13 (8-9), 763-780
- https://doi.org/10.1007/s00500-008-0347-3
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- On the Hybridization of Memetic Algorithms With Branch-and-Bound TechniquesIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2007
- A Competitive-Cooperation Coevolutionary Paradigm for Multi-objective OptimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Dynamic multi-objective optimization with evolutionary algorithmsPublished by Association for Computing Machinery (ACM) ,2006
- On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop schedulingIEEE Transactions on Evolutionary Computation, 2003
- Memory enhanced evolutionary algorithms for changing optimization problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the Behavior of Evolutionary Global-Local Hybrids with Dynamic Fitness FunctionsLecture Notes in Computer Science, 2002
- A Multi-population Approach to Dynamic Optimization ProblemsPublished by Springer Science and Business Media LLC ,2000
- Parameter control in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 1999
- An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary EnvironmentsPublished by Defense Technical Information Center (DTIC) ,1990