Skip to main content

A Novel Hybrid Evolutionary Algorithm for Solving Multi-Objective Optimization Problems

  • Conference paper
Intelligent Computing Technology (ICIC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7389))

Included in the following conference series:

  • 2587 Accesses

Abstract

This paper proposed a novel hybrid evolutionary algorithm for solving the multi-objective optimization problems (MOPs). The algorithm uses the idea of simulated annealing to combine co-evolution with genetic evolution, set several model sets according to the principle of “model student”, and employs ε-dominant and crowding distance sorting to search the excellent population. In the co-evolution model, cluster analysis is used to classify the model set, and the estimation of distribution algorithm (EDA) is used to establish the probabilistic model for each class. The individuals are generated by sampling through the probabilistic model; in genetic evolution model, populations evolve based on the model set. This algorithm takes full advantage of the global and local search abilities, and makes comparison with the classical algorithm NSGA-II, the experimental results show that our algorithm for solving the multi-objective problem has better convergence and distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Horn, J., Nafpliotis, N., Goldberg, D.E.: A Niched Pareto Genetic Algorithm for Multi-objective Optimization. In: Michalewicz, Z. (ed.) Proc. lst IEEE Conf. on Evolutionary Computation, pp. 82–87. IEEE Service Center, Piscataway (1994)

    Google Scholar 

  2. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)

    MATH  Google Scholar 

  3. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Zurich, Switzerland, ETH Zurich, pp. 1–21 (2001)

    Google Scholar 

  4. Deb, K., Pratap, A., Agarwal, S., et al.: A Fast and Elitist Multi-objective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  5. Laumanns, M., Thiele, L., Deb, K., et al.: Combining Convergence and Diversity in Evolutionary Multi-objective Optimization. Evolutionary Computation 10(3), 263–282 (2002)

    Article  Google Scholar 

  6. Geng, H., Zhang, M., Huang, L., Wang, X.: Infeasible Elitists and Stochastic Ranking Selection in Constrained Evolutionary Multi-objective Optimization. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 336–344. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Geng, H.T., Song, Q.X., Wu, T.T., Liu, J.F.: A Multi-objective Constrained Optimization Algorithm Based on Infeasible Individual Stochastic Binary-Modification. In: Proceedings of 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, pp. 89–93. IEEE, Shanghai (2009)

    Chapter  Google Scholar 

  8. Potter, M.A., De Jong, K.A.: A Cooperative Coevolutionary Approach to Function Optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Zhou, S.D., Sun, Z.Q.: Estimation of Distribution Algorithms. AAS 33(2), 113–124 (2007) (in Chinese)

    MathSciNet  MATH  Google Scholar 

  10. Duda, O., Hart, E., Stork, G.: Pattern Classification, 2nd edn., pp. 450–452. John Wiley & Sons, Inc., USA (2001)

    MATH  Google Scholar 

  11. Deb, K., Thiele, L., Laumanns, M., et al.: Scalable Multi-objective Optimization Test Problems. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 825–830. IEEE Service Center, Piscataway (2002)

    Google Scholar 

  12. Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2), 173–195 (2000)

    Article  Google Scholar 

  13. Coello, C.A.C.: A Comprehensive Survey of Evolutionary-based Multi-objective Optimization Techniques. Knowledge and Information Systems 1(3), 269–308 (1999)

    Google Scholar 

  14. Schott, J.R.: Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. Master’s thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geng, H., Zhu, H., Xing, R., Wu, T. (2012). A Novel Hybrid Evolutionary Algorithm for Solving Multi-Objective Optimization Problems. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31588-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31587-9

  • Online ISBN: 978-3-642-31588-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics