메뉴 건너뛰기




Volumn 410, Issue 26, 2009, Pages 2511-2528

The impact of parametrization in memetic evolutionary algorithms

Author keywords

Evolutionary algorithms; Hybridization; Memetic algorithms; Parametrization; Runtime analysis

Indexed keywords

COMPUTATIONAL EFFORTS; COMPUTATIONAL RESOURCES; CONCRETE DESIGNS; DYNAMIC BEHAVIORS; EMPIRICAL EVIDENCES; EVOLUTIONARY SEARCHES; FIXED FREQUENCIES; FIXED NUMBERS; FUNCTION CLASS; GENETIC OPERATORS; HIGH PROBABILITIES; HYBRID META-HEURISTICS; HYBRIDIZATION; LOCAL SEARCHES; MEMETIC; MEMETIC ALGORITHMS; MEMETIC EVOLUTIONARY ALGORITHMS; PARAMETER SETTINGS; PARAMETRIZATION; POLYNOMIAL-TIME; PSEUDO-BOOLEAN OPTIMIZATIONS; RUNTIME ANALYSIS; SEARCH PROCESS; SIGNIFICANT IMPACTS; THEORETICAL FOUNDATIONS; WORKING PRINCIPLES;

EID: 67349234115     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.03.003     Document Type: Article
Times cited : (69)

