메뉴 건너뛰기




Volumn 5866 LNAI, Issue , 2009, Pages 391-400

Classification-assisted memetic algorithms for equality-constrained optimization problems

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION PROBLEMS; EQUALITY CONSTRAINTS; EQUALITY-CONSTRAINED OPTIMIZATION; FEASIBLE SOLUTION; GLOBAL SEARCH; LOCAL REFINEMENT; MEMETIC ALGORITHMS; NOVEL STRATEGIES; OPTIMIZATION PROBLEMS; POTENTIAL REGION; SURROGATE MODEL;

EID: 78650423942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10439-8_40     Document Type: Conference Paper
Times cited : (14)

References (27)
  • 2
    • 77957572225 scopus 로고    scopus 로고
    • Feasibility structure modeling: An effective chaperone for constrained memetic algorithms
    • in press
    • Handoko, S.D., et al.: Feasibility Structure Modeling: An Effective Chaperone for Constrained Memetic Algorithms. IEEE Transactions on Evolutionary Computation (in press).
    • IEEE Transactions on Evolutionary Computation
    • Handoko, S.D.1
  • 5
    • 69949136889 scopus 로고
    • Successive linear programming in refinery logistic models
    • Presented at the
    • Baker, T.E., Ventker, R.: Successive Linear Programming in Refinery Logistic Models. Presented at the ORSA/TIMS Joint National Meeting (1980).
    • (1980) ORSA/TIMS Joint National Meeting
    • Baker, T.E.1    Ventker, R.2
  • 6
    • 0022028451 scopus 로고
    • Successive linear programming at Exxon
    • Baker, T.E., Lasdon, L.S.: Successive Linear Programming at Exxon. Management Science 31(3), 264-274 (1985).
    • (1985) Management Science , vol.31 , Issue.3 , pp. 264-274
    • Baker, T.E.1    Lasdon, L.S.2
  • 7
    • 0022145633 scopus 로고
    • An improved successive linear programming algorithm
    • Zhang, J.Z., Kim, N.H., Lasdon, L.S.: An Improved Successive Linear Programming Algorithm. Management Science 31(10), 1312-1331 (1985).
    • (1985) Management Science , vol.31 , Issue.10 , pp. 1312-1331
    • Zhang, J.Z.1    Kim, N.H.2    Lasdon, L.S.3
  • 9
    • 51649147836 scopus 로고
    • NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems
    • Schittkowski, K.: NLPQL: A FORTRAN Subroutine Solving Constrained Nonlinear Programming Problems. Annals of Operations Research 5(2), 485-500 (1986).
    • (1986) Annals of Operations Research , vol.5 , Issue.2 , pp. 485-500
    • Schittkowski, K.1
  • 13
    • 0033729054 scopus 로고    scopus 로고
    • An efficient constraint handling method for genetic algorithms
    • Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186(2-4), 311-338 (2000).
    • (2000) Computer Methods in Applied Mechanics and Engineering , vol.186 , Issue.2-4 , pp. 311-338
    • Deb, K.1
  • 14
    • 0033094194 scopus 로고    scopus 로고
    • Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
    • Koziel, S., Michalewicz, Z.: Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization. Evolutionary Computation 7(1), 19-44 (1999).
    • (1999) Evolutionary Computation , vol.7 , Issue.1 , pp. 19-44
    • Koziel, S.1    Michalewicz, Z.2
  • 17
    • 14844307657 scopus 로고    scopus 로고
    • A simple multi-membered evolution strategy to solve constrained optimization problems
    • Mezura-Montes, E., Coello, C.A.C.: A Simple Multi-Membered Evolution Strategy to Solve Constrained Optimization Problems. IEEE Transactions on Evolutionary Computation 9(1), 1-17 (2005).
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.1 , pp. 1-17
    • Mezura-Montes, E.1    Coello, C.A.C.2
  • 18
    • 0141509927 scopus 로고    scopus 로고
    • A new adaptive penalty scheme for genetic algorithms
    • Barbosa, H.J.C., Lemonge, A.C.C.: A New Adaptive Penalty Scheme for Genetic Algorithms. Information Science 156(3-4), 215-251 (2003).
    • (2003) Information Science , vol.156 , Issue.3-4 , pp. 215-251
    • Barbosa, H.J.C.1    Lemonge, A.C.C.2
  • 19
  • 20
    • 29144511552 scopus 로고    scopus 로고
    • Constraint handling in genetic algorithms using a gradient-based repair method
    • Chootinan, P., Chen, A.: Constraint Handling in Genetic Algorithms Using a Gradient-based Repair Method. Computers and Operation Research 33(8), 2263-2281 (2006).
    • (2006) Computers and Operation Research , vol.33 , Issue.8 , pp. 2263-2281
    • Chootinan, P.1    Chen, A.2
  • 21
    • 33751357869 scopus 로고    scopus 로고
    • A simple ranking and selection for constrained evolutionary optimization
    • Wang, T.-D. Li, X. Chen, S.-H. Wang, X. Abbass, H.A. Iba, H. Chen, G.-L. Yao, X. (eds.), LNCS, Springer, Heidelberg
    • Elfeky, E.Z., Sarker, R.A., Essam, D.L.: A Simple Ranking and Selection for Constrained Evolutionary Optimization. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 537-544. Springer, Heidelberg (2006).
    • (2006) SEAL 2006 , vol.4247 , pp. 537-544
    • Elfeky, E.Z.1    Sarker, R.A.2    Essam, D.L.3
  • 22
    • 34247380230 scopus 로고    scopus 로고
    • Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems
    • Tang, J., Lim, M.H., Ong, Y.S.: Diversity-Adaptive Parallel Memetic Algorithm for Solving Large Scale Combinatorial Optimization Problems. Soft Computing: A Fusion of Foundations, Methodologies, and Applications 11(9), 873-888 (2007).
    • (2007) Soft Computing: A Fusion of Foundations, Methodologies, and Applications , vol.11 , Issue.9 , pp. 873-888
    • Tang, J.1    Lim, M.H.2    Ong, Y.S.3
  • 24
    • 0004149207 scopus 로고
    • Oxford University Press, Oxford
    • Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1976).
    • (1976) The Selfish Gene
    • Dawkins, R.1


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