메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1074-1079

Continuous variable neighbourhood search algorithm based on evolutionary metaheuristic components: A scalability test

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS OPTIMIZATION PROBLEMS; CONTINUOUS VARIABLES; EVOLUTIONARY METAHEURISTIC; HIGH-DIMENSIONAL PROBLEMS; LOCAL INFORMATION; META HEURISTICS; METAHEURISTIC; SCALABILITY TEST; THREE COMPONENT; VARIABLE NEIGHBOURHOOD SEARCH;

EID: 77949505265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISDA.2009.68     Document Type: Conference Paper
Times cited : (7)

References (23)
  • 1
    • 27144539455 scopus 로고    scopus 로고
    • Performance evaluation of an advanced local search evolutionary algorithm
    • IEEE Press
    • A. Auger and N. Hansen. Performance evaluation of an advanced local search evolutionary algorithm. In Proc. of the IEEE Int. Conf. Evolutionary Computation, volume 2, pages 1777-1784. IEEE Press, 2005.
    • (2005) Proc. of the IEEE Int. Conf. Evolutionary Computation , vol.2 , pp. 1777-1784
    • Auger, A.1    Hansen, N.2
  • 2
    • 0036885602 scopus 로고    scopus 로고
    • A computationally ef-ficient evolutionary algorithm for real-parameter optimization
    • K. Deb, A. Anand, and D. Joshi. A computationally ef-ficient evolutionary algorithm for real-parameter optimization. Evol. Comput., 10(4):371-395, 2002.
    • (2002) Evol. Comput , vol.10 , Issue.4 , pp. 371-395
    • Deb, K.1    Anand, A.2    Joshi, D.3
  • 4
    • 0000308566 scopus 로고
    • Real-coded genetic algorithms and interval-schemata. In L. Whitley, editor
    • L. Eshelman and J. Schaffer. Real-coded genetic algorithms and interval-schemata. In L. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187-202. 1993.
    • (1993) Foundations of Genetic Algorithms , vol.2 , pp. 187-202
    • Eshelman, L.1    Schaffer, J.2
  • 5
    • 0034876073 scopus 로고    scopus 로고
    • A study on non-random mating and varying population size in genetic algorithms using a royal road function
    • IEEE Press
    • C. Fernandes and A. Rosa. A study on non-random mating and varying population size in genetic algorithms using a royal road function. In Proc. of the Congress on Evolutionary Computation, pages 60-66. IEEE Press, 2001.
    • (2001) Proc. of the Congress on Evolutionary Computation , pp. 60-66
    • Fernandes, C.1    Rosa, A.2
  • 7
    • 77955967245 scopus 로고    scopus 로고
    • A continuous variable neighbourhood search based on specialised EAs: Application to the noiseless BBO-benchmark 2009
    • C. García-Martínez and M. Lozano. A continuous variable neighbourhood search based on specialised EAs: Application to the noiseless BBO-benchmark 2009. In Genetic Evolutionary Computation Conf., pages 2287-2294, 2009.
    • (2009) Genetic Evolutionary Computation Conf , pp. 2287-2294
    • García-Martínez, C.1    Lozano, M.2
  • 8
    • 77955972769 scopus 로고    scopus 로고
    • A continuous variable neighbourhood search based on specialised EAs: Application to the noisy BBO-benchmark 2009 testbed
    • C. García-Martínez and M. Lozano. A continuous variable neighbourhood search based on specialised EAs: Application to the noisy BBO-benchmark 2009 testbed. In Genetic Evolutionary Computation Conf., pages 2367-2374, 2009.
    • (2009) Genetic Evolutionary Computation Conf , pp. 2367-2374
    • García-Martínez, C.1    Lozano, M.2
  • 9
    • 34848832935 scopus 로고    scopus 로고
    • Global and local real-coded genetic algorithms based on parent-centric crossover operators
    • C. García-Martínez, M. Lozano, F. Herrera, D. Molina, and A. Śanchez. Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur. J. Oper. Res., 185(3):1088-1113, 2008.
    • (2008) Eur. J. Oper. Res , vol.185 , Issue.3 , pp. 1088-1113
    • García-Martínez, C.1    Lozano, M.2    Herrera, F.3    Molina, D.4    Śanchez, A.5
  • 10
    • 33750268023 scopus 로고    scopus 로고
    • A local genetic algorithm for binary-coded problems
    • Proc. of the Int. Conf. on Parallel Problem Solving from Nature, of, Springer
    • C. García-Martínez, M. Lozano, and D. Molina. A local genetic algorithm for binary-coded problems. In Proc. of the Int. Conf. on Parallel Problem Solving from Nature, volume 4193 of LNCS, pages 192-201. Springer, 2006.
    • (2006) LNCS , vol.4193 , pp. 192-201
    • García-Martínez, C.1    Lozano, M.2    Molina, D.3
  • 11
    • 24944504251 scopus 로고    scopus 로고
    • F. Glover and G. Kochenberger, editors, Kluwer Academic Publishers
    • F. Glover and G. Kochenberger, editors. Handbook of Meta-heuristics. Kluwer Academic Publishers, 2003.
    • (2003) Handbook of Meta-heuristics
  • 12
    • 0042879997 scopus 로고    scopus 로고
    • Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)
    • N. Hansen, S. M̈uller, and P. Koumoutsakos. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput., 11(1):1-18, 2003.
    • (2003) Evol. Comput , vol.11 , Issue.1 , pp. 1-18
    • Hansen, N.1    M̈uller, S.2    Koumoutsakos, P.3
  • 13
    • 0035377566 scopus 로고    scopus 로고
    • Completely derandomized self-adaptation in evolution strategies
    • N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evol. Comput., 9(2):159-195, 2001.
    • (2001) Evol. Comput , vol.9 , Issue.2 , pp. 159-195
    • Hansen, N.1    Ostermeier, A.2
  • 14
    • 0005698377 scopus 로고    scopus 로고
    • Two-loop real-coded genetic algorithms with adaptive control of mutation step sizes
    • F. Herrera and M. Lozano. Two-loop real-coded genetic algorithms with adaptive control of mutation step sizes. App. Intell., 13(3):187-204, 2000.
    • (2000) App. Intell , vol.13 , Issue.3 , pp. 187-204
    • Herrera, F.1    Lozano, M.2
  • 15
    • 0032136585 scopus 로고    scopus 로고
    • Tackling real-coded genetic algorithms: Operators and tools for behavioral analysis
    • F. Herrera, M. Lozano, and J. Verdegay. Tackling real-coded genetic algorithms: operators and tools for behavioral analysis. Artif. Intell. Rev., 12(4):265-319, 1998.
    • (1998) Artif. Intell. Rev , vol.12 , Issue.4 , pp. 265-319
    • Herrera, F.1    Lozano, M.2    Verdegay, J.3
  • 16
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. Gelatt Jr, and M. Vecchi. Optimization by simulated annealing. Sci., 220(4598):671-680, 1983.
    • (1983) Sci , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt Jr, C.2    Vecchi, M.3
  • 17
    • 33750253049 scopus 로고    scopus 로고
    • A fast and effective method for pruning of non-dominated solutions in many-objective problems
    • Proc. of the Int. Conf. on Parallel Problem Solving from Nature
    • S. Kukkonen and K. Deb. A fast and effective method for pruning of non-dominated solutions in many-objective problems. In Proc. of the Int. Conf. on Parallel Problem Solving from Nature, LNCS, volume 4193, pages 553-562, 2006.
    • (2006) LNCS , vol.4193 , pp. 553-562
    • Kukkonen, S.1    Deb, K.2
  • 18
    • 57049095914 scopus 로고    scopus 로고
    • An evolutionary ILS-perturbation technique
    • Proc. of the Int. Workshop on Hybrid Metaheuristics
    • M. Lozano and C. García-Martínez. An evolutionary ILS-perturbation technique. In Proc. of the Int. Workshop on Hybrid Metaheuristics, LNCS, volume 5296, pages 1-15, 2008.
    • (2008) LNCS , vol.5296 , pp. 1-15
    • Lozano, M.1    García-Martínez, C.2
  • 19
    • 77949507563 scopus 로고    scopus 로고
    • Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report
    • In press
    • M. Lozano and C. García-Martínez. Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. Comput. Oper. Res., In press, 2009.
    • (2009) Comput. Oper. Res
    • Lozano, M.1    García-Martínez, C.2
  • 20
    • 4544245255 scopus 로고    scopus 로고
    • Realcoded memetic algorithms with crossover hill-climbing
    • M. Lozano, F. Herrera, N. Krasnogor, and D. Molina. Realcoded memetic algorithms with crossover hill-climbing. Evol. Comput., 12(3):273-302, 2004.
    • (2004) Evol. Comput , vol.12 , Issue.3 , pp. 273-302
    • Lozano, M.1    Herrera, F.2    Krasnogor, N.3    Molina, D.4
  • 21
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • N. Mladenovic and P. Hansen. Variable neighborhood search. Comput. Oper. Res., 24:1097-1100, 1997.
    • (1997) Comput. Oper. Res , vol.24 , pp. 1097-1100
    • Mladenovic, N.1    Hansen, P.2
  • 22
    • 0036723306 scopus 로고    scopus 로고
    • A taxonomy of hybrid metaheuristics
    • E. Talbi. A taxonomy of hybrid metaheuristics. J. Heuristics, 8(5):541-564, 2002.
    • (2002) J. Heuristics , vol.8 , Issue.5 , pp. 541-564
    • Talbi, E.1
  • 23
    • 77949492948 scopus 로고    scopus 로고
    • K. Tang, X. Yao, P. Suganthan, C. MacNish, Y. Chen, C. Chen, and Z. Yang. Benchmark functions for the CEC'2008 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation And Applications Laboratory, USTC, China, 2007.
    • K. Tang, X. Yao, P. Suganthan, C. MacNish, Y. Chen, C. Chen, and Z. Yang. Benchmark functions for the CEC'2008 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation And Applications Laboratory, USTC, China, 2007.


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