Skip to main content

An Effective Method for MOGAs Initialization to Solve the Multi-Objective Next Release Problem

  • Conference paper
Nature-Inspired Computation and Machine Learning (MICAI 2014)

Abstract

In this work we evaluate the usefulness of a Path Relinking based method for generating the initial population of Multi-Objective Genetic Algorithms and evaluate its performance on the Multi-Objective Next Release Problem.The performance of the method was evaluated for the algorithms MoCell and NSGA-II, and the experimental results have shown that it is consistently superior to the random initialization method and the extreme solutions method, considering the convergence speed and the quality of the Pareto front, that was measured using the Spread and Hypervolume indexes.

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. Multi-objective next release problem instances, https://mega.co.nz/#!OoJXCbZI!R5cCl4r4KGGTI2f-yXjacBiSQphdeAv6SrOgvv6a-1Q (updated: March 25, 2014)

    Google Scholar 

  2. Azarm, S., Wu, J.: Metrics for Quality Assessment of a Multiobjective Design Optimization Solution Set. Journal of Mechanical Design 123(1), 18–25 (2001)

    Article  Google Scholar 

  3. Bagnall, A., Rayward-Smith, V., Whittley, I.: The next release problem. Information and Software Technology 43(14), 883–890 (2001)

    Article  Google Scholar 

  4. Basseur, M., Seynhaeve, F., Talbi, E.-G.: Path relinking in pareto multi-objective genetic algorithms. In: Coello Coello, C.A., Aguirre, A.H., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 120–134. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Cai, X., Wei, O., Huang, Z.: Evolutionary approaches for multi-objective next release problem. Computing and Informatics 31(4), 847 (2012)

    Google Scholar 

  6. Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191(11-12), 1245–1287 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Durillo, J.J., Nebro, A.J.: jmetal: A java framework for multi-objective optimization. Advances in Engineering Software 42(10), 760–771 (2011)

    Article  Google Scholar 

  8. Durillo, J.J., Zhang, Y., Alba, E., Nebro, A.J.: A study of the multi-objective next release problem. In: Proceedings of the 2009 1st International Symposium on Search Based Software Engineering, SSBSE 2009, pp. 49–58. IEEE Computer Society, Washington, DC (2009)

    Chapter  Google Scholar 

  9. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Springer US (1972)

    Google Scholar 

  10. Konak, A., Coit, D.W., Smith, A.E.: Multi-objective optimization using genetic algorithms: A tutorial. Reliability Engineering & System Safety 91(9), 992–1007 (2006)

    Article  Google Scholar 

  11. Maaranen, H., Miettinen, K., Penttinen, A.: On initial populations of a genetic algorithm for continuous optimization problems. Journal of Global Optimization 37(3), 405–436 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Michalewicz, Z.: A survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th Annual Conference on Evolutionary Programming, pp. 135–155 (1995)

    Google Scholar 

  13. Poles, S., Fu, Y., Rigoni, E.: The effect of initial population sampling on the convergence of multi-objective genetic algorithms. In: Barichard, V., Ehrgott, M., Gandibleux, X., T’Kindt, V. (eds.) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol. 618, pp. 123–133. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.: A novel population initialization method for accelerating evolutionary algorithms. Computers and Mathematics with Applications 53(10), 1605 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhang, Y., Harman, M., Mansouri, S.: The multi-objective next release problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1129–1137. ACM (2007)

    Google Scholar 

  16. Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH) (November 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gomes Nepomuceno Da Silva, T., Sampaio Rocha, L., Bessa Maia, J.E. (2014). An Effective Method for MOGAs Initialization to Solve the Multi-Objective Next Release Problem. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Nature-Inspired Computation and Machine Learning. MICAI 2014. Lecture Notes in Computer Science(), vol 8857. Springer, Cham. https://doi.org/10.1007/978-3-319-13650-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13650-9_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13649-3

  • Online ISBN: 978-3-319-13650-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics