메뉴 건너뛰기




Volumn 4, Issue , 2003, Pages 2506-2512

Some multiobjective optimizers are better than others

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; EVOLUTIONARY ALGORITHMS;

EID: 84863089312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299403     Document Type: Conference Paper
Times cited : (45)

References (19)
  • 1
    • 0042815143 scopus 로고    scopus 로고
    • What can we learn from no free lunch? A first attempt lo characterize the concept of a searchable function
    • L. Spector et al eds, Morgan Kaufmann
    • Christensen, S. and Oppacher. F. (2001) What can we learn from No Free Lunch? A First Attempt lo Characterize the Concept of a Searchable Function, in L. Spector et al (eds), Proc. of GECCO 2001. Morgan Kaufmann, pp. 1219-1226.
    • (2001) Proc. of GECCO 2001 , pp. 1219-1226
    • Christensen, S.1    Oppacher, F.2
  • 2
    • 35248833039 scopus 로고    scopus 로고
    • No free lunch and free leftovers theorems for multiobjective optimization problems
    • Faro, Portugal. April 2003, Proceedings, Springer LNCS
    • Corne, D. W. and Knowles. J. D. (2003) No Free Lunch and Free Leftovers Theorems for Multiobjective Optimization Problems. Evolutionary Multi-Criterion Optimization (EMO 2003) Second International Conference. Faro, Portugal. April 2003, Proceedings, pp. 327-341, Springer LNCS.
    • (2003) Evolutionary Multi-criterion Optimization (EMO 2003) Second International Conference , pp. 327-341
    • Corne, D.W.1    Knowles, J.D.2
  • 4
    • 0002506192 scopus 로고    scopus 로고
    • Perhaps not a free lunch but at least a free appetizer
    • W. Banzhaf, J. Daida, A. E. Eiben. M. H. Garzon, V. Honavar. M. lakiela and R. E. Smith eds., Morgan Kaufmann Publishers, Inc.
    • Droste, S., Jansen, T. and Wegener. I. (1999), Perhaps Not a Free Lunch But At Least a Free Appetizer, in W. Banzhaf, J. Daida, A. E. Eiben. M. H. Garzon, V. Honavar. M. lakiela and R. E. Smith (eds.) Proc of GECCO 9). Morgan Kaufmann Publishers, Inc., pp. 833-839.
    • (1999) Proc of GECCO 9 , pp. 833-839
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 6
    • 0003688852 scopus 로고    scopus 로고
    • Evaluating the quality of approximations to the non-dominated set
    • Technical University of Denmark
    • Hansen, M. P. and Jaszkiewicz, A. (1998) Evaluating the quality of approximations to the non-dominated set, Tech. Report IMM-REP-1998-7, Technical University of Denmark.
    • (1998) Tech. Report IMM-REP-1998-7
    • Hansen, M.P.1    Jaszkiewicz, A.2
  • 8
    • 0034199912 scopus 로고    scopus 로고
    • Approximating the non-dominated front using the pareto archived evolution strategy
    • Knowles, J. D., Corne, D. W. (2000) Approximating the non-dominated front using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149-172.
    • (2000) Evolutionary Computation , vol.8 , Issue.2 , pp. 149-172
    • Knowles, J.D.1    Corne, D.W.2
  • 9
    • 77958151592 scopus 로고    scopus 로고
    • On metrics for comparing non-dominated sets
    • IEEE Service Center. Piscataway, NJ
    • Knowles, J. D. and Corne, D. W. (2002) On metrics for comparing non-dominated sets, in Proc. 2002 Congress on Evolutionary Comp., IEEE Service Center. Piscataway, NJ.
    • (2002) Proc. 2002 Congress on Evolutionary Comp.
    • Knowles, J.D.1    Corne, D.W.2
  • 11
    • 0038289586 scopus 로고    scopus 로고
    • Archiving with guaranteed convergence and diversity in multiobjective optimization
    • Morgan Kaufmann Publishers
    • Laumanns, M., Thiele, L., Deb, K., Zitzler, E. (2002) Archiving with guaranteed convergence and diversity in multiobjective optimization, in Proceedings of GECCO 2002. Morgan Kaufmann Publishers, pp. 439-447.
    • (2002) Proceedings of GECCO 2002 , pp. 439-447
    • Laumanns, M.1    Thiele, L.2    Deb, K.3    Zitzler, E.4
  • 12
    • 0036715683 scopus 로고    scopus 로고
    • Combining convergence and diversity in evolutionary multi-objective optimization
    • Laumanns, M., Thiele, L., Deb, K., Zitzler. E. (2002a) Combining Convergence and Diversity in Evolutionary Multi-Objective Optimization. Evolutionary Computation 10(3):263-282.
    • (2002) Evolutionary Computation , vol.10 , Issue.3 , pp. 263-282
    • Laumanns, M.1    Thiele, L.2    Deb, K.3    Zitzler, E.4
  • 13
    • 0001313237 scopus 로고
    • Fundamental limitations on search algorithms: Evolutionary computing in perspective
    • Radcliffe, N. J. and Surry. P. D. (1995) Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective, in Computer Science Today. pp. 275-291
    • (1995) Computer Science Today , pp. 275-291
    • Radcliffe, N.J.1    Surry, P.D.2
  • 15
    • 0003808330 scopus 로고    scopus 로고
    • PhD Thesis, Dept. of. Electrical and Computer Eng., Graduate School of Engineering, Air Force Institute of Technology, Wright-Paterson AFB, Ohio
    • Van Veldhuizen (1999) Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations, PhD Thesis, Dept. of. Electrical and Computer Eng., Graduate School of Engineering, Air Force Institute of Technology, Wright-Paterson AFB, Ohio.
    • (1999) Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations
    • Van Veldhuizen1


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