Effort Estimation For Software Development On Mobile Application Of 'Tangkap Reptil'

An essential aspect of planning and management of software design projects is to estimate work time, costs, and human resources. The calculation solution made in this study aims to assist in calculating the estimated time of developing a reptile capture application using the Use Case Point (UCP) method. The UCP method is a software effort estimation method that shows better performance compared to other methods. The result of this research is the risk of software development on the mobile application of 'Tangkap Reptil' has a small chance, can be done in a relatively short time, and does not require a lot of resources.An essential aspect of planning and management of software design projects is to estimate work time, costs, and human resources. The calculation solution made in this study aims to assist in calculating the estimated time of developing a reptile capture application using the Use Case Point (UCP) method. The UCP method is a software effort estimation method that shows better performance compared to other methods. The result of this research is the risk of software development on the mobile application of 'Tangkap Reptil' has a small chance, can be done in a relatively short time, and does not require a lot of resources

Optimizing Effort Parameter of COCOMO II Using Particle Swarm Optimization Method

Estimating the effort and cost of software is an important activity for software project managers. A poor estimate (overestimates or underestimates) will result in poor software project management. To handle this problem, many researchers have proposed various models for estimating software cost. Constructive Cost Model II (COCOMO II) is one of the best known and widely used models for estimating software costs. To estimate the cost of a software project, the COCOMO II model uses software size, cost drivers, scale factors as inputs. However, this model is still lacking in terms of accuracy. To improve the accuracy of COCOMO II model, this study examines the effect of the cost factor and scale factor in improving the accuracy of effort estimation. In this study, we initialized using Particle Swarm Optimization (PSO) to optimize the parameters in a model of COCOMO II. The method proposed is implemented using the Turkish Software Industry dataset which has 12 data items. The method can handle improper and uncertain inputs efficiently, as well as improves the reliability of software effort. The experiment results by MMRE were 34.1939%, indicating better high accuracy and significantly minimizing error 698.9461% and 104.876%

Optimizing Effort and Time Parameters of COCOMO II Estimation using Fuzzy Multi-objective PSO

The  estimation  of  software  effort  is  an  essential and  crucial   activity   for  the  software   development   life  cycle. Software effort estimation is a challenge that often appears on the project of making a software. A poor estimate will produce result in a worse project management.  Various software cost estimation model has been introduced  to resolve this problem. Constructive Cost Model II (COCOMO II Model) create large extent most considerable  and broadly  used as model  for cost estimation.  To estimate   the  effort  and  the  development   time  of  a  software project,  COCOMO  II model uses cost drivers,  scale factors  and line  of  code.  However,  the  model  is  still  lacking  in  terms  of accuracy both in effort and development  time estimation.  In this study,   we   do   investigate   the   influence   of   components   and attributes to achieve new better accuracy improvement on COCOMO II model. And we introduced the use of Gaussian Membership  Function  (GMF)  Fuzzy  Logic  and Multi-Objective Particle Swarm Optimization method (MOPSO) algorithms in calibrating  and optimizing  the COCOMO  II model parameters. The   proposed   method   is   applied   on   Nasa93   dataset.   The experiment  result of proposed method able to reduce error down to  11.891%  and  8.082%  from  the  perspective  of  COCOMO  II model.  The  method  has  achieved  better  results  than  those  of previous   researches   and  deals  proficient   with  inexplicit   data input and further improve reliability of the estimation method

Optimizing Time and Effort Parameters of COCOMO II using Fuzzy Multi-Objective Particle Swarm Optimization

Estimating the efforts, costs, and schedules of software projects is a frequent challenge to software development projects. A bad estimation will result in bad management of a project. Various models of estimation have been defined to complete this estimate. The Constructive Cost Model II (COCOMO II) is one of the most famous models as a model for estimating efforts, costs, and schedules. To estimate the effort, cost, and schedule in project of software, the COCOMO II uses inputs: Effort Multiplier (EM), Scale Factor (SF), and Source Line of Code (SLOC). Evidently, this model is still lack in terms of accuracy rates in both efforts estimated and time of development. In this paper, we introduced to use Gaussian Membership Function (GMF) of Fuzzy Logic and Multi-Objective Particle Swarm Optimization (MOPSO) method to calibrate and optimize the parameters of COCOMO II. It is to achieve a new level of accuracy better on COCOMO II. The Nasa93 dataset is used to implement the method proposed. The experimental results of the method proposed have reduced the error downto 11.89% and 8.08% compared to the original COCOMO II. This method proposed has achieved better results than previous studies

Parameter tuning of software effort estimation models using antlion optimization

In this work, the antlion optimization (ALO) is employed due to its efficiency and wide applicability to estimate the parameters of four modified models of the basic constructive cost model (COCOMO) model. Three tests are carried out to show the effectiveness of ALO: first, it is used with Bailey and Basili dataset for the basic COCOMO Model and Sheta’s Model 1 and 2, and is compared with the firefly algorithm (FA), genetic algorithms (GA), and particle swarm optimization (PSO). Second, parameters of Sheta’s Model 1 and 2, Uysal’s Model 1 and 2 are optimized using Bailey and Basili dataset; results are compared with directed artificial bee colony algorithm (DABCA), GA, and simulated annealing (SA). Third, ALO is used with Basic COCOMO model and four large datasets, results are compared with hybrid bat inspired gravitational search algorithm (hBATGSA), improved BAT (IBAT), and BAT algorithms. Results of Test1 and Test2 show that ALO outperformed others, as for Test3, ALO is better than BAT and IBAT using MAE and the number of best estimations. ALO proofed achieving better results than hBATGSA for datasets 2 and 4 out of the four datasets explored in terms of MAE and the number of best estimates

