Abstract
Evolutionary Algorithms are recognized to be efficient to deal with Multi-objective Optimization Problems(MOPs) which are difficult to be solved with traditional methods. Here a new Multi-objective Optimization Evolutionary Algorithm named DGPS which is compound with Geometrical Pareto Selection Method (GPS), Weighted Sum Method (WSM) and Dynamical Evolutionary Algorithm (DEA) is proposed. Some famous benchmark functions are carried out to test this algorithm’s performance and the numerical experiments show that this algorithm runs much faster than SPEA2, NSGAII, HPMOEA and can obtain finer approximate Pareto fronts which include thousands of well-distributed points.
Chapter PDF
Similar content being viewed by others
Keywords
References
Schaffer, J.: Some Experiments in Machine Learning Using Vector Evaluated Genetic Algorithms. PhD thesis, Vanderbilt University (1984)
Schaffer, J.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms, pp. 93–100 (1985)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
Laumanns, M., Zitzler, E., Thiele, L.: On the effects of archiving, elitism, and density based selection in evolutionary multi-objective optimization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 181–196. Springer, Heidelberg (2001)
Knowles, J., Corne, D.: Properties of an adaptive archiving algorithm for storing nondominated vectors. IEEE Transactions on Evolutionary Computation 7(2), 100–116 (2003)
Knowles, J.D., Corne, D.W., Fleischer, M.: Bounded archiving using the lebesgue measure. In: The 2003 Congress on Evolutionary Computation, CEC ’03, vol. 4, pp. 2490–2497 (2003)
Corne, D., Knowles, J.: Some multiobjective optimizers are better than others. In: 2003 Congress on Evolutionary Computation, CEC ’03, vol. 4, pp. 2506–2512 (2003)
Li, Y., Zou, X., Kang, L., Michalewicz, Z.: A new dynamical evolutionary algorithm based on statistical mechanics. Journal of Computer Science and Technology 18(3), 361–368 (2003)
Zou, X.: Research On Theory of Dynamical Evolutionary Algorithm and their Applications. PhD thesis, Wuhan University (2003)
Zou, X.F., Kang, L.S.: Fast annealing genetic algorithm for multi-objective optimization problems. International Journal of Computer Mathematics 82(8), 931–940 (2005)
Zheng, B., Li, Y., Peng, S.: GPS: A geometric comparison-based pareto selection method. In: Kang, L., Cai, Z., Yan, X. (eds.) Progress in Intelligence Computation and Applications, International Symposium on Intelligent Computation and its Application, ISICA 2005, Wuhan,China, vol. 1, pp. 558–562 (2005)
Zheng, B.: Researches on Evolutionary Optimization. PhD thesis, Wuhan University (2006)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Bleuler, S., Laumanns, M., Thiele, L., Zitzler, E.: PISA – A platform and programming language independent interface for search algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 494–508. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zheng, B., Hu, T. (2007). A Novel Multi-objective Evolutionary Algorithm. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72590-9_156
Download citation
DOI: https://doi.org/10.1007/978-3-540-72590-9_156
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72589-3
Online ISBN: 978-3-540-72590-9
eBook Packages: Computer ScienceComputer Science (R0)