Approach of constructing multi-objective Pareto optimal solutions using arena's principle

Ruan Jian Xue Bao/Journal of Software

Volumn 18, Issue 6, 2007, Pages 1287-1297

  Zheng, Jin Hua ^a   Jiang, Hao ^a   Kuang, Da ^a   Shi, Zhong Zhi ^b  

^a XIANGTAN UNIVERSITY   (China)

^b INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

Arena's principle; Multi objective evolution; Non dominated set; Pareto optimal solutions; Running efficiency

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS;

ARENA PRINCIPLE (AP); CPU TIME EFFICIENCY; DEB ALGORITHM; JENSEN ALGORITHM; MOEA; MULTIOBJECTIVE EVOLUTION; NON DOMINATED SET; PARETO OPTIMAL SOLUTIONS; RUNNING EFFICIENCY;

EVOLUTIONARY ALGORITHMS;

EID: 34447132852     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos181287     Document Type: Article

References (15)

1. Coello Coello CA, Van Veldhuizen DA, Lamont GB. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Acedemic/Plenum Publishers, 2002.
2. Coello Coello CA, Lamont GB. Applications of Multi-Objective Evolutionary Algorithms. Singapore: World Scientific, 2004.
3. Corne DW, Jerram NR, Knowles JD, Oates MJ. PESA-II: Region-Based selection in evolutionary multiobjective optimization. In: Proc. of the Genetic and Evolutionary Computation Conf. (GECCO 2001). Morgan Kaufmann Publishers, 2001. 283-290.
4. Knowles JD, Corne DW. Approximating the nondominated front using the Pareto archived evolution strategy evolutionary computation. Evolutionary Computation, 2000. 149-172.
5. Aguirre AH, Rionda SB, Coello Coello CA, Lizáraga GL, Montes EM. Handling constraints using multiobjective optimization concepts. Int'l Journal for Numerical Methods in Engineering, 2004,59(15):1989-2017.
6. Fonseca CM, Fleming PJ. An overview of evolutionary algorithms in multi-objective optimization. Evolutionary Computation, 1995,3(1):1-16.
7. Horn J, Nafpliotis N, Goldberg DE. A niched Pareto genetic algorithm for multiobjective optimization. In: Proc. of the 1st IEEE Conf. on Evolutionary Computation. Piscataway: IEEE Service Center, 1994. 82-87.
8. Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans. on Evolutionary Computation, 1999,3(4):257-271.
9. Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou K, et al., eds. Proc. of the EUROGEN 2001-Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems. 2001. 95-100.
10. Deb K, Pratap A, Agrawal S, Meyrivan T. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation, 2002,6(2):182-197.
11. Deb K, Agrawal S, Pratab A, Meyarivan T. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. KanGAL Report, 200001, Kanpur: Indian Institute of Technology, 2000.
12. Jensen MT. Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Trans. on Evolutionary Computation, 2003,7(5):503-515.
13. Zheng JH, Ling C, Shi ZZ, Xue J, Li XY. A multi-objective genetic algorithm based on quick sort. In: Tawfik AY, Goodwin SD, eds. Proc. of the 17th Canadian Conf. on Artificial Intelligence. London: Springer-Verlag, 2004. 175-186.
14. Deb K, Thiele L, Laumanns M, Zitzler E. Scalable test problems for evolutionary multiobjective optimization. In: Yao X, ed. Proc. of the 2002 Congress on Evolutionary Computation. New Jersey: IEEE Service Center, 2002. 825-830.
15. Knowles JD, Corne DW, Fleischer M. Bounded archiving using the lebesgue measure. In: Proc. of the 2003 Congress on Evolutionary Computation (CEC 2003), Vol. 4. Canberra: IEEE Press, 2003. 2490-2497.