Memetic algorithms and memetic computing optimization: A literature review

Dawkins, 1976

Moscato, 1989, A competitive and cooperative approach to complex combinatorial search, Technical Reports, 790

Moscato, 1989, On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms, Technical Reports, 826

Wolpert, 1997, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, 1, 67, 10.1109/4235.585893

Goldberg, 1989

Joshi, 1999, Minimal representation multisensor fusion using differential evolution, IEEE Transactions on Systems, Man and Cybernetics, Part A, 29, 63, 10.1109/3468.736361

T. Rogalsky, R.W. Derksen, Hybridization of differential evolution for aerodynamic design, in: Proceedings of the 8th Annual Conference of the Computational Fluid Dynamics Society of Canada, 2000, pp. 729–736.

Fan, 2007, A direct first principle study on the structure and electronic properties of bexzn1-xo, Applied Physics Letter, 91

Caponio, 2007, A fast adaptive memetic algorithm for on-line and off-line control design of pmsm drives, IEEE Transactions on System Man and Cybernetics-Part B, Special Issue on Memetic Algorithms, 37, 28, 10.1109/TSMCB.2006.883271

Neri, 2010, Memetic compact differential evolution for cartesian robot control, IEEE Computational Intelligence Magazine, 5, 54, 10.1109/MCI.2010.936305

Neri, 2007, An adaptive evolutionary algorithm with intelligent mutation local searchers for designing multidrug therapies for HIV, Applied Intelligence, 27, 219, 10.1007/s10489-007-0069-8

Neri, 2007, An adaptive multimeme algorithm for designing HIV multidrug therapies, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4, 264, 10.1109/TCBB.2007.070202

Tirronen, 2008, An enhanced memetic differential evolution in filter design for defect detection in paper production, Evolutionary Computation, 16, 529, 10.1162/evco.2008.16.4.529

Tang, 2007, Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 11, 873

Ong, 2004, Meta-lamarkian learning in memetic algorithms, IEEE Transactions on Evolutionary Computation, 8, 99, 10.1109/TEVC.2003.819944

Nguyen, 2009, A probabilistic memetic framework, IEEE Transactions on Evolutionary Computation, 13, 604, 10.1109/TEVC.2008.2009460

Ishibuchi, 2003, Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow shop scheduling, IEEE Transactions on Evolutionary Computation, 7, 204, 10.1109/TEVC.2003.810752

Tan, 2009, Balancing exploration and exploitation with adaptive variation for evolutionary multi-objective optimization, European Journal of Operational Research, 197, 701, 10.1016/j.ejor.2008.07.025

Hasan, 2009, Memetic algorithms for solving job-shop scheduling problems, Memetic Computing Journal, 1, 69, 10.1007/s12293-008-0004-5

Lim, 2008, Hybrid ant colony algorithms for path planning in sparse graphs, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 12, 981

Tan, 2007, Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation, European Journal of Operational Research, 177, 813, 10.1016/j.ejor.2005.12.029

Abbass, 2002, An evolutionary artificial neural networks approach for breast cancer diagnosis, Artificial Intelligence in Medicine, 25, 265, 10.1016/S0933-3657(02)00028-3

Ong, 2006, Max–min surrogate-assisted evolutionary algorithm for robust design, IEEE Transactions on Evolutionary Computation, 10, 392, 10.1109/TEVC.2005.859464

Lim, 2006, Inverse multi-objective robust evolutionary design, Genetic Programming and Evolvable Machines, 7, 383, 10.1007/s10710-006-9013-7

Tang, 2006, Parallel memetic algorithm with selective local search for large scale quadratic assignment problems, International Journal of Innovative Computing, Information and Control, 2, 1399

Hart, 2004, Memetic evolutionary algorithms, 3

Ong, 2010, Memetic computation-past, present and future, IEEE Computational Intelligence Magazine, 5, 24, 10.1109/MCI.2010.936309

Neri, 2012, vol. 379

