Evaluating the ε-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions

Evolutionary Computation

Volumn 13, Issue 4, 2005, Pages 501-525

  Deb, Kalyanmoy ^a   Mohan, Manikanth ^b   Mishra, Shikhar ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b Palappallil House   (India)

^c UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

dominance; Computational effort; Convergence measure; Evolutionary algorithms; Genetic algorithms; Hyper volume metric; Multi objective optimization; Pareto optimal solutions; Sparsity measure

Indexed keywords

ALGORITHM; ARTICLE; COMPARATIVE STUDY; COMPUTER SIMULATION; EVOLUTION; THEORETICAL MODEL; TIME;

ALGORITHMS; COMPUTER SIMULATION; EVOLUTION; MODELS, THEORETICAL; TIME FACTORS;

EID: 33745454026     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/106365605774666895     Document Type: Article

References (24)

1. Coello, C. A. C., VanVeldhuizen, D. A., and Lament, G. (2002). Evolutionary Algorithms for Solving Multi-Objective Problems, Boston, MA: Kluwer Academic Publishers.
2. Corne, D., Knowles, J., and Gates, M. (2000). The Pareto envelope-based selection algorithm for multiobjective optimization. In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature VI (PPSN-VI), pages 839-848.
3. Deb, K. (1999). Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evolutionary Computation Journal, 7(3):205-230.
4. Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. Chichester, UK: Wiley.
5. Deb, K. and Agrawal, R. B. (1995). Simulated binary crossover for continuous search space. Complex Systems, 9(2):115-148.
6. Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2002a). A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197.
7. Deb, K. and Goyal, M. (1996). A combined genetic adaptive search (GeneAS) for engineering design. Computer Science and Informatics, 26(4):30-45.
8. Deb, K. and Jain, S. (2002). Running performance metrics for evolutionary multiobjective optimization. In Proceedings of the Fourth Asia-Pacific Conference on Simulated Evolution and Learning (SEAL-02), pages 13-20.
9. Deb, K., Mohan, M., and Mishra, S. (2003). Towards a quick computation of well-spread pareto-optimal solutions. In Proceedings of the Second Evolutionary Multi-Criterion Optimization (EMO-03) Conference (LNCS 2632), pages 222-236.
10. Deb, K., Thiele, L., Laumanns, M., and Zitzler, E. (2002b). Scalable multi-objective optimization test problems. In Proceedings of the Congress on Evolutionary Computation (CEC-2002), pages 825-830.
11. Farhang-Mehr, A. and Azarm, S. (2002). Diversity assessment of pareto-optimal solution sets: An entropy approach. In Proceedings of the World Congress on Computational Intelligence, pages 723-728.
12. Goldberg, D. E. and Deb, K. (1991). A comparison of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms 1 (FOGA-1), pages 69-93.
13. Hansen, M. P. and Jaskiewicz, A. (1998). Evaluating the quality of approximations to the non-dominated set. Technical Report IMM-REP-1998-7, Lyngby: Institute of Mathematical Modelling, Technical University of Denmark.
14. Khare, V., Yao, X., and Deb, K. (2003). Performance scaling of multi-objective evolutionary algorithms. In Proceedings of the Second Evolutionary Multi-Criterion Optimization (EMO-03) Conference (LNCS 2632), pages 376-390.
15. Knowles, J. D. and Corne, D. (2002). One metrics for comparing nondominated sets. In Congress on Evolutionary Computation (CEC-2002), pages 711-716. Piscataway, NJ: IEEE Press.
16. Knowles, J. D. and Corne, D. W. (2000). Approximating the non-dominated front using the Pareto archived evolution strategy. Evolutionary Computation Journal, 8(2):149-172.
17. Laumanns, M., Thiele, L., Deb, K., and Zitzler, E. (2002). Combining convergence and diversity in evolutionary multi-objective optimization. Evolutionary Computation, 10(3):263-282.
18. Schott, J. R. (1995). Fault tolerant design using single and multi-criteria genetic algorithms. Master's thesis, Department of Aeronautics and Astronautics, Mas-sachusetts Institute of Technology.
19. Srinivas, N. and Deb, K. (1994). Multi-objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation Journal, 2(3):221-248.
20. Zitzler, E., Deb, K., and Thiele, L. (2000). Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation Journal, 8(2):125-148.
21. Zitzler, E., Deb, K., Thiele, L., Coello, C. A. C., and Corne, D. (2001a). Proceedings of the First Evolutionary Multi-Criterion Optimization (EMO-01) Conference (Lecture Notes in Computer Science (LNCS) 1993). Heidelberg: Springer.
22. Zitzler, E., Laumanns, M., and Thiele, L. (2001b). SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In Giannakoglou, K. C., Tsahalis, D. T., Périaux, J., Papailiou, K. D., and Fogarty, T., editors, Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, pages 95-100, Athens, Greece. International Center for Numerical Methods in Engineering (Cmine).
23. Zitzler, E. and Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271.
24. Ziztler, E., Thiele, L., Laumanns, M., Fonseca, C. M., and Fonseca, V. G. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation, 7(2):117-132.