메뉴 건너뛰기




Volumn , Issue , 2012, Pages

Applying the WFG algorithm to calculate incremental hypervolumes

Author keywords

[No Author keywords available]

Indexed keywords

EXACT ALGORITHMS; HYPERVOLUME; IN-LINE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; QUEUING MECHANISM; SELECTION PROCESS;

EID: 84866846940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6256171     Document Type: Conference Paper
Times cited : (34)

References (34)
  • 3
    • 0033672286 scopus 로고    scopus 로고
    • A unified model for multi-objective evolutionary algorithms with elitism
    • R. Eberhart, Ed. IEEE
    • M. Laumanns, E. Zitzler, and L. Thiele, "A unified model for multi-objective evolutionary algorithms with elitism," in Congress on Evolutionary Computation, R. Eberhart, Ed. IEEE, 2000, pp. 46-53.
    • (2000) Congress on Evolutionary Computation , pp. 46-53
    • Laumanns, M.1    Zitzler, E.2    Thiele, L.3
  • 6
    • 24344467352 scopus 로고    scopus 로고
    • An evolution strategy with probabilistic mutation for multi-objective optimization
    • H. Abbass and B. Verma, Eds. IEEE
    • S. Huband, P. Hingston, L. While, and L. Barone, "An evolution strategy with probabilistic mutation for multi-objective optimization," in Congress on Evolutionary Computation, H. Abbass and B. Verma, Eds. IEEE, 2003, pp. 2284-2291.
    • (2003) Congress on Evolutionary Computation , pp. 2284-2291
    • Huband, S.1    Hingston, P.2    While, L.3    Barone, L.4
  • 7
    • 0037936616 scopus 로고    scopus 로고
    • Properties of an adaptive archiving algorithm for storing nondominated vectors
    • April
    • J. Knowles and D. Corne, "Properties of an adaptive archiving algorithm for storing nondominated vectors," IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 100-116, April 2003.
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , Issue.2 , pp. 100-116
    • Knowles, J.1    Corne, D.2
  • 8
    • 84901432707 scopus 로고    scopus 로고
    • Bounded archiving using the Lebesgue measure
    • H. Abbass and B. Verma, Eds. IEEE
    • J. Knowles, D. Corne, and M. Fleischer, "Bounded archiving using the Lebesgue measure," in Congress on Evolutionary Computation, H. Abbass and B. Verma, Eds. IEEE, 2003, pp. 2490-2497.
    • (2003) Congress on Evolutionary Computation , pp. 2490-2497
    • Knowles, J.1    Corne, D.2    Fleischer, M.3
  • 9
    • 35048846146 scopus 로고    scopus 로고
    • Indicator-based selection in multiobjective search
    • Parallel Problem Solving from Nature VIII, ser. X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel, Eds., Springer-Verlag
    • E. Zitzler and S. Künzli, "Indicator-based selection in multiobjective search," in Parallel Problem Solving from Nature VIII, ser. Lecture Notes on Computer Science, X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel, Eds., vol. 3242. Springer-Verlag, 2004, pp. 832-842.
    • (2004) Lecture Notes on Computer Science , vol.3242 , pp. 832-842
    • Zitzler, E.1    Künzli, S.2
  • 10
    • 24344489452 scopus 로고    scopus 로고
    • An EMO algorithm using the hypervolume measure as selection criterion
    • Evolutionary Multi-objective Optimisation, ser. C. A. Coello Coello, A. H. Aguirre, and E. Zitzler, Eds., Springer-Verlag
    • M. Emmerich, N. Beume, and B. Naujoks, "An EMO algorithm using the hypervolume measure as selection criterion," in Evolutionary Multi-objective Optimisation, ser. Lecture Notes on Computer Science, C. A. Coello Coello, A. H. Aguirre, and E. Zitzler, Eds., vol. 3410. Springer-Verlag, 2005, pp. 62-76.
    • (2005) Lecture Notes on Computer Science , vol.3410 , pp. 62-76
    • Emmerich, M.1    Beume, N.2    Naujoks, B.3
  • 13
    • 84856556950 scopus 로고    scopus 로고
    • The University of Western Australia, School of Computer Science & Software Engineering, Technical Report UWA-CSSE-09-002
    • L. Bradstreet, L. While, and L. Barone, "A new way of calculating exact exclusive hypervolumes," The University of Western Australia, School of Computer Science & Software Engineering, Technical Report UWA-CSSE-09-002, 2009.
    • (2009) A New Way of Calculating Exact Exclusive Hypervolumes
    • Bradstreet, L.1    While, L.2    Barone, L.3
  • 16
    • 0001823017 scopus 로고    scopus 로고
    • Metrics for quality assessment of a multiobjective design optimization solution set
    • J. Wu and S. Azarm, "Metrics for quality assessment of a multiobjective design optimization solution set," Journal of Mechanical Design, vol. 123, pp. 18-25, 2001.
    • (2001) Journal of Mechanical Design , vol.123 , pp. 18-25
    • Wu, J.1    Azarm, S.2
  • 17
    • 35248897594 scopus 로고    scopus 로고
    • The measure of Pareto optima: Applications to multi-objective metaheuristics
    • Evolutionary Multi-objective Optimisation, ser. C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, and L. Thiele, Eds., Springer-Verlag
    • M. Fleischer, "The measure of Pareto optima: Applications to multi-objective metaheuristics," in Evolutionary Multi-objective Optimisation, ser. Lecture Notes on Computer Science, C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, and L. Thiele, Eds., vol. 2632. Springer-Verlag, 2003, pp. 519-533.
    • (2003) Lecture Notes on Computer Science , vol.2632 , pp. 519-533
    • Fleischer, M.1
  • 19
  • 21
    • 79959471916 scopus 로고    scopus 로고
    • A faster many-objective hyper-volume algorithm using iterated incremental calculations
    • H. Ishibuchi, Ed. IEEE
    • L. Bradstreet, L. While, and L. Barone, "A faster many-objective hyper-volume algorithm using iterated incremental calculations," in Congress on Evolutionary Computation, H. Ishibuchi, Ed. IEEE, 2010, pp. 179-186.
    • (2010) Congress on Evolutionary Computation , pp. 179-186
    • Bradstreet, L.1    While, L.2    Barone, L.3
  • 22
    • 27144534854 scopus 로고    scopus 로고
    • Heuristics for optimising the calculation of hypervolume for multi-objective optimisation problems
    • B. McKay, Ed. IEEE
    • L. While, L. Bradstreet, L. Barone, and P. Hingston, "Heuristics for optimising the calculation of hypervolume for multi-objective optimisation problems," in Congress on Evolutionary Computation, B. McKay, Ed. IEEE, 2005, pp. 2225-2232.
    • (2005) Congress on Evolutionary Computation , pp. 2225-2232
    • While, L.1    Bradstreet, L.2    Barone, L.3    Hingston, P.4
  • 23
    • 55749114233 scopus 로고    scopus 로고
    • An improved dimension-sweep algorithm for the hypervolume indicator
    • C. L. P. Chen, Ed. IEEE
    • C. M. Fonseca, L. Paquete, and M. López-Ibáñez, "An improved dimension-sweep algorithm for the hypervolume indicator," in Congress on Evolutionary Computation, C. L. P. Chen, Ed. IEEE, 2006, pp. 3973-3979.
    • (2006) Congress on Evolutionary Computation , pp. 3973-3979
    • Fonseca, C.M.1    Paquete, L.2    López-Ibáñez, M.3
  • 25
    • 72249110751 scopus 로고    scopus 로고
    • S-metric calculation by considering dominated hypervolume as Klee's measure problem
    • N. Beume, "S-metric calculation by considering dominated hypervolume as Klee's measure problem," Evolutionary Computation, vol. 17, no. 4, pp. 477-492, 2009.
    • (2009) Evolutionary Computation , vol.17 , Issue.4 , pp. 477-492
    • Beume, N.1
  • 26
    • 0026406169 scopus 로고
    • New upper bounds in Klee's measure problem
    • December
    • M. H. Overmars and C.-K. Yap, "New upper bounds in Klee's measure problem," SIAM Journal on Computing, vol. 20, no. 6, pp. 1034-1045, December 1991.
    • (1991) SIAM Journal on Computing , vol.20 , Issue.6 , pp. 1034-1045
    • Overmars, M.H.1    Yap, C.-K.2
  • 27
    • 78650736508 scopus 로고    scopus 로고
    • Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
    • Evolutionary Multi-objective Optimisation, ser. M. Ehrgott, C. Fonseca, X. Gandibleux, J.-K. Hao, and M. Sevaux, Eds., Springer-Verlag
    • K. Bringmann and T. Friedrich, "Approximating the least hypervolume contributor: NP-hard in general, but fast in practice," in Evolutionary Multi-objective Optimisation, ser. Lecture Notes on Computer Science, M. Ehrgott, C. Fonseca, X. Gandibleux, J.-K. Hao, and M. Sevaux, Eds., vol. 5467. Springer-Verlag, 2009, pp. 6-20.
    • (2009) Lecture Notes on Computer Science , vol.5467 , pp. 6-20
    • Bringmann, K.1    Friedrich, T.2
  • 29
    • 79960064807 scopus 로고    scopus 로고
    • Faster hypervolume-based search using Monte Carlo sampling
    • Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, ser. M. Ehrgott, B. Naujoks, T. Stewart, and J. Wallenius, Eds., Springer-Verlag
    • J. Bader, K. Deb, and E. Zitzler, "Faster hypervolume-based search using Monte Carlo sampling," in Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, ser. Lecture Notes in Economics and Mathematical Systems, M. Ehrgott, B. Naujoks, T. Stewart, and J. Wallenius, Eds., vol. 634. Springer-Verlag, 2010, pp. 313-326.
    • (2010) Lecture Notes in Economics and Mathematical Systems , vol.634 , pp. 313-326
    • Bader, J.1    Deb, K.2    Zitzler, E.3
  • 30
    • 70449890209 scopus 로고    scopus 로고
    • Hypervolume Approximation Using Achievement Scalarizing Functions for Evolutionary Many-Objective Optimization
    • P. Haddow, Ed. IEEE
    • H. Ishibuchi, N. Tsukamoto, Y. Sakane, and Y. Nojima, "Hypervolume Approximation Using Achievement Scalarizing Functions for Evolutionary Many-Objective Optimization," in Congress on Evolutionary Computation, P. Haddow, Ed. IEEE, 2009, pp. 530-537.
    • (2009) Congress on Evolutionary Computation , pp. 530-537
    • Ishibuchi, H.1    Tsukamoto, N.2    Sakane, Y.3    Nojima, Y.4
  • 31
    • 70349104508 scopus 로고    scopus 로고
    • Theory of the Hypervolume Indicator: Optimal ì-Distributions and the Choice of the Reference Point
    • T. Jansen, I. Garibay, R. Wiegand, and A. Wu, Eds. ACM
    • A. Auger, J. Bader, D. Brockhoff, and E. Zitzler, "Theory of the Hypervolume Indicator: Optimal ì-Distributions and the Choice Of The Reference Point," in Foundations of Genetic Algorithms, T. Jansen, I. Garibay, R. Wiegand, and A. Wu, Eds. ACM, 2009, pp. 87-102.
    • (2009) Foundations of Genetic Algorithms , pp. 87-102
    • Auger, A.1    Bader, J.2    Brockhoff, D.3    Zitzler, E.4
  • 32
    • 70349108679 scopus 로고    scopus 로고
    • Don't be Greedy when Calculating Hypervolume Contributions
    • T. Jansen, I. Garibay, R. Wiegand, and A. Wu, Eds. ACM
    • K. Bringmann and T. Friedrich, "Don't be Greedy when Calculating Hypervolume Contributions," in Foundations of Genetic Algorithms, T. Jansen, I. Garibay, R. Wiegand, and A. Wu, Eds. ACM, 2009, pp. 103-112.
    • (2009) Foundations of Genetic Algorithms , pp. 103-112
    • Bringmann, K.1    Friedrich, T.2


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