P. Surry, N. Radcliffe, Inoculation to initialise evolutionary search, in: T. Fogarty (Ed.), Evolutionary Computing: AISB Workshop, in: Lecture Notes in Computer Science, No. 1143, Springer-Verlag, 1996, pp. 269–285.

Moscato, 2003, A gentle introduction to memetic algorithms, 105

Rechenberg, 1973

Schwefel, 1984, Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of natural evolution, Annals of Operations Research, 1, 165, 10.1007/BF01876146

Bäck, 1996

Bäck, 1991, Adaptive search by evolutionary algorithms, No. 64, 17

Whitley, 1987, Using reproductive evaluation to improve genetic search and heuristic discovery, 108

Y. Davidor, O. Ben-Kiki, The interplay among the genetic algorithm operators: Information theory tools used in a holistic way, in: [231], 1992, pp. 75–84.

Cobb, 1993, Genetic algorithms for tracking changing environments, 529

Burke, 1996, A memetic algorithm for university exam timetabling, vol. 1153, 241

Burke, 1999, A memetic algorithm to schedule planned grid maintenance, 12

França, 2005, Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups, Computers and Industrial Engineering, 48, 491, 10.1016/j.cie.2003.11.004

França, 2001, A memetic algorithm for the total tardiness single machine scheduling problem, European Journal of Operational Research, 132, 224, 10.1016/S0377-2217(00)00140-5

Papadimitriou, 1982

Brady, 1985, Optimization strategies gleaned from biological evolution, Nature, 317, 804, 10.1038/317804a0

Grefenstette, 1987, Incorporating problem specific knowledge into genetic algorithms, 42

Jog, 1989, The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem, 110

K. Mathias, D. Whitley, Genetic operators, the fitness landscape and the traveling salesman problem, in: [231], 1992, pp. 219–228.

Freisleben, 1996, A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems, 616

B. Freisleben, P. Merz, New genetic local search operators for the traveling salesman problem, in: [234], 1996, pp. 890–900.

Merz, 1997, Genetic local search for the TSP: New results, 159

P. Merz, T. Fischer, A memetic algorithm for large traveling salesman problem instances, in: 7th Metaheuristics International Conference, MIC’2007, 2007.

P. Merz, On the performance of memetic algorithms in combinatorial optimization, in: Second Workshop on Memetic Algorithms (WOMA II), Genetic and Evolutionary Computation Conference, GECCO 2001, Morgan Kaufmann, 2001, pp. 297–345.

Merz, 2002, A comparison of memetic recombination operators for the traveling salesman problem, 472

Merz, 2004, Advanced fitness landscape analysis and the performance of memetic algorithms, Evolutionary Computation, 12, 303, 10.1162/1063656041774956

Merz, 2001, Memetic algorithms for the traveling salesman problem, Complex Systems, 13, 297

Merz, 1997, A genetic local search approach to the quadratic assignment problem, 465

Merz, 2000, Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Transactions on Evolutionary Computation, 4, 337, 10.1109/4235.887234

Merz, 1998, Memetic algorithms and the fitness landscape of the graph Bi-partitioning Problem, vol. 1498, 765

Merz, 2000, Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning, Evolutionary Computation, 8, 61, 10.1162/106365600568103

Wolf, 2007, A hybrid method for solving large-scale supply chain problems, vol. 4446, 219

Fischer, 2007, A memetic algorithm for the optimal communication spanning tree problem, vol. 4771, 170

Glover, 1997

W.E. Hart, Adaptive global optimization with local search, Ph.D. Thesis, University of California, San Diego, 1994.

M.W.S. Land, Evolutionary algorithms with local search for combinatorial optimization, Ph.D. Thesis, University of California, San Diego, 1998.

Merz, 1999, Fitness landscapes and memetic algorithm design, 245

N. Krasnogor, Studies in the theory and design space of memetic algorithms, Ph.D. Thesis, University of West England, 2002.

Jones, 1996, One operator, one landscape, Technical Reports #95-02-025

