메뉴 건너뛰기




Volumn 3103, Issue , 2004, Pages 11-23

Dynamic uniform scaling for multiobjective genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS;

EID: 34548074857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_2     Document Type: Article
Times cited : (10)

References (16)
  • 6
    • 84947926042 scopus 로고    scopus 로고
    • A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II
    • NSGA-II code available at KanGAL website
    • Deb, K., Pratap, A., Moitra, S.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Parallel Problem Solving from Nature - PPSN VI (2000) 849-858 NSGA-II code available at KanGAL website: 'http://www.iitk.ac.in/kangal/'.
    • (2000) Parallel Problem Solving from Nature - PPSN , vol.6 , pp. 849-858
    • Deb, K.1    Pratap, A.2    Moitra, S.3
  • 7
    • 0000300253 scopus 로고    scopus 로고
    • Pareto genetic algorithm for aerodynamic design using the Navier-Stokes equations
    • Quagliarella, D., Périaux, J., Poloni, C., Winter, G., eds.: John Wiley & Sons, Ltd., Trieste, Italy
    • Obayashi, S.: Pareto genetic algorithm for aerodynamic design using the Navier-Stokes equations. In Quagliarella, D., Périaux, J., Poloni, C., Winter, G., eds.: Genetic Algorithms and Evolution Strategies in Engineering and Computer Science. John Wiley & Sons, Ltd., Trieste, Italy (1997) 245-266
    • (1997) Genetic Algorithms and Evolution Strategies in Engineering and Computer Science , pp. 245-266
    • Obayashi, S.1
  • 12
    • 0033185714 scopus 로고    scopus 로고
    • Multi-objective genetic algorithms: Problem difficulties and construction of test problems
    • Deb, K.: Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evolutionary Computation 7 (1999) 205-230
    • (1999) Evolutionary Computation , vol.7 , pp. 205-230
    • Deb, K.1
  • 13
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach
    • Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3 (1999) 257-271
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 14
    • 27144529259 scopus 로고    scopus 로고
    • Technical Report 2002001, Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, India
    • Deb, K., Jain, S.: Multi-speed gearbox design using multi-objective evolutionary algorithms. Technical Report 2002001, Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, India (2002)
    • (2002) Multi-speed Gearbox Design Using Multi-objective Evolutionary Algorithms
    • Deb, K.1    Jain, S.2
  • 15
    • 3042657369 scopus 로고    scopus 로고
    • Technical Report 2002007, Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, India
    • Deb, K.: Unveiling innovative design principles by means of multiple conflicting objectives. Technical Report 2002007, Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, India (2002)
    • (2002) Unveiling Innovative Design Principles by Means of Multiple Conflicting Objectives
    • Deb, K.1
  • 16
    • 22944491997 scopus 로고    scopus 로고
    • The Design of Innovation: Lessons from and for Competent Genetic Algorithms
    • Kluwer Academic Publishers, Norwell, MA
    • Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers, Norwell, MA (2002)
    • (2002) Genetic Algorithms and Evolutionary Computation
    • Goldberg, D.E.1


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