Maximising hypervolume for selection in multi-objective evolutionary algorithms

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 1744-1751

  Bradstreet, Lucas ^a,b   Barone, Luigi ^a,b   While, Lyndon ^a,b  

^a IEEE   (Australia)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHIVING PROCESS; GREEDY ALGORITHMS; HYPERVOLUME; LOCAL SEARCH ALGORITHMS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL METHODS; COST EFFECTIVENESS; DATA REDUCTION; EVOLUTIONARY ALGORITHMS; SET THEORY;

MULTIOBJECTIVE OPTIMIZATION;

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

References (10)

1. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the Strength Pareto Evolutionary Algorithm," in EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, K. Giannakoglou, D. Tsahalis, J. Periaux, P. Papailou, and T. Fogarty, Eds., Athens, Greece, 2002, pp. 95-100.
2. K. Deb, S. Agrawal, A. Pratab, and T. Meyarivan, "A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization.: NSGA-II," Indian. Institute of Technology, Kanpur, India, KanGAL report 200001, 2000.
3. E. Zitzler, "Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications," Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999.
4. M. Laumanns, E. Zitzler, and L. Thiele, "A Unified Model for Multi-Objective Evolutionary Algorithms with Elitism," in 2000 Congress on Evolutionary Computation, vol. 1. Piscataway, New Jersey: IEEE Service Center, July 2000, pp. 46-53.
5. J. D. Knowles, D. W. Corne, and M. Fleischer, "Bounded archiving using the Lebesgue measure," in Proceedings of the IEEE Congress on Evolutionary Computation. IEEE Press, 2003, pp. 2490-2497.
6. M. Emmerich, N. Beume, and B. Naujoks, "An EMO algorithm, using the hypervolume measure as selection criterion," in Proc. Evolutionary Multi-Criterion Optimization: Third Int'l Conference (EMO 2005), ser. Lecture Notes in Computer Science, C. A. C. Coello, A. H. Aguirre, and E. Zitzler, Eds., vol. 3410. Berlin: Springer, 2005, pp. 62-76.
7. J. D. Knowles, D. W. Corne, and M. Fleischer, "Bounded Archiving using the Lebesgue Measure," in Proceedings of the 2003 Congress on Evolutionary Computation (CEC'2003), vol. 4. Canberra, Australia: IEEE Press, December 2003, pp. 2490-2497.
8. R. L. While, "A new analysis of the lebineasure algorithm for calculating hypervolume." in EMO, ser. Lecture Notes in Computer Science, C. A. C. Coello, A. H. Aguirre, and E. Zitzler, Eds., vol. 3410. Springer, 2005, pp. 326-340.
9. L. While, L. Bradstreet, L. Barone, and P. Hingston, "Heuristics for optimising the calculation of hypervolume for multi-objective optimisation problems," in Proceedings of 2005 Congress on Evolutionary Computation (CEC'2005), 2005.
10. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, "Scalable Multi-Objective Optimization Test Problems," in Congress on Evolutionary Computation (CEC'2002), vol. 1. Piscataway, New Jersey: IEEE Service Center, May 2002, pp. 825-830.