A New Hybrid model of Multi-layer Perceptron Artificial Neural Network and Genetic Algorithms in Web Design Management Based on CMS

The size and complexity of websites have grown significantly during recent years. In line with this growth, the need to maintain most of the resources has been intensified. Content Management Systems (CMSs) are software that was presented in accordance with increased demands of users. With the advent of Content Management Systems, factors such as: domains, predesigned module’s development, graphics, optimization and alternative support have become factors that influenced the cost of software and web-based projects. Consecutively, these factors have challenged the previously introduced cost estimation models. This paper provides a hybrid method in order to estimate the cost of websites designed by content management systems. The proposed method uses a combination of genetic algorithm and Multilayer Perceptron (MLP). Results have been evaluated by comparing the number of correctly classified and incorrectly classified data and Kappa coefficient, which represents the correlation coefficient between the sets. According to the obtained results, the Kappa coefficient on testing data set equals to: 0.82 percent for the proposed method, 0.06 percent for genetic algorithm and 0.54 percent for MLP Artificial Neural Network (ANN). Based on these results; it can be said that, the proposed method can be used as a considered method in order to estimate the cost of websites designed by content management systems

Parameter estimation of cocomo model using the jaya algorithm for software cost estimation

In line with the advancement of computer technology, software is increasingly being used in place of hardware to help human do the daily chores. Estimate of the software development costs can be a major issue (i.e. in terms of determining the actual development costs). To date, many techniques have been proposed to help the software engineer determine the actual software cost. This thesis proposed the Jaya algorithm based on estimation of the software based on the COCOMO I model. The Constructive Cost Model (COCOMO) is a procedural software cost estimation model developed by Barry W. Boehm. In this case, the estimation of value of the COCOMO model parameters are determined for the cost and time estimation of the COCOMO model. As a result, COCOMO Jaya Algorithm (COCOMO JA) has been developed. The dataset NASA 63 project, Turkish dataset, and Kemerer dataset have been used. The experiment result shows the comparison between the standard COCOMO and COCOMO JA. The COCOMO JA demonstrated more minimize error as compare to the standard COCOMO. In conclusion, the JA suitable to evaluate the estimation effort and time for the COCOMO model

Optimizing complexity weight parameter of use case points estimation using particle swarm optimization

Among algorithmic-based frameworks for software development effort estimation, Use Case Points I s one of the most used. Use Case Points is a well-known estimation framework designed mainly for object-oriented projects. Use Case Points uses the use case complexity weight as its essential parameter. The parameter is calculated with the number of actors and transactions of the use case. Nevertheless, use case complexity weight is discontinuous, which can sometimes result in inaccurate measurements and abrupt classification of the use case. The objective of this work is to investigate the potential of integrating particle swarm optimization (PSO) with the Use Case Points framework. The optimizer algorithm is utilized to optimize the modified use case complexity weight parameter. We designed and conducted an experiment based on real-life data set from three software houses. The proposed model’s accuracy and performance evaluation metric is compared with other published results, which are standardized accuracy, effect size, mean balanced residual error, mean inverted balanced residual error, and mean absolute error. Moreover, the existing models as the benchmark are polynomial regression, multiple linear regression, weighted case-based reasoning with (PSO), fuzzy use case points, and standard Use Case Points. Experimental results show that the proposed model generates the best value of standardized accuracy of 99.27% and an effect size of 1.15 over the benchmark models. The results of our study are promising for researchers and practitioners because the proposed model is actually estimating, not guessing, and generating meaningful estimation with statistically and practically significant

Optimization of use case point through the use of metaheuristic algorithm in estimating software effort

Use Case Points estimation framework relies on the complexity weight parameters to estimate software development projects. However, due to the discontinue parameters, it lead to abrupt weight classification and results in inaccurate estimation. Several research studies have addressed these weaknesses by employing various approaches, including fuzzy logic, regression analysis, and optimization techniques. Nevertheless, the utilization of optimization techniques to determine use case weight parameter values has yet to be extensively explored, with the potential to enhance accuracy further. Motivated by this, the current research delves into various metaheuristic search-based algorithms, such as genetic algorithms, Firefly algorithms, Reptile search algorithms, Particle swarm optimization, and Grey Wolf optimizers. The experimental investigation was carried out using a Silhavy UCP estimation dataset, which contains 71 project data from three software houses and is publicly available. Furthermore, we compared the performance between models based on metaheuristic algorithms. The findings indicate that the performance of the Firefly algorithm outperforms the others based on five accuracy metrics: mean absolute error, mean balance relative error, mean inverted relative error, standardized accuracy, and effect size