scholarly journals A Novel Hybrid ABC-PSO Algorithm for Effort Estimation of Software Projects Using Agile Methodologies

2018 ◽  
Vol 27 (3) ◽  
pp. 489-506 ◽  
Author(s):  
Thanh Tung Khuat ◽  
My Hanh Le

Abstract In modern software development processes, software effort estimation plays a crucial role. The success or failure of projects depends greatly on the accuracy of effort estimation and schedule results. Many studies focused on proposing novel models to enhance the accuracy of predicted results; however, the question of accurate estimation of effort has been a challenging issue with regards to researchers and practitioners, especially when it comes to projects using agile methodologies. This study aims at introducing a novel formula based on team velocity and story point factors. The parameters of this formula are then optimized by employing swarm optimization algorithms. We also propose an improved algorithm combining the advantages of the artificial bee colony and particle swarm optimization algorithms. The experimental results indicated that our approaches outperformed methods in other studies in terms of the accuracy of predicted results.

Author(s):  
Emilia Mendes

The objective of this chapter is threefold. First is to introduce new terminology that relates specifically to hypertext, the model the Web is based upon. Second, it provides an overview of differences between Web and software development with respect to their development processes, technologies, quality factors, and measures. Third, it discusses the differences between Web effort estimation and software effort estimation.


2016 ◽  
Vol 13 (10) ◽  
pp. 7093-7098 ◽  
Author(s):  
Shivakumar Nagarajan ◽  
Balaji Narayanan

Software development effort estimation is the way of predicting the effort to improve software economics. Accurate estimation of effort is the most tedious tasks in software projects. However, several methods are used to estimate the software development effort accurately. Imprecise estimation can leads to project failure due to uncertain data. In this paper, a hybrid model based on combination of Particle Swarm Optimization (PSO), K-means clustering algorithms, neural network and ABE method is proposed. The proposed method can be useful to predict better clustering and more accurate estimation and hence, there are difficulties in clustering and outliers in the software projects. The obtained results showed the better clustering result which provides the estimation result accurately. Then, neural network and Analogy methods are used which enhance the accuracy significantly.


Author(s):  
Ying Tan

Compared to conventional PSO algorithm, particle swarm optimization algorithms inspired by immunity-clonal strategies are presented for their rapid convergence, easy implementation and ability of optimization. A novel PSO algorithm, clonal particle swarm optimization (CPSO) algorithm, is proposed based on clonal principle in natural immune system. By cloning the best individual of successive generations, the CPSO enlarges the area near the promising candidate solution and accelerates the evolution of the swarm, leading to better optimization capability and faster convergence performance than conventional PSO. As a variant, an advance-and-retreat strategy is incorporated to find the nearby minima in an enlarged solution space for greatly accelerating the CPSO before the next clonal operation. A black hole model is also established for easy implementation and good performance. Detailed descriptions of the CPSO algorithm and its variants are elaborated. Extensive experiments on 15 benchmark test functions demonstrate that the proposed CPSO algorithms speedup the evolution procedure and improve the global optimization performance. Finally, an application of the proposed PSO algorithms to spam detection is provided in comparison with the other three methods.


2015 ◽  
Vol 6 (4) ◽  
pp. 39-68 ◽  
Author(s):  
Maryam Hassani Saadi ◽  
Vahid Khatibi Bardsiri ◽  
Fahimeh Ziaaddini

One of the major activities in effective and efficient production of software projects is the precise estimation of software development effort. Estimation of the effort in primary steps of software development is one of the most important challenges in managing software projects. Some reasons for these challenges such as: discordant software projects, the complexity of the manufacturing process, special role of human and high level of obscure and unusual features of software projects can be noted. Predicting the necessary efforts to develop software using meta-heuristic optimization algorithms has made significant progressions in this field. These algorithms have the potent to be used in estimation of the effort of the software. The necessity to increase estimation precision urged the authors to survey the efficiency of some meta-heuristic optimization algorithms and their effects on the software projects. To do so, in this paper, they investigated the effect of combining various optimization algorithms such as genetic algorithm, particle swarm optimization algorithm and ant colony algorithm on different models such as COCOMO, estimation based on analogy, machine learning methods and standard estimation models. These models have employed various data sets to evaluate the results such as COCOMO, Desharnais, NASA, Kemerer, CF, DPS, ISBSG and Koten & Gary. The results of this survey can be used by researchers as a primary reference.


Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 603 ◽  
Author(s):  
Kuei-Hsiang Chao ◽  
Cheng-Chieh Hsieh

In this study, the output characteristics of partial modules in a photovoltaic module array when subject to shading were first explored. Then, an improved particle swarm optimization (PSO) algorithm was applied to track the global maximum power point (MPP), with a multi-peak characteristic curve. The improved particle swarm optimization algorithm proposed, combined with the artificial bee colony (ABC) algorithm, was used to adjust the weighting, cognition learning factor, and social learning factor, and change the number of iterations to enhance the tracking performance of the MPP tracker. Finally, MATLAB software was used to carry out a simulation and prove the improved that the PSO algorithm successfully tracked the MPP in the photovoltaic array output curve with multiple peaks. Its tracking performance is far superior to the existing PSO algorithm.


2013 ◽  
Vol 3 (1) ◽  
Author(s):  
Mohammad Taherdangkoo ◽  
Mahsa Paziresh ◽  
Mehran Yazdi ◽  
Mohammad Bagheri

AbstractIn this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).


Author(s):  
Alaa Tharwat ◽  
Tarek Gaber ◽  
Aboul Ella Hassanien ◽  
Basem E. Elnaghi

Optimization algorithms are necessary to solve many problems such as parameter tuning. Particle Swarm Optimization (PSO) is one of these optimization algorithms. The aim of PSO is to search for the optimal solution in the search space. This paper highlights the basic background needed to understand and implement the PSO algorithm. This paper starts with basic definitions of the PSO algorithm and how the particles are moved in the search space to find the optimal or near optimal solution. Moreover, a numerical example is illustrated to show how the particles are moved in a convex optimization problem. Another numerical example is illustrated to show how the PSO trapped in a local minima problem. Two experiments are conducted to show how the PSO searches for the optimal parameters in one-dimensional and two-dimensional spaces to solve machine learning problems.


Sign in / Sign up

Export Citation Format

Share Document