Krasnogor, 2008, Memetic algorithms: the polynomial local search complexity theory perspective, Journal of Mathematical Modelling and Algorithms, 7, 3, 10.1007/s10852-007-9070-9

Sudholt, 2008, Memetic algorithms with variable-depth search to overcome local optima, 787

Houck, 1997, Empirical investigation of the benefits of partial lamarckianism, Evolutionary Computation, 5, 31, 10.1162/evco.1997.5.1.31

D. Molina, F. Herrera, M. Lozano, Adaptive local search parameters for real-coded memetic algorithms, in: [227], 2005, pp. 888–895.

Q.H. Nguyen, Y.-S. Ong, N. Krasnogor, A study on the design issues of memetic algorithm, in: [228], 2007, pp. 2390–2397.

Bambha, 2004, Systematic integration of parameterized local search into evolutionary algorithms, IEEE Transactions on Evolutionary Computation, 8, 137, 10.1109/TEVC.2004.823471

Molina, 2010, Memetic algorithms for continuous optimization based on local search chains, Evolutionary Computation, 18, 1, 10.1162/evco.2010.18.1.18102

Mühlenbein, 1991, The parallel genetic algorithm as function optimizer, 271

Glover, 2000, Fundamentals of scatter search and path relinking, Control and Cybernetics, 39, 653

Eshelman, 1991, The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination, 265, 10.1016/B978-0-08-050684-5.50020-3

Lozano, 2004, Real-coded memetic algorithms with crossover hill-climbing, Evolutionary Computation, 12, 273, 10.1162/1063656041774983

G. Seront, H. Bersini, A new GA-local search hybrid for continuous optimization based on multi-level single linkage clustering, in: [235], 2000, pp. 90–95.

Jones, 1995, Crossover, macromutation, and population-based search, 73

Cotta, 1999, Optimal discrete recombination: hybridising evolution strategies with the A∗ algorithm, vol. 1607, 58

Cotta, 2003, Embedding branch and bound within evolutionary algorithms, Applied Intelligence, 18, 137, 10.1023/A:1021934325079

Lozano, 2010, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report, Computers & Operations Research, 37, 481, 10.1016/j.cor.2009.02.010

Delvecchio, 2006, A fast evolutionary-deterministic algorithm to study multimodal current fields under safety level constraints, COMPEL: International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 25, 599, 10.1108/03321640610666754

B.Y. Qu, P.N. Suganthan, J.J. Liang, Differential evolution with neighborhood mutation for multimodal optimization, IEEE Transactions on Evolutionary Computation (2012) (in press).

Wang, 2011, Self-adaptive learning based particle swarm optimization, Information Sciences, 181, 4515, 10.1016/j.ins.2010.07.013

Das, 2011, Real-parameter evolutionary multimodal optimization: A survey of the state-of-the-art, Swarm and Evolutionary Computation, 1, 71, 10.1016/j.swevo.2011.05.005

Marchiori, 2000, An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling, 367

A.V. Kononova, K.J. Hughes, M. Pourkashanian, D.B. Ingham, Fitness diversity based adaptive memetic algorithm for solving inverse problems of chemical kinetics, in: [228], 2007, pp. 2366–2373.

A.V. Kononova, D.B. Ingham, M. Pourkashanian, 2008, Simple scheduled memetic algorithm for inverse problems in higher dimensions: application to chemical kinetics, in: [229], pp. 3906–3913.

Noman, 2005, Enhancing differential evolution performance with local search for high dimensional function optimization, 967

Noman, 2008, Accelerating differential evolution using an adaptive local search, IEEE Transactions on Evolutionary Computation, 12, 107, 10.1109/TEVC.2007.895272

A. Zamuda, J. Brest, B. Bošković, V. Žumer, High-dimensional real-parameter optimization using self-adaptive differential evolution algorithm with population size reduction, in: [229], 2008, pp. 2032–2039.

Brest, 2007, Performance comparison of self-adaptive and adaptive differential evolution algorithms, Soft Computing, 11, 617, 10.1007/s00500-006-0124-0

Brest, 2006, Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems, IEEE Transactions on Evolutionary Computation, 10, 646, 10.1109/TEVC.2006.872133

Brest, 2008, Population size reduction for the differential evolution algorithm, Applied Intelligence, 29, 228, 10.1007/s10489-007-0091-x

Neri, 2009, Scale factor local search in differential evolution, Memetic Computing, 1, 153, 10.1007/s12293-009-0008-9

Caponio, 2010, Differential evolution with scale factor local search for large scale problems, vol. 2, 297

Brest, 2011, Self-adaptive differential evolution algorithm using population size reduction and three strategies, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 15, 2157

Zhao, 2011, Self-adaptive differential evolution with multi-trajectory search for large-scale optimization, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 15, 2175

Qin, 2009, Differential evolution algorithm with strategy adaptation for global numerical optimization, IEEE Transactions on Evolutionary Computation, 13, 398, 10.1109/TEVC.2008.927706

Tseng, 2008, Multiple trajectory search for large scale global optimization, Proceedings of the IEEE Congress on Evolutionary Computation., 3052

Weber, 2010, Scale factor inheritance mechanism in distributed differential evolution, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 14, 1187

Weber, 2011, Shuffle or update parallel differential evolution for large-scale optimization, Soft Computing—A Fusion of Foundations, Methodologies and Applications, 15, 2089

S. Handoko, C. Kwoh, Y. Ong, M. Lim, A study on constrained ma using ga and sqp: analytical vs. finite-difference gradients, in: [229], 2008, pp. 4031–4038.

Deb, 2000, An efficient constraint handling method for genetic algorithms, Computer Methods in Applied Mechanics and Engineering, 186, 311, 10.1016/S0045-7825(99)00389-8

Kelner, 2008, A hybrid optimization technique coupling an evolutionary and a local search algorithm, Journal of Computational and Applied Mathematics, 215, 448, 10.1016/j.cam.2006.03.048

H. Singh, T. Ray, W. Smith, Performance of infeasibility empowered memetic algorithm for CEC 2010 constrained optimization problems, in: [230], 2010, pp. 1–8.

Ray, 2009, Infeasibility driven evolutionary algorithm for constrained optimization, 145

X. Li, X.-M. Liang, A hybrid adaptive evolutionary algorithm for constrained optimization, in: Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing, vol. 2, 26–28 2007, pp. 338–341.

Barkat Ullah, 2009, AMA: A new approach for solving constrained real-valued optimization problems, Soft Computing, 13, 741, 10.1007/s00500-008-0349-1

Barkat Ullah, 2009, An agent-based memetic algorithm (AMA) for nonlinear optimization with equality constraints, 70

B. Liu, H. Ma, X. Zhang, Y. Zhou, 2007, A memetic co-evolutionary differential evolution algorithm for constrained optimization, in: [228], pp. 2996–3002.

Berretta, 2004, A memetic algorithm for a multistage capacitated lot-sizing problem, International Journal of Production Economics, 87, 67, 10.1016/S0925-5273(03)00093-8

Boudia, 2009, A memetic algorithm with dynamic population management for an integrated production–distribution problem, European Journal of Operational Research, 195, 703, 10.1016/j.ejor.2007.07.034

Gallardo, 2009, Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms, Journal of Artificial Intelligence Research, 35, 533, 10.1613/jair.2770

Park, 1998, A hybrid genetic algorithm/dynamic programming approach to optimal long-term generation expansion planning, International Journal of Electrical Power & Energy Systems, 20, 295, 10.1016/S0142-0615(97)00070-7

Gallardo, 2007, On the hybridization of memetic algorithms with branch-and-bound techniques, IEEE Transactions on Systems, Man, and Cybernetics, Part B, 37, 77, 10.1109/TSMCB.2006.883266

Ray, 2007, Genetic algorithm for solving a gas lift optimization problem, Journal of Petroleum Science and Engineering, 59, 84, 10.1016/j.petrol.2007.03.004

Prins, 2004, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, 31, 1985, 10.1016/S0305-0548(03)00158-8

Prins, 2009, Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence, 22, 916, 10.1016/j.engappai.2008.10.006

Fallahi, 2008, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Computers & Operations Research, 35, 1725, 10.1016/j.cor.2006.10.006

Ngueveu, 2010, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers & Operations Research, 37, 1877, 10.1016/j.cor.2009.06.014

K. Hasan, R. Sarker, D. Essam, Evolutionary scheduling with rescheduling option for sudden machine breakdowns, in: [230], 2010, pp. 1913–1920.

Hasan, 2009, Memetic algorithms for solving job-shop scheduling problems, Memetic Computing, 1, 69, 10.1007/s12293-008-0004-5

Marinakis, 2010, A hybrid genetic—particle swarm optimization algorithm for the vehicle routing problem, Expert Systems with Applications, 37, 1446, 10.1016/j.eswa.2009.06.085

Mendoza, 2010, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Computers & Operations Research, 37, 1886, 10.1016/j.cor.2009.06.015

Coello Coello, 2002

Deb, 2001

K. Deb, S. Agrawal, A. Pratab, T. Meyarivan, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, in: [233], 2000, pp. 849–858.

Knowles, 2000, M-PAES: a memetic algorithm for multiobjective optimization, 325

Knowles, 2000, Approximating the nondominated front using the pareto archived evolution strategy, Evolutionary Computation, 8, 149, 10.1162/106365600568167

Angel, 2004, A dynasearch neighborhood for the bicriteria traveling salesman problem, vol. 535, 153

Basseur, 2006, Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem, 4OR: A Quarterly Journal of Operations Research, 4, 255, 10.1007/s10288-006-0002-8

Paquete, 2004, Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study, vol. 535, 177

Lust, 2010, Speed-up techniques for solving large-scale biobjective TSP, Computers and Operations Research, 37, 521, 10.1016/j.cor.2009.01.005

Caponio, 2009, Integrating cross-dominance adaptation in multi-objective memetic algorithms, vol. 171, 325

Ishibuchi, 2003, Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling, IEEE Transactions on Evolutionary Computation, 7, 204, 10.1109/TEVC.2003.810752

Fonseca, 1995, An overview of evolutionary algorithms in multiobjective optimisation, Evolutionary Computation, 3, 1, 10.1162/evco.1995.3.1.1

Ulungu, 1999, MOSA method: a tool for solving multiobjective combinatorial optimization problems, Journal of Multi-Criteria Decision Analysis, 8, 221, 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O

Zhang, 2008, RM-MEDA: a regularity model based multiobjective estimation of distribution algorithm, IEEE Transactions on Evolutionary Computation, 12, 41, 10.1109/TEVC.2007.894202

Czyzżak, 1998, Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimisation, Journal of Multi-Criteria Decision Analysis, 7, 34, 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6

Hansen, 2000, Tabu search for multiobjective combinatorial optimization: TAMOCO, Control and Cybernetics, 29, 799

Hajela, 1992, Genetic search strategies in multicriterion optimal design, Structural Optimization, 4, 99, 10.1007/BF01759923

Serafini, 1992, Simulated annealing for multiple objective optimization problems, Tenth International Conference on Multiple Criteria Decision Making, 1, 87

Ishibuchi, 1998, Multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Transactions on Systems, Man and Cybernetics—Part C: Applications and Reviews, 28, 392, 10.1109/5326.704576

Jaszkiewicz, 2002, Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research, 137, 50, 10.1016/S0377-2217(01)00104-7

Jaszkiewicz, 2002, On the performance of multiple objective genetic local search on the 0/1 knapsack problem, a comparative experiment, IEEE Transactions on Evolutionary Computation, 6, 402, 10.1109/TEVC.2002.802873

