Abstract:Personnel risk is an issue which has not been researched well but plays an important role to determine whether a software project succeeds or fails. Most existing research work focuses on subjective expertise while an objective view is lacking. Furthermore, to the best of our knowledge, the demand for an automatic tool to support risk management has not been answered yet. In this research, based on objective historical data, we extend our earlier model, cabilitybased scheduling framework, by including risk ana… Show more
“…Thus, to mutate at this range may be an appropriate choice. Besides, we can also see that the mutation range from "0-22" to "14-22" bits does not lead to a significant improvement, and some ranges are even slightly fluctuant (e.g., "6-22" in the GGO model or " [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]" in the GO model). Consequently, mutation on these lower bits may also be uninfluential.…”
Section: B Experiments 1 -Sensitivity Analysis Of Bit Mutationsmentioning
confidence: 96%
“…The crossover may happen at different bits with a probability called crossover rate, P cross . This rate typically ranges from 0.5 to 0.8 from GA literatures [16,22]. We decide to adopt uniform crossover in our experiments.…”
Section: B Selection Scheme and Genetic Operatorsmentioning
confidence: 99%
“…Then based on the IEEE floating-point standard, we can easily decode the best chromosomes from parametric solutions. Fitness function is an indicator of the fitness of every chromosome that shows how close this chromosome is to the desired solution [16]. MGA selects the candidate chromosomes from the current population based on their fitness values.…”
Section: A Chromosome Representation and Fitness Functionmentioning
confidence: 99%
“…In the field of software engineering or in its sub-area software reliability, GA has also attracted the attention of researchers with solving the optimization to their specific problem domains [1,6], such as optimal scheduling [16], optimal test data generation [21], optimal module clustering [3], etc. In the past, Huang and Chiu [12,13] investigated the estimated accuracy of adopting GA to determine weighted similarity measures in either analogy-based software effort estimation models or grey relational analysis models.…”
In order to assure software quality and assess software reliability, many software reliability growth models (SRGMs) have been proposed for estimation of reliability growth of products in the past three decades. In principle, two widely used methods for the parameter estimation of SRGMs are the maximum likelihood estimation (MLE) and the least squares estimation (LSE). However, the approach of these two estimations may impose some restrictions on SRGMs, such as the existence of derivatives from formulated models or the needs for complex calculation. Thus in this paper, we propose a modified genetic algorithm (MGA) to estimate the parameters of SRGMs. Experiments based on real software failure data are performed, and the results show that the proposed genetic algorithm is more effective and faster than traditional genetic algorithms.
“…Thus, to mutate at this range may be an appropriate choice. Besides, we can also see that the mutation range from "0-22" to "14-22" bits does not lead to a significant improvement, and some ranges are even slightly fluctuant (e.g., "6-22" in the GGO model or " [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]" in the GO model). Consequently, mutation on these lower bits may also be uninfluential.…”
Section: B Experiments 1 -Sensitivity Analysis Of Bit Mutationsmentioning
confidence: 96%
“…The crossover may happen at different bits with a probability called crossover rate, P cross . This rate typically ranges from 0.5 to 0.8 from GA literatures [16,22]. We decide to adopt uniform crossover in our experiments.…”
Section: B Selection Scheme and Genetic Operatorsmentioning
confidence: 99%
“…Then based on the IEEE floating-point standard, we can easily decode the best chromosomes from parametric solutions. Fitness function is an indicator of the fitness of every chromosome that shows how close this chromosome is to the desired solution [16]. MGA selects the candidate chromosomes from the current population based on their fitness values.…”
Section: A Chromosome Representation and Fitness Functionmentioning
confidence: 99%
“…In the field of software engineering or in its sub-area software reliability, GA has also attracted the attention of researchers with solving the optimization to their specific problem domains [1,6], such as optimal scheduling [16], optimal test data generation [21], optimal module clustering [3], etc. In the past, Huang and Chiu [12,13] investigated the estimated accuracy of adopting GA to determine weighted similarity measures in either analogy-based software effort estimation models or grey relational analysis models.…”
In order to assure software quality and assess software reliability, many software reliability growth models (SRGMs) have been proposed for estimation of reliability growth of products in the past three decades. In principle, two widely used methods for the parameter estimation of SRGMs are the maximum likelihood estimation (MLE) and the least squares estimation (LSE). However, the approach of these two estimations may impose some restrictions on SRGMs, such as the existence of derivatives from formulated models or the needs for complex calculation. Thus in this paper, we propose a modified genetic algorithm (MGA) to estimate the parameters of SRGMs. Experiments based on real software failure data are performed, and the results show that the proposed genetic algorithm is more effective and faster than traditional genetic algorithms.
“…The effects of overruns are not immediately obvious, since they can affect the critical path, making previously less important work packages become more important for the overall project completion time. Jiang et al (2007) proposed an approach that extracts personnel risk information from historical data and integrates risk analysis into project scheduling performed with GA. A rescheduling mechanism is designed to detect and mitigate potential risks along with the software project development. However, the proposed approach has not been empirically validated.…”
Abstract. Project management presents the manager with a complex set of related optimisation problems. Decisions made can more profoundly affect the outcome of a project than any other activity. In the chapter, we provide an overview of Search-Based Software Project Management, in which Search-Based Software Engineering (SBSE) is applied to problems in software project management. We show how SBSE has been used to attack the problems of staffing, scheduling, risk, and effort estimation. SBSE can help to solve the optimisation problems the manager faces, but it can also yield insight. SBSE therefore provides both decision making and decision support. We provide a comprehensive survey of Search-Based Software Project Management, and give directions for the development of this subfield of SBSE.
IntroductionSoftware Project Management includes several activities critical for the success of a project (e.g., cost estimation, project planning, quality management). These activities often involve finding a suitable balance between competing and potentially conflicting goals. For example, planning a project schedule requires to minimise the project duration and the project cost, and to maximise the product quality. Many of these problems are essentially optimization questions characterised by competing goals/constraints and with a bewilderingly large set of possible choices. So finding good solutions can be hard.Search-Based Software Engineering seeks to reformulate software engineering problems as search-based optimisation problems and applies a variety of metaheuristics based on local and global search to solve them (such as Hill Climbing, Tabu Search, and Genetic Algorithms). These meta-heuristics search for a suitable solution in a typically large input space guided by a fitness function that expresses the goals and leads the exploration into potentially promising areas of the search space.Though the term Search-Based Software Engineering (SBSE) was coined by Harman and Jones in 2001 to cover the application of computational search and optimisation across the wide spectrum of software engineering activities (Harman and Jones 2001), there were already pockets of activity on several specific software engineering problems prior to the introduction of the term SBSE. One such topic was Search-Based Software Project Management, the topic of this chapter. In particular, there was work on search-based project scheduling and staffing by
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.