Open Access   Article Go Back

Overtime Planning Using Evolutionary Algorithms in Software Development

Rahat Parween1

Section:Review Paper, Product Type: Journal Paper
Volume-7 , Issue-4 , Page no. 536-539, Apr-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i4.536539

Online published on Apr 30, 2019

Copyright © Rahat Parween . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Rahat Parween, “Overtime Planning Using Evolutionary Algorithms in Software Development,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.4, pp.536-539, 2019.

MLA Style Citation: Rahat Parween "Overtime Planning Using Evolutionary Algorithms in Software Development." International Journal of Computer Sciences and Engineering 7.4 (2019): 536-539.

APA Style Citation: Rahat Parween, (2019). Overtime Planning Using Evolutionary Algorithms in Software Development. International Journal of Computer Sciences and Engineering, 7(4), 536-539.

BibTex Style Citation:
@article{Parween_2019,
author = {Rahat Parween},
title = {Overtime Planning Using Evolutionary Algorithms in Software Development},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {4 2019},
volume = {7},
Issue = {4},
month = {4},
year = {2019},
issn = {2347-2693},
pages = {536-539},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4072},
doi = {https://doi.org/10.26438/ijcse/v7i4.536539}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i4.536539}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4072
TI - Overtime Planning Using Evolutionary Algorithms in Software Development
T2 - International Journal of Computer Sciences and Engineering
AU - Rahat Parween
PY - 2019
DA - 2019/04/30
PB - IJCSE, Indore, INDIA
SP - 536-539
IS - 4
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
264 201 downloads 125 downloads
  
  
           

Abstract

Programming building and advancement is outstanding to experience the ill effects of impromptu extra minutes, which causes pressure and sickness in designers and can prompt low quality programming with higher imperfections. As of late, we presented a multi-target choice help way to deal with assistance balance venture dangers and term against extra time, so programming designers can more readily design additional time. This methodology was observationally assessed on six genuine programming ventures and looked at against best in class developmental methodologies and right now utilized extra time techniques. The outcomes demonstrated that our proposition serenely beated every one of the benchmarks considered. This paper broadens our past work by exploring versatile multi-target ways to deal with meta-heuristic administrator choice, in this manner expanding and enhancing algorithmic execution. We additionally stretched out our experimental examination to incorporate two new true programming ventures, along these lines improving the logical proof for the specialized execution claims made in the paper. Our new outcomes, over each of the eight tasks contemplated, demonstrated that our versatile calculation beats the considered cutting edge multi-target approaches in 93 percent of the analyses. The outcomes likewise affirm that our methodology essentially beats current additional time arranging rehearses in 100 percent of the trials.

Key-Words / Index Term

Software building, the executives, arranging, look based programming designing, venture booking, additional time, hyper heuristic, multi-objective transformative calculations

References

[1] J. Ren, M. Harman, and M. Di Penta, “Cooperative co-evolutionary optimization on software project staff assignments and job scheduling,” in Proc. 3rd Int. Symp. Search Based Softw. Eng., Sept. 10–11, 2011, pp. 127–141.
[2] P. Kapur, A. Ngo-The, G. Ruhe, and A. Smith, “Optimized staffing for product releases and its application at chartwell technology,” J. Softw.Maintenance Evol.: Res. Practice, vol. 20,no. 5, pp. 365–386, 2008.
[3] C. Stylianou, S. Gerasimou, and A. Andreou, “A novel prototype tool for intelligent software project scheduling and staffing enhanced with personality factors,” in Proc. IEEE 24th Int. Conf. Tools Artif. Intell., Nov. 2012, pp. 277–284.
[4] J. D. Knowles, L. Thiele, and E. Zitzler, “A tutorial on the performance assessment of stochastic multiobjective optimizers,” Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland, Tech. Rep. 214, 2006.
[5] H. Meunier, E.-G. Talbi, and P. Reininger, “A multiobjective genetic algorithm for radio network optimization,” in Proc. Congr. Evol. Comput., 2000, pp. 317–324.
[6] E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach,” IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 257–271, Nov. 1999.
[7] E. Zitzler, L. Thiele, M. Laumanns, C. Fonseca, and V. da Fonseca, “Performance assessment of multiobjective optimizers: An analysis and review,” IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 117–132, Apr. 2003.
[8] D. A. V. Veldhuizen and G. B. Lamont, “Multiobjective evolutionary algorithm research: A history and analysis,” Department of Electrical and Computer Engineering, Wright-Patterson AFB, Ohio, Tech. Rep. TR-98-03, 1998.
[9] A. Arcuri and L. Briand, “A practical guide for using statistical tests to assess randomized algorithms in software engineering,” in Proc. 33rd Int. Conf. Softw. Eng., 2011, pp. 1–10.
[10] P. Royston, “An extension of Shapiro and Wilk’sWtest for normality to large samples,” Appl. Statist., vol. 31, no. 2, pp. 115–124, 1982.
[11] J. Cohen, Statistical Power Analysis for the Behavioral Sciences, 2nd ed. Denmark: Lawrence Earlbaum Associates, 1988.
[12] A. Vargha and H. D. Delaney, “A critique and improvement of the CL common language effect size statistics of mcgraw and wong,” J. Edu. Behavioral Statist., vol. 25, no. 2, pp. 101–132, jan 2000.
[13] G. Neumann, M. Harman, and S. Poulding, “Transformed Vargha-Delaney effect size,” in Proc. 7th Int. Symp. Search-Based Softw. Eng., 2015, pp. 318–324.
[14] S.-J. Huang and N.-H. Chiu, “Optimization of analogy weights by genetic algorithm for software effort estimation,” Inform. Softw. Technol., vol. 48, no. 11, pp. 1034–1045, 2006.
[15] F. Ferrucci, M. Harman, and F. Sarro, “Search-based software project management,” in Software Project Management in a Changing World, G. Ruhe and C. Wohlin, Eds. Berlin, Germany: Springer, 2014, pp. 373–399.
[16] E. Kocaguneli, T. Menzies, and J. W. Keung, “On the value of ensemble effort estimation,” IEEE Trans. Softw. Eng., vol. 38, no. 6, pp. 1403–1416, Nov./Dec. 2012.
[17] A. S. Hanna and G. Haddadl, “Overtime and productivity in - electrical construction,” in Proc. Construct. Res. Congr., 2009, pp. 1–10.
[18] C. K. Chang, C. Chao, S.-Y. Hsieh, and Y. Alsalqan, “Spmnet: A formal methodology for software management,” in Proc. 18th Annu. Int. Comput. Softw. Appl. Conf., Nov. 9–11, 1994, pp. 57–57.
[19] E. Alba and F. Chicano, “Software project management with gas,” Inform. Sci., vol. 177, no. 11, pp. 2380–2401, Jun. 2007.
[20] G. Antoniol, M. D. Penta, and M. Harman, “Search-based techniques applied to optimization of project planning for a massive maintenance project,” in Proc. 21st IEEE Int. Conf. Softw. Maintenance, 2005, pp. 240–249.
[21] G. Antoniol, M. Di Penta, and M. Harman, “The use of searchbased optimization techniques to schedule and staff software projects: An approach and an empirical study,” Softw.: Practice Experience, vol. 41, no. 5, pp. 495–519, Apr. 2011.
[22] M. Hericko, A. Zivkovic, and I. Rozman, “An approach to optimizing software development team size,” Inform. Process. Lett., vol. 108, no. 3, pp. 101–106, Oct. 2008.
[23] D. Kang, J. Jung, and D.-H. Bae, “Constrait-based human resource allocation in software projects,” Softw.: Practice Experience, vol. 41, no. 5, pp. 551–577, Apr. 2011.
[24] M. Lefley and M. J. Shepperd, “Using genetic programming to improve software effort estimation based on general data sets,” in Proc. Genetic and Evol. Comput. Conf., 2003, pp. 2477–2487.
[25] F. Ferrucci, C. Gravino, R. Oliveto, and F. Sarro, Using Tabu Search to Estimate Software Development Effort. Berlin, Germany: Springer, 2009, pp. 307–320.