Faster S-metric calculation by considering dominated hypervolume as Klee's measure problem

Proceedings of the 2nd IASTED International Conference on Computational Intelligence, CI 2006

Volumn , Issue , 2006, Pages 231-236

  Beume, Nicola ^a   Rudolph, Günter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Efficient algorithms; Evolutionary algorithms; Hypervolume; Klee's measure problem; Multi objective optimization; Performance assessment; S metric

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INTELLIGENT CONTROL; MULTIOBJECTIVE OPTIMIZATION; TELECOMMUNICATION NETWORKS;

EFFICIENT ALGORITHMS; HYPERVOLUME; KLEE'S MEASURE PROBLEM; PERFORMANCE ASSESSMENT; S-METRIC;

EVOLUTIONARY ALGORITHMS;

EID: 55749086397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester, UK (2001)
2. Zitzler, E., Thiele, L.: Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study. In Eiben, A.E., et al., eds.: 5th Int'l Conf. on Parallel Problem Solving from Nature (PPSN V). LNCS 1498, Springer, Berlin (1998) 292-301
3. Fleischer, M.: The Measure of Pareto Optima. Applications to Multi-objective Metaheuristics. In Fonseca, C.M., et al., eds.: Evolutionary Multi-Criterion Optimization, 2nd Int'l Conf. (EMO 2003). LNCS 2632, Springer, Berlin (2003) 519-533
4. Zitzler, E.: Hypervolume Metric Calculation. Computer Engineering and Networks Laboratory (TIK), Zürich (2001) ftp://ftp.tik.ee.ethz.ch/pub/ people/zitzler/hypervol.c.
5. Knowles, J.D.: Local Search and Hybrid Evolutionary Algorithms for Pareto Optimization. PhD thesis, University of Reading, Reading, UK (2002)
6. While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Transactions on Evolutionary Computation 10(1) (2006) 29-38
7. While, L., Bradstreet, L., Barone, L., Hingston, P.: Heuristics for Optimising the Calculation of Hypervolume for Multi-objective Optimisation Problems. In McKay, B., et al., eds.: Congress on Evolutionary Computation (CEC 2005). Volume 3., IEEE Press, Piscataway NJ (2005) 2225-2232
8. i] be computed in less than O(n log n) steps? In: American Mathematical Monthly. Volume 84. (1977) 284-285
9. Beume, N.: Hypervolumen-basierte Selektion in einem evolutionären Algorithmus zur Mehrzieloptimierung. Diploma thesis (March, 2006), University of Dortmund (2006)
10. Overmars, M.H., Yap, C.K.: New upper bounds in Klee's measure problem. SIAM Journal on Computing 20(6) (1991) 1034-1045
11. Edelsbrunner, H., Overmars, M.H.: Batched dynamic solutions to decomposable searching problems. Journal of Algorithms 6(4) (1985) 515-542
12. i]. In: Communications of the ACM. Volume 21. (1978) 540-544
13. Emmerich, M., Beume, N., Naujoks, B.: An EMO algorithm using the hypervolume measure as selection criterion. In Coello Coello, C.A., et al., eds.: Evolutionary Multi-Criterion Optimization: 3rd Int'l Conf. (EMO 2005), Springer, Berlin (2005) 62-76
14. Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In Yao, X., et al., eds.: 8th Int'l Conf. on Parallel Problem Solving from Nature (PPSN VIII), UK, Springer, Berlin (2004) 832-842
15. Huband, S., Hingston, P., While, L., Barone, L.: An evolution strategy with probabilistic mutation for multi-objective optimisation. In: Congress on Evolutionary Computation (CEC 2003). Volume 4., IEEE Press, Piscataway NJ (2003) 2284-2291