Skip to main content

Utilizing Faults and Time to Finish Estimating the Number of Software Test Workers Using Artificial Neural Networks and Genetic Programming

  • Conference paper
  • First Online:
Information Systems and Technologies to Support Learning (EMENA-ISTL 2018)

Abstract

Time, effort and the estimation of number of staff desired are critical tasks for project managers and particularly for software projects. The software testing process signifies about 40–50% of the software development lifecycle. Faults are detected and corrected during software testing. Accurate prediction of the number of test workers necessary to test a software before the delivery to a customer will save time and effort. In this paper, we present two models for estimating the number of test workers required for software testing using Artificial Neural Networks (ANN) and Genetic Programming (GP). We utilize the expected time to finish testing and the rate of change of fault observation as inputs to the proposed models. The proposed models were able to predict the required team size; thus, supporting project managers in allocating the team effort to various project phases. Both models yielded promising estimation results in real-time applications.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Yoon, I.C., Sussman, A., Memon, A., Porter, A.: Effective and scalable software compatibility testing. In: The 2008 ISSTA, pp. 63–74. ACM (2008)

    Google Scholar 

  2. Sheta, A.F.: Estimation of the COCOMO model parameters using genetic algorithms for NASA software projects. J. Comput. Sci. 2(2), 118–123 (2006)

    Article  Google Scholar 

  3. Sheta, A.F., Ayesh, A., Rine, D.: Evaluating software cost estimation models using particle swarm optimization and fuzzy logic for NASA projects: a comparative study. IJBIC 2(6), 365–373 (2010)

    Article  Google Scholar 

  4. Sheta, A.F., Kassaymeh, S., Rine, D.: Estimating the number of test workers necessary for a software testing process using artificial neural networks. IJACSA 5(7), 186–192 (2014)

    Google Scholar 

  5. Sheta, A.F., Abdel-Raouf, A.: Estimating the parameters of software reliability growth models using the Grey Wolf optimization algorithm. Int. J. Adv. Comput. Sci. Appl. 1(7), 499–505 (2016)

    Google Scholar 

  6. Braik, M., Sheta, A., Arieqat, A.: A comparison between GAs and PSO in training ANN to model the TE chemical process reactor. In: The AISB 2008 Symposium on Swarm Intelligence Algorithms and Applications, vol. 11, pp. 24–30 (2008)

    Google Scholar 

  7. Sheta, A.F., Braik, M., Al-Hiary, H.: Identification and model predictive controller design of the tennessee eastman chemical process using ANN. In: The International Conference on Artificial Intelligence (ICAI 2009), vol. 1, pp. 25–31 (2009)

    Google Scholar 

  8. Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Neurocomputing: foundations of research. In: Anderson, J.A., Rosenfeld, E. (eds.) Learning Representations by Back-propagating Errors, pp. 696–699. MIT Press, Cambridge (1988)

    Google Scholar 

  9. Al-Hiary, H., Braik, M., Sheta, A., Ayesh, A.: Identification of a chemical process reactor using soft computing techniques. In: The 2008 International Conference on Fuzzy Systems within the 2008 IEEE World Congress on Computational Intelligence (WCCI 2008), pp. 845–853 (2008)

    Google Scholar 

  10. Koza, J.R.: Genetic Programming II, Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge (1992)

    Google Scholar 

  11. Dimitriu, R.C., Bhadeshia, H., Fillon, C., Poloni, C.: Strength of ferritic steels: Neural networks and genetic programming. Mater. Manuf. Process. 24(1), 10–15 (2008)

    Article  Google Scholar 

  12. Naudts, B., Kallel, L.: A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Trans. Evol. Comput. 4(1), 1–15 (2000)

    Article  Google Scholar 

  13. Faris, H., Sheta, A.: Identification of the Tennessee Eastman chemical process reactor using genetic programming. Int. J. Adv. Sci. Tech. 50, 121–140 (2013)

    Google Scholar 

  14. Sheta, A.F., Faris, H., Öznergiz, E.: Improving production quality of a hot-rolling industrial process via genetic programming model. Int. J. Comput. Appl. Technol. 49(3/4), 239–250 (2014)

    Article  Google Scholar 

  15. Tohma, Y., Tokunaga, K., Nagase, S., Murata, Y.: Structural approach to the estimation of the number of residual software faults based on the hyper-geometric distribution. IEEE TSE. 15(3), 345–355 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alaa Sheta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sheta, A., Aljahdali, S., Braik, M. (2019). Utilizing Faults and Time to Finish Estimating the Number of Software Test Workers Using Artificial Neural Networks and Genetic Programming. In: Rocha, Á., Serrhini, M. (eds) Information Systems and Technologies to Support Learning. EMENA-ISTL 2018. Smart Innovation, Systems and Technologies, vol 111. Springer, Cham. https://doi.org/10.1007/978-3-030-03577-8_67

Download citation

Publish with us

Policies and ethics