Jin, 2005, Evolutionary optimization in uncertain environments-a survey, IEEE Transactions on Evolutionary Computation, 9, 303, 10.1109/TEVC.2005.846356

Giannakoglou, 2002, Design of optimal aerodynamic shapes using stochastic optimization methods and computational intelligence, International Review Journal Progress in Aerospace Sciences, 38, 43, 10.1016/S0376-0421(01)00019-7

M.K. Karakasis, K.C. Giannakoglou, On the use of surrogate evaluation models in multi-objective evolutionary algorithms, in: Proceedings of the European Conference on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2004, 2004.

M. Sefrioui, J. Périaux, A hierarchical genetic algorithm using multiple models for optimization, in: [233], 2000, pp. 879–888.

Karakasis, 2007, Hierarchical distributed evolutionary algorithms in shape optimization, International Journal of Numerical Methods in Fluids, 53, 455, 10.1002/fld.1288

Jin, 2002, A framework for evolutionary optimization with approximate fitness functions, IEEE Transactions on Evolutionary Computation, 6, 481, 10.1109/TEVC.2002.800884

Gaspar-Cunha, 2005, A multi-objective evolutionary algorithm using neural networks to approximate fitness evaluations, International Journal of Computers, Systems and Signals, 6, 18

Booker, 1999, A rigorous framework for optimization of expensive functions by surrogates, Structural Optimization, 17, 1, 10.1007/BF01197708

Conn, 1997, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, 79, 397, 10.1007/BF02614326

Rodríguez, 1998, Trust region augmented Lagrangian methods for sequential response surface approximation and optimization, ASME Journal of Mechanical Design, 120, 58, 10.1115/1.2826677

Ong, 2003, Evolutionary optimization of computationally expensive problems via surrogate modeling, AIAA Journal, 41, 687, 10.2514/2.1999

Ong, 2004, Surrogate-assisted evolutionary optimization frameworks for high-fidelity engineering design problems, 307

Tenne, 2007, A memetic algorithm using a trust-region derivative-free optimization with quadratic modelling for optimization of expensive and noisy black-box functions, vol. 51, 389

Tenne, 2008, A versatile surrogate-assisted memetic algorithm for optimization of computationally expensive functions and its engineering applications, vol. 92, 43

Zhou, 2007, Memetic algorithms using multi-surrogates for computationally expensive optimization problems, Journal of Soft Computing, 11, 957, 10.1007/s00500-006-0145-8

Ong, 2006, Curse and blessing of uncertainty in evolutionary algorithm using approximation, 2928

Lim, 2010, Generalizing surrogate-assisted evolutionary computation, IEEE Transactions on Evolutionary Computation, 14, 329, 10.1109/TEVC.2009.2027359

Tenne, 2009, A model-assisted memetic algorithm for expensive optimization problems, No. 193, 133

Tenne, 2009, A framework for memetic optimization using variable global and local surrogate models, Journal of Soft Computing, 13

K. Tagawa, M. Masuoka, M. Tsukamoto, Robust optimum design of saw filters with the taguchi method and a memetic algorithm, in: [227], 2005, pp. 2146–2153.

Shyr, 2009, Robust control design for aircraft controllers via memetic algorithms, International Journal of Innovative Computing, Information and Control, 5, 3133

Ong, 2006, Max–min surrogate-assisted evolutionary algorithm for robust aerodynamic design, IEEE Transactions on Evolutionary Computation, 10, 392, 10.1109/TEVC.2005.859464

Neri, 2008, Surrogate assisted local search on PMSM drive design, COMPEL: International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 27, 573, 10.1108/03321640810861043

Ono, 2009, A memetic algorithm for robust optimal solution search-hybridization of multi-objective genetic algorithm and quasi–newton method, International Journal of Innovative Computing, Information and Control, 5, 5011

Ono, 2009, Robust optimization using multi-objective particle swarm optimization, Artificial Life and Robotics, 14, 10.1007/s10015-009-0647-4

Song, 2009, Multiobjective memetic algorithm and its application in robust airfoil shape optimization, vol. 171, 389

Lim, 2007, Single/Multi-objective inverse robust evolutionary design methodology in the presence of uncertainty, vol. 51, 437

Goh, 2007, Evolving the tradeoffs between pareto-optimality and robustness in multi-objective evolutionary algorithms, vol. 51, 457

Burke, 2010, A multi-objective approach for robust airline scheduling, Computers and Operations Research, 37, 822, 10.1016/j.cor.2009.03.026

Sörensen, 2009, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, Journal of Mathematical Modelling and Algorithm, 8, 387, 10.1007/s10852-009-9113-5

Yao, 1997, A new evolutionary systems for evolving artificial neural networks, IEEE Transactions on Neural Networks, 8, 694, 10.1109/72.572107

Kim, 2007, A hybrid genetic algorithm and bacterial foraging approach for global optimization and robust tuning of PID controller with disturbance rejection, 171

Mininno, 2010, A memetic differential evolution approach in noisy optimization, Journal of Memetic Computing, 2, 111, 10.1007/s12293-009-0029-4

T. Bärecke, M. Detyniecki, Memetic algorithms for inexact graph matching, in: [228], 2007, pp. 4238–4245.

Ozcan, 1998, Steady state memetic algorithm for partial shape matching, vol. 1447, 527

Créput, 2008, The memetic self-organizing map approach to the vehicle routing problem, Journal of Soft Computing, 12, 1125, 10.1007/s00500-008-0281-4

F. Neri, N. Kotilainen, M. Vapa, An adaptive global-local memetic algorithm to discover resources in p2p networks, in: EvoWorkshops. 2007, pp. 61–70.

Neri, 2008, A memetic-neural approach to discover resources in P2P networks, vol. 153/2008, 113

Neri, 2007, Hierarchical evolutionary algorithms and noise compensation via adaptation, 345

F. Vavak, K.A. Jukes, T.C. Fogarty, A genetic algorithm with variable range of local search for tracking changing environments, in: [234], 196, pp. 376–385.

Vavak, 1997, Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search, 719

Vavak, 1998, Performance of a genetic algorithm with variable local search range relative to frequency of the environmental changes, 602

Wang, 2010, A particle swarm optimization based memetic algorithm for dynamic optimization problems, Natural Computing, 3, 703, 10.1007/s11047-009-9176-2

I. Moser, T. Hendtlass, A simple and efficient multi-component algorithm for solving dynamic function optimisation problems, in: [228], 2007, pp. 252–259.

Boettcher, 1999, Extremal optimization: methods derived from co-evolution, 825

Moser, 2009, A Hooke–Jeeves based memetic algorithm for solving dynamic optimisation problems, vol. 5572, 301

Moser, 2010, Dynamic function optimisation with hybridised extremal dynamics, Journal of Memetic Computing, 2, 137, 10.1007/s12293-009-0027-6

Egea, 2009, Dynamic optimization of nonlinear processes with an enhanced scatter search method, Journal of Industrial Chemical Engineering Research, 48, 4388, 10.1021/ie801717t

Koo, 2010, A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment, Journal of Soft Computing, 2, 87

Wang, 2009, A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems, Journal of Soft Computing, 13, 763, 10.1007/s00500-008-0347-3

Ong, 2006, Classification of adaptive memetic algorithms: a comparative study, IEEE Transactions On Systems, Man and Cybernetics—Part B, 36, 141, 10.1109/TSMCB.2005.856143

Burke, 2003, A tabu search hyperheuristic for timetabling and rostering, Journal of Heuristics, 9, 451, 10.1023/B:HEUR.0000012446.94732.b6

Cowling, 2000, A hyperheuristic approach to scheduling a sales summit, vol. 2079, 176

G. Kendall, P. Cowling, E. Soubeiga, Choice function and random hyperheuristics, in: Proceedings of the Fourth Asia-Pacific Conference on Simulated Evolution and Learning, 2002, pp. 667–671.