References (42)
  • 2
    • 0002345223 scopus 로고    scopus 로고
    • Memetic algorithms: A short introduction
    • Corne D., Dorigo M., and Glover F. (Eds), McGraw-Hill
    • Moscato P. Memetic algorithms: A short introduction. In: Corne D., Dorigo M., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill 219-234
    • (1999) New Ideas in Optimization , pp. 219-234
    • Moscato, P.1
  • 3
    • 33645283722 scopus 로고    scopus 로고
    • Hart W.E., Krasnogor N., and Smith J.E. (Eds), Springer
    • In: Hart W.E., Krasnogor N., and Smith J.E. (Eds). Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing vol. 166 (2004), Springer
    • (2004) Studies in Fuzziness and Soft Computing , vol.166
  • 4
    • 27344452492 scopus 로고    scopus 로고
    • A tutorial for competent memetic algorithms: Model, taxonomy, and design issues
    • Krasnogor N., and Smith J. A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation 9 5 (2005) 474-488
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.5 , pp. 474-488
    • Krasnogor, N.1    Smith, J.2
  • 5
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Mladenović N., and Hansen P. Variable neighborhood search. Computers & OR 24 11 (1997) 1097-1100
    • (1997) Computers & OR , vol.24 , Issue.11 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 8
    • 4344659329 scopus 로고    scopus 로고
    • A study on the use of "self-generation" in memetic algorithms
    • Krasnogor N., and Gustafson S. A study on the use of "self-generation" in memetic algorithms. Natural Computing 3 1 (2004) 53-76
    • (2004) Natural Computing , vol.3 , Issue.1 , pp. 53-76
    • Krasnogor, N.1    Gustafson, S.2
  • 10
    • 0041825193 scopus 로고    scopus 로고
    • Locally-adaptive and memetic evolutionary pattern search algorithms
    • Hart W.E. Locally-adaptive and memetic evolutionary pattern search algorithms. Evolutionary Computation 11 1 (2003) 29-51
    • (2003) Evolutionary Computation , vol.11 , Issue.1 , pp. 29-51
    • Hart, W.E.1
  • 11
    • 35548991809 scopus 로고    scopus 로고
    • An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
    • Aickelin U., Burke E.~K., and Li J. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. Journal of the Operational Research Society 58 (2007) 1574-1585
    • (2007) Journal of the Operational Research Society , vol.58 , pp. 1574-1585
    • Aickelin, U.1    Burke, E.K.2    Li, J.3
  • 13
    • 3042751892 scopus 로고    scopus 로고
    • Ant colony optimisation and local search for bin packing and cutting stock problems
    • Levine J., and Ducatelle F. Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55 7 (2004) 705-716
    • (2004) Journal of the Operational Research Society , vol.55 , Issue.7 , pp. 705-716
    • Levine, J.1    Ducatelle, F.2
  • 14
    • 56449093950 scopus 로고    scopus 로고
    • Rigorous analyses for the combination of ant colony optimization and local search
    • Proceedings of the Sixth International Conference on Ant Colony Optimization and Swarm Intelligence. ANTS 2008, Springer
    • Neumann F., Sudholt D., and Witt C. Rigorous analyses for the combination of ant colony optimization and local search. Proceedings of the Sixth International Conference on Ant Colony Optimization and Swarm Intelligence. ANTS 2008. LNCS vol. 5217 (2008), Springer 132-143
    • (2008) LNCS , vol.5217 , pp. 132-143
    • Neumann, F.1    Sudholt, D.2    Witt, C.3
  • 16
    • 24944532917 scopus 로고    scopus 로고
    • Efficient and experimental meta-heuristics for MAX-SAT problems
    • Workshop on Experimental/Efficient Algorithms
    • Boughaci D., and Drias H. Efficient and experimental meta-heuristics for MAX-SAT problems. Workshop on Experimental/Efficient Algorithms. LNCS vol. 3503 (2005) 501-512
    • (2005) LNCS , vol.3503 , pp. 501-512
    • Boughaci, D.1    Drias, H.2
  • 17
    • 26444587185 scopus 로고    scopus 로고
    • Memetic algorithms with partial Lamarckism for the shortest common supersequence problem
    • Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach
    • Cotta C. Memetic algorithms with partial Lamarckism for the shortest common supersequence problem. Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. LNCS vol. 3562 (2005) 84-91
    • (2005) LNCS , vol.3562 , pp. 84-91
    • Cotta, C.1
  • 18
    • 76149104670 scopus 로고    scopus 로고
    • Designing efficient genetic and evolutionary algorithm hybrids
    • Hart W.E., Krasnogor N., and Smith J.E. (Eds), Springer
    • Sinha A., Chen Y., and Goldberg D.E. Designing efficient genetic and evolutionary algorithm hybrids. In: Hart W.E., Krasnogor N., and Smith J.E. (Eds). Recent Advances in Memetic Algorithms (2004), Springer 259-288
    • (2004) Recent Advances in Memetic Algorithms , pp. 259-288
    • Sinha, A.1    Chen, Y.2    Goldberg, D.E.3
  • 20
    • 34547427292 scopus 로고    scopus 로고
    • Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results
    • Oliveto P.S., He J., and Yao X. Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing 4 3 (2007) 281-293
    • (2007) International Journal of Automation and Computing , vol.4 , Issue.3 , pp. 281-293
    • Oliveto, P.S.1    He, J.2    Yao, X.3
  • 21
    • 34248139794 scopus 로고    scopus 로고
    • Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
    • Neumann F., and Wegener I. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378 1 (2007) 32-40
    • (2007) Theoretical Computer Science , vol.378 , Issue.1 , pp. 32-40
    • Neumann, F.1    Wegener, I.2
  • 22
    • 24144442813 scopus 로고    scopus 로고
    • Worst-case and average-case approximations by simple randomized search heuristics
    • Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. STACS'05, Springer
    • Witt C. Worst-case and average-case approximations by simple randomized search heuristics. Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. STACS'05. LNCS vol. 3404 (2005), Springer 44-56
    • (2005) LNCS , vol.3404 , pp. 44-56
    • Witt, C.1
  • 23
    • 56549097175 scopus 로고    scopus 로고
    • Approximating minimum multicuts by evolutionary multi-objective algorithms
    • Parallel Problem Solving from Nature. PPSN X, Springer
    • Neumann F., and Reichel J. Approximating minimum multicuts by evolutionary multi-objective algorithms. Parallel Problem Solving from Nature. PPSN X. LNCS vol. 5199 (2008), Springer 72-81
    • (2008) LNCS , vol.5199 , pp. 72-81
    • Neumann, F.1    Reichel, J.2
  • 24
    • 33746024384 scopus 로고    scopus 로고
    • Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
    • Kumar R., and Banerjee N. Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem. Theoretical Computer Science 358 1 (2006) 104-120
    • (2006) Theoretical Computer Science , vol.358 , Issue.1 , pp. 104-120
    • Kumar, R.1    Banerjee, N.2
  • 26
    • 77249172238 scopus 로고    scopus 로고
    • Local search in evolutionary algorithms: The impact of the local search frequency
    • Proceedings of the 17th International Symposium on Algorithms and Computation. ISAAC'06, Springer
    • Sudholt D. Local search in evolutionary algorithms: The impact of the local search frequency. Proceedings of the 17th International Symposium on Algorithms and Computation. ISAAC'06. LNCS vol. 4288 (2006), Springer 359-368
    • (2006) LNCS , vol.4288 , pp. 359-368
    • Sudholt, D.1
  • 27
    • 57349143339 scopus 로고    scopus 로고
    • Memetic algorithms with variable-depth search to overcome local optima
    • GECCO 2008, ACM Press
    • Sudholt D. Memetic algorithms with variable-depth search to overcome local optima. Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2008 (2008), ACM Press 787-794
    • (2008) Proceedings of the Genetic and Evolutionary Computation Conference , pp. 787-794
    • Sudholt, D.1
  • 30
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
    • Ishibuchi H., Yoshida T., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7 2 (2003) 204-223
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , Issue.2 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 31
    • 4544339487 scopus 로고    scopus 로고
    • Advanced fitness landscape analysis and the performance of memetic algorithms
    • Merz P. Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation 12 3 (2004) 303-326
    • (2004) Evolutionary Computation , vol.12 , Issue.3 , pp. 303-326
    • Merz, P.1
  • 33
    • 66549111942 scopus 로고    scopus 로고
    • Editorial introduction
    • Memetic Algorithms (special issue)
    • Hart W., Krasnogor N., and Smith J.E. Editorial introduction. Memetic Algorithms. Evolutionary Computation 12 3 (2004) v-vi (special issue)
    • (2004) Evolutionary Computation , vol.12 , Issue.3
    • Hart, W.1    Krasnogor, N.2    Smith, J.E.3
  • 34
    • 20944431820 scopus 로고    scopus 로고
    • A no-free-lunch theorem for non-uniform distributions of target functions
    • Igel C., and Toussaint M. A no-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms 3 4 (2004) 313-322
    • (2004) Journal of Mathematical Modelling and Algorithms , vol.3 , Issue.4 , pp. 313-322
    • Igel, C.1    Toussaint, M.2
  • 35
    • 0037174190 scopus 로고    scopus 로고
    • Optimization with randomized search heuristics-the (A)NFL theorem, realistic scenarios, and difficult functions
    • Droste S., Jansen T., and Wegener I. Optimization with randomized search heuristics-the (A)NFL theorem, realistic scenarios, and difficult functions. Theoretical Computer Science 287 1 (2002) 131-144
    • (2002) Theoretical Computer Science , vol.287 , Issue.1 , pp. 131-144
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 36
    • 33646077908 scopus 로고    scopus 로고
    • Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions
    • Witt C. Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions. Evolutionary Computation 14 1 (2006) 65-86
    • (2006) Evolutionary Computation , vol.14 , Issue.1 , pp. 65-86
    • Witt, C.1
  • 37
    • 27644579712 scopus 로고    scopus 로고
    • On the choice of the offspring population size in evolutionary algorithms
    • Jansen T., De~Jong K.~A., and Wegener I. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation 13 (2005) 413-440
    • (2005) Evolutionary Computation , vol.13 , pp. 413-440
    • Jansen, T.1    De Jong, K.A.2    Wegener, I.3
  • 40
    • 39449106942 scopus 로고    scopus 로고
    • Memetic algorithms: The polynomial local search complexity theory perspective
    • Krasnogor N., and Smith J. Memetic algorithms: The polynomial local search complexity theory perspective. Journal of Mathematical Modelling and Algorithms 7 (2008) 3-24
    • (2008) Journal of Mathematical Modelling and Algorithms , vol.7 , pp. 3-24
    • Krasnogor, N.1    Smith, J.2
  • 41
    • 0000066236 scopus 로고    scopus 로고
    • How mutation and selection solve long-path problems in polynomial expected time
    • Rudolph G. How mutation and selection solve long-path problems in polynomial expected time. Evolutionary Computation 4 2 (1997) 195-205
    • (1997) Evolutionary Computation , vol.4 , Issue.2 , pp. 195-205
    • Rudolph, G.1
  • 42
    • 67349131016 scopus 로고    scopus 로고
    • C. Scheideler, Probabilistic methods for coordination problems, HNI-Verlagsschriftenreihe 78, University of Paderborn, Habilitation thesis, 2000. Available at: http://www14.in.tum.de/personen/scheideler/index.html.en
    • C. Scheideler, Probabilistic methods for coordination problems, HNI-Verlagsschriftenreihe 78, University of Paderborn, Habilitation thesis, 2000. Available at: http://www14.in.tum.de/personen/scheideler/index.html.en


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.