메뉴 건너뛰기




Volumn 3242, Issue , 2004, Pages 292-301

Exploring the evolutionary details of a feasible-infeasible two-population GA

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINED OPTIMIZATION; GENETIC ALGORITHMS;

EID: 35048842730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_30     Document Type: Article
Times cited : (7)

References (28)
  • 2
    • 76249128410 scopus 로고    scopus 로고
    • Back, T., Fogel, D., Michalewicz, Z., eds. Institute of Physics Publishing, Bristol, UK
    • Back, T., Fogel, D., Michalewicz, Z., eds.: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol, UK (2000)
    • (2000) Advanced Algorithms and Operators
  • 3
    • 0009077633 scopus 로고    scopus 로고
    • A survey of constraint handling techniques used with evolutionary algorithms
    • Laboratorio Nacional de Informática Avanzada, Veracruz, México
    • Coello, C.A.: A survey of constraint handling techniques used with evolutionary algorithms. Technical report Lania-RI-99-04, Laboratorio Nacional de Informática Avanzada, Veracruz, México (1999) http://www.lania.mx/~ccoello/constraint.html.
    • (1999) Technical Report Lania-RI-99-04
    • Coello, C.A.1
  • 4
    • 0003602231 scopus 로고    scopus 로고
    • Back, T., Fogel, D., Michalewicz, Z., eds.: Institute of Physics Publishing
    • Back, T., Fogel, D., Michalewicz, Z., eds.: Handbook of Evolutionary Computation. Institute of Physics Publishing, http://www.iop.org/Books/CIL/HEC/ index.htm (1997-2003)
    • (1997) Handbook of Evolutionary Computation
  • 7
    • 35248835248 scopus 로고    scopus 로고
    • Exploring a two-population genetic algorithm
    • Cantú-Paz, E., et al., eds.: Genetic and Evolutionary Computation (GECCO 2003). Berlin, Germany, Springer
    • Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-population genetic algorithm. In Cantú-Paz, E., et al., eds.: Genetic and Evolutionary Computation (GECCO 2003). LNCS 2723, Berlin, Germany, Springer (2003) 1148-1159
    • (2003) LNCS 2723 , pp. 1148-1159
    • Kimbrough, S.O.1    Lu, M.2    Wood, D.H.3    Wu, D.J.4
  • 8
    • 4344701893 scopus 로고    scopus 로고
    • Exploring a financial product model with a two-population genetic algorithm
    • Piscataway, NJ, IEEE Neural Network Society, IEEE Service Center June 19-23
    • Kimbrough, S.O., Lu, M., Safavi, S.M.: Exploring a financial product model with a two-population genetic algorithm. In: Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ, IEEE Neural Network Society, IEEE Service Center (June 19-23, 2004) 855-862
    • (2004) Proceedings of the 2004 Congress on Evolutionary Computation , pp. 855-862
    • Kimbrough, S.O.1    Lu, M.2    Safavi, S.M.3
  • 11
    • 0031966353 scopus 로고    scopus 로고
    • Evolution of competitive fitness in experimental populations of E. coli: What makes one genotype a better competitor than another?
    • Lenski, R.E., Mongold, J.A., Sniegowski, P.D., Travisano, M., Vasi, F., Gerrish, P.J., Schmidt, T.M.: Evolution of competitive fitness in experimental populations of E. coli: what makes one genotype a better competitor than another? Antonie van Leeuwenhoek 73 (1998) 35-47
    • (1998) Antonie Van Leeuwenhoek , vol.73 , pp. 35-47
    • Lenski, R.E.1    Mongold, J.A.2    Sniegowski, P.D.3    Travisano, M.4    Vasi, F.5    Gerrish, P.J.6    Schmidt, T.M.7
  • 12
    • 0035913336 scopus 로고    scopus 로고
    • Evolution of digital organisms at high mutation rate leads to survival of the flattest
    • Wilke, C.O., Wang, J., Ofria, C., Lenski, R.E., Adami, C.: Evolution of digital organisms at high mutation rate leads to survival of the flattest. Nature 412 (2003) 331-333
    • (2003) Nature , vol.412 , pp. 331-333
    • Wilke, C.O.1    Wang, J.2    Ofria, C.3    Lenski, R.E.4    Adami, C.5
  • 14
    • 4344673077 scopus 로고    scopus 로고
    • Exploring the evolutionary details of a feasible-infeasible two-population genetic algorithm in the context of constrained optimization
    • University of Pennsylvania, Department of Operations and Information Management, Philadelphia, PA
    • Kimbrough, S.O., Lu, M., Wood, D.H.: Exploring the evolutionary details of a feasible-infeasible two-population genetic algorithm in the context of constrained optimization. Working paper, University of Pennsylvania, Department of Operations and Information Management, Philadelphia, PA (2004) Posted at http://opim-sun.wharton.upenn.edu/~sok/comprats/.
    • (2004) Working Paper
    • Kimbrough, S.O.1    Lu, M.2    Wood, D.H.3
  • 18
    • 21144469862 scopus 로고
    • On post-evaluation analysis: Candle-lighting and surrogate models
    • May-June
    • Kimbrough, S.O., Oliver, J.R., Pritchett, C.W.: On post-evaluation analysis: Candle-lighting and surrogate models. Interfaces 23 (May-June 1993) 17-28
    • (1993) Interfaces , vol.23 , pp. 17-28
    • Kimbrough, S.O.1    Oliver, J.R.2    Pritchett, C.W.3
  • 20
    • 0015680502 scopus 로고
    • A heuristic search procedure for estimating a global solution of nonconvex programming problems
    • Hesse, R.: A heuristic search procedure for estimating a global solution of nonconvex programming problems. Operations Research 21 (1973) 1267
    • (1973) Operations Research , vol.21 , pp. 1267
    • Hesse, R.1
  • 23
    • 2042491162 scopus 로고
    • Improved genetic algorithm for minimum thickness composite laminate design
    • Le Riche, R., Haftka, R.T.: Improved genetic algorithm for minimum thickness composite laminate design. Composites Engineering 3 (1995) 121-139
    • (1995) Composites Engineering , vol.3 , pp. 121-139
    • Le Riche, R.1    Haftka, R.T.2
  • 26
    • 0030735527 scopus 로고    scopus 로고
    • A genetic algorithm for the generalized assignment problem
    • Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24 (1997) 17-23
    • (1997) Computers and Operations Research , vol.24 , pp. 17-23
    • Chu, P.C.1    Beasley, J.E.2
  • 27
    • 0032090794 scopus 로고    scopus 로고
    • A genetic algorithm for the multidimensional knapsack problem
    • Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4 (1998) 63-86
    • (1998) Journal of Heuristics , vol.4 , pp. 63-86
    • Chu, P.C.1    Beasley, J.E.2
  • 28
    • 4344648099 scopus 로고    scopus 로고
    • Grouping-based evolutionary algorithm: Seeking balance between feasible and infeasible individuals of contrained optimization problems
    • Piscataway, NJ, IEEE Neural Network Society, IEEE Service Center June 19-23
    • Yuchi, M., Kim, J.H.: Grouping-based evolutionary algorithm: Seeking balance between feasible and infeasible individuals of contrained optimization problems. In: Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ, IEEE Neural Network Society, IEEE Service Center (June 19-23, 2004) 280-7
    • (2004) Proceedings of the 2004 Congress on Evolutionary Computation , pp. 280-287
    • Yuchi, M.1    Kim, J.H.2


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