P. Korošec, J. Šilc, B. Filipič, The differential ant-stigmergy algorithm, Information Sciences (2011) (in press).

Le, 2009, Lamarckian memetic algorithms: local optimum and connectivity structure analysis, Memetic Computing Journal, 1, 175, 10.1007/s12293-009-0016-9

Krasnogor, 2005, A tutorial for competent memetic algorithms: model, taxonomy, and design issues, IEEE Transactions on Evolutionary Computation, 9, 474, 10.1109/TEVC.2005.850260

Smith, 2007, Coevolving memetic algorithms: a review and progress report, IEEE Transactions on Systems, Man, and Cybernetics, Part B, 37, 6, 10.1109/TSMCB.2006.883273

Yu, 2010, Ensemble of niching algorithms, Information Sciences, 180, 2815, 10.1016/j.ins.2010.04.008

Caponio, 2009, Super-fit control adaptation in memetic differential evolution frameworks, Soft Computing-A Fusion of Foundations, Methodologies and Applications, 13, 811

F. Neri, V. Tirronen, T. Kärkkäinen, T. Rossi, Fitness diversity based adaptation in multimeme algorithms: A comparative study, in: [228], 2007, pp. 2374–2381.

Chakhlevitch, 2008, Hyperheuristics: recent developments, vol. 136, 3

Cowling, 2001, A hyperheuristic approach to schedule a sales submit, vol. 2079, 176

Gong, 2010, Baldwinian learning in clonal selection algorithm for optimization, Information Sciences, 180, 1218, 10.1016/j.ins.2009.12.007

Yuan, 2010, A hybrid genetic algorithm with the baldwin effect, Information Sciences, 180, 640, 10.1016/j.ins.2009.11.015

Mallipeddi, 2011, Differential evolution algorithm with ensemble of parameters and mutation strategies, Applied Soft Computing, 11, 1679, 10.1016/j.asoc.2010.04.024

Mallipeddi, 2010, Ensemble strategies with adaptive evolutionary programming, Information Sciences, 180, 1571, 10.1016/j.ins.2010.01.007

N. Krasnogor, B. Blackburne, E. Burke, J. Hirst, Multimeme algorithms for proteine structure prediction, in: [232], 2002, pp. 769–778.

N. Krasnogor, Coevolution of genes and memes in memetic algorithms, in: Wu, A. (Ed.), Proceedings of the 1999 Genetic and Evolutionary Computation Conference Workshop Program, 1999.

N. Krasnogor, J. Smith, A memetic algorithm with self-adaptive local search: TSP as a case study, in: [235], 2000, pp. 987–994.

Krasnogor, 2001, Emergence of profitable search strategies based on a simple inheritance mechanism, 432

J. Smith, Co-evolution of memetic algorithms: Initial investigations, in: [232], 2002, pp. 537–548.

Smith, 2003, Protein structure prediction with co-evolving memetic algorithms, 2346

Smith, 2005, The co-evolution of memetic algorithms for protein structure prediction, vol. 166, 105

Krasnogor, 2004, Self-generating metaheuristics in bioinformatics: the protein structure comparison case, Genetic Programming and Evolvable Machines, 5, 181, 10.1023/B:GENP.0000023687.41210.d7

Krasnogor, 2004, A study on the use of self-generation in memetic algorithms, Natural Computing, 3, 53, 10.1023/B:NACO.0000023419.83147.67

Nelder, 1965, A simplex method for function optimization, Computation Journal, 7, 308, 10.1093/comjnl/7.4.308

Rosenbrock, 1960, An automatic method for findong the greatest or least value of a function, The Computer Journal, 3, 175, 10.1093/comjnl/3.3.175

Meuth, 2009, A proposition on memes and meta-memes in computing for higher-order learning, Memetic Computing Journal, 1, 85, 10.1007/s12293-009-0011-1

2005

2007

2008

2010

1992

Merelo Guervós, 2002, vol. 2439

2000, vol. 1917

1996, vol. 1141

2000