Loading

COREAN: A proposed Model for Predicting Effort Estimation having Reuse
Jyoti Mahajan1, Simmi Dutta2

1Jyoti Mahajan, Computer Engineering Department, Government College of Engineering & Technology, Jammu, India.
2Simmi Dutta, Computer Engineering Department, Government College of Engineering & Technology, Jammu, India.
Manuscript received on January 01, 2013. | Revised Manuscript received on January 02, 2013. | Manuscript published on January 05, 2013. | PP: 266-270 | Volume-2, Issue-6, January 2013. | Retrieval Number: F1174112612/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The estimation accuracy has been focused in various formal estimation models in recent research initiatives. The formal estimation models were developed to measure lines of code and function points in the software projects but most of them failed to improve accuracy in estimation. The concept of reusability in software development in estimating effort using artificial neural network is focused in this paper. Incorporation of reusability metrics in COCOMO II may yield better results. In COCOMO II it is very difficult to find the values of size parameters. A new model called COREAN has been proposed in this paper for better effort estimation accuracy and reliability. The proposed model has focused on two components of COCOMO II. First, instead of using RUSE cost driver, three new reuse cost drivers are introduced. Second, In order to reduce the project cost, three cost drivers such as PEXE, AEXE, LTEX are combined into single cost driver Personnel Experience (PLEX). Finally, this proposed model accuracy is more improved with the help of Enhanced RPROP algorithm and simulated annealing optimization technique.
Keywords: Effort Estimation, Software Reuse, COCOMO II, Artificial Neural Network, Simulated Annealing.