Abstract
As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.
1. Introduction
Project portfolio management (PPM) is a management process to help project managers to analyze and acquire all information of current proposed projects. PPM helps decision makers to sort and prioritize each project according to certain criteria, such as business goals, strategic value, cost, and resource constraints. A key step of PPM is to decide which projects to invest in an optimal manner. Project portfolio optimization (PPO) is the effort to make the best decisions to select the best mix of projects from all candidate projects. Manual approaches include PPO include Q-Sort, analytic hierarchy process, and portfolio matrices [1–3]. These approaches are time-consuming and limited to the number of projects they can deal with. The project portfolio problem may be dealt as a multiobjective optimization problem, and it is difficult to tackle [4, 5]. Software managers and researchers used branch-and-bound approach, simulated annealing and Tabu search, and so on to obtain the uniformly distributed Pareto-optimal solutions [6–8]. It is hard to find an algorithm to deal with this problem efficiently when the complexity of the problem grows exponentially with the number of projects.
Within this context, multiobjective evolutionary algorithms (MOEA) [9] which can obtain Pareto-optimal solutions are promising to solve the project portfolio optimization problem [10–12]. Pareto front-based MOEAs are superior to manual approaches in a way that they are able to create a set of efficient portfolios, for which it can be assured that there exist no solutions in the search space that promise better values in at least one of the objectives and offer at least the same values in all the other objectives [5]. MOEAs can obtain approximate optimal solutions. Furthermore, MOEAs can deal with the computational complexity with an increasing number of projects. That is why there are lots of publications devoted to solving portfolio optimization problems using MOEAs and also there are many applications of MOEAs in finance and economics areas [13].
Compared with general project portfolio optimization using MOEAs, the number of publications dedicated to the MOEAs’ applications to software project portfolio problems is scarce. Kremmel et al. [5] introduced a multiobjective evolutionary approach, mPOEMS, to find the Pareto-optimal front for software project portfolio optimization problem. However, the paper only studied 2-objective optimization. In this paper, we first propose an improved MOEA/D [14] algorithm based on reference distance (MOEA/D_RD) to alleviate the inefficiency of MOEA/D’s weighted sum approach. Then, we use MOEA/D_RD to solve the 2-, 3-, and 4-objective software portfolio optimization problem. Comparison and analysis experiments are conducted among MOEA/D_RD, MOEA/D, NSGA2 [15], and NSGA3 [16].
The rest of this paper is organized as follows. Section 2 discusses the related work of portfolio optimization using evolutionary algorithms. Section 3 describes the software portfolio selection model we have used. The proposed MOEA/D_RD is explained in detail in Section 4, and the empirical experiments are described and discussed in Section 5. The last section gives the conclusion and lists the future work.
2. Related Work
The first formalization of methodology for solving portfolio optimization problems was proposed by Markowitz [17] in the 1950s. Markowitz defined a portfolio as a vector of real numbers that contains the weight corresponding to each available asset and stated that the investor searches the portfolio that minimizes the risk while maximizing the return ideally. However, with the increasing number of projects and many constraints in real world, the simple assumptions in Markowitz model are infeasible and it is hard to find an exact algorithm to deal with the problem. As such, the first use of genetic algorithm (GA) for optimizing project portfolio was proposed by Arnone et al. in 1993 [18]. The authors divided the population of a GA into different subpopulations and produced different portions of the Pareto front.
An obvious advantage of MOEAs is their ability to produce, in one single run, a complete approximation of the Pareto front. MOEAs are suitable to solve the portfolio optimization problem since the aim of the problem is to provide a set of Pareto front solutions, that is, the best possible tradeoffs among the objectives, among which the managers can choose the most appropriate solution. In [19], the Markowitz model was solved with an MOEA in which the selection is carried out through a Pareto-ranking procedure. The authors used Sharpe’s ratio instead of the classical density estimators such as crowding distance to break ties between solutions from the same Pareto front. Lin et al. [20] implemented integer encoding, simulated binary crossover, and parameter-based mutation within the NSGA2 to solve the investment portfolio optimization problem with fixed transaction costs and minimum lots. Subbu et al. [21] combined a Pareto-sorting evolutionary algorithm with linear programming for investment portfolio optimization. The Pareto-sorting evolutionary algorithm is used to retain the nondominated solutions found along the search by a small population size and an archive. Branke et al. [22] combined NSGA2 with the critical line algorithm to obtain a continuous Pareto front for portfolio optimization. NSGA2 was first employed to define convex subset of the original search space, then the critical line algorithm was applied on every subset to form the complete Pareto front. Bradshaw et al. [23] employed an evolutionary algorithm similar to SPEA2 [24] to solving the portfolio optimization problem. In [25], the authors compared six MOEAs on the classical Markowitz model. The results showed that SPEA2 and NSGA2 performed more effectively among the six studied algorithms. [26] compared three MOEAs, that is, NSGA2, SPEA2, and PESA [27], to solve the Markowitz model with three objectives: return value, risk, and number of assets in the portfolio and found that SPEA2 can obtain the best performance for the test cases.
Aforementioned work is based on Markowitz mean-variance model, and there are also a few publications devoted to other portfolio optimization models using MOEAs. Khalili-Damghani et al. [28] presented a hybrid fuzzy rule-based multiobjective framework for sustainable project portfolio selection. NSGA2 was applied to obtain the nondominated solutions. The proposed framework simultaneously considered the accuracy maximization and the complexity minimization objectives. Fernandez et al. [29] proposed a nonoutranked ant colony optimization II method for optimizing portfolio problem. The method incorporates integer linear programming to avoid clearly suboptimal regions in the search space and a priori preference system to focus the algorithmic effort on the most preferred region in the search space. Doerner et al. [4] introduced a Pareto ant colony optimization algorithm for solving the portfolio selection problem. Tofighian and Naderi [30] employed an ant colony optimization algorithm for solving the project selection and scheduling to optimize both total expected benefit and resource usage variation. Mavrotas et al. [31] studied the robustness analysis methodology for multiobjective project selection optimization.
Relatively speaking, the publication with respect to software project management using MOEAs is scarce. Rodríguez et al. [32] employed NSGA2 and a system dynamics simulation model to generate the Pareto front needed by software project managers to find the best values for initial team size and schedule estimates for a given project with the optimal cost, time, and productivity. Gueorguiev et al. [33] formulated software project planning problem as biobjective optimization. Robustness and complete time are treated as two competing objectives, and SPEA2 was employed to obtain the Pareto solutions. The most closely related to this paper is the work by Kremmel et al. [5] in which the authors used Constructive Cost Model II (COCOMO II) [34] and a multiobjective evolutionary algorithm to find the Pareto front for software project portfolio optimization. Only 2-objective Pareto front solutions were studied in Kremmel’s work. In this paper, we extend Kremmel’s work and propose an improved MOEA/D algorithm called MOEA/D_RD for software project portfolio optimization. Optimization problems with 2, 3, and 4 objectives are studied using 50 projects that follow the validated COCOMO II model criteria, and the proposed approach is compared with several state-of-the-art evolutionary algorithms.
The next section presents the list of goals borrowed from Kremmel’s software portfolio selection model [5]. We only use the first 4 objectives and use the synergy goal as a constraint in our framework.
3. Software Portfolio Selection Model
Generally, a multiobjective optimization problem can be presented as the following:
Find a vector , is decision (variable) space. under some constraints, where is the decision (variable) space, consists of real-valued objective functions, and is called the objective space.
Suppose there are two solutions ; is said to dominate if and only if for every and for at least one index . A point is Pareto optimal to (1) if there is no point such that dominates . is then called a Pareto-optimal objective vector. In other words, any improvement in a Pareto-optimal point in one objective must lead to deterioration in at least one other objective. The set of all the Pareto-optimal points is called Pareto set, and the set of all the Pareto-optimal objective vectors is the Pareto front (PF).
Specifically, a solution for software project portfolio optimization is represented by a vector with the length of the maximum available projects. The task can be formalized as follows:
Find a vector , where , , such that the objective vector is maximum, where is greater than 0 if project is selected, and 0 if not; is the number of candidate projects; is a set of the number of months in the planning horizon; is the months in which project can start; is the number of timeframes in the planning horizon. is the th optimization objective. In this work, we have considered the first 4 objectives defined in Kremmel’s model, and thus the value of is 4. These 4 objectives are defined as follows: (1)Potential revenue (). Software project investors invest human resources, knowledge, and money into a project, with the goal of obtaining benefits from this investment. The potential projects for the project portfolio have to be evaluated with regard to their potential financial revenue. Thus, the first objective deals with the need to maximize potential overall portfolio return. It is calculated as the following: where is the potential revenue of project , and is 1 if xi > 0 and 0 if xi = 0. Obviously, the greater the overall potential revenue, the better the solution is.(2)Strategic alignment (). Project selection optimization has to consider the problems with little commitment from business leaders, poor alignment of projects to strategy, little coordination between projects, and conflicting project objectives. The strategic alignment on the portfolio level should be maximized. It is calculated as follows: where is the strategic alignment value of project , and is 1 if xi > 0 and 0 if xi = 0. The greater the overall strategic value, the better the solution is.(3)Resource usage distribution metric (). Resources in each timeframe are limited. This objective is to maximize the resource usage per timeframe and at the same time have the best distribution among the timeframe. Its value is between 0 and 1, where 1 means full resource consumption in each timeframe and 0 means that, at least in one timeframe, there is no resource consumed. Thus, the objective function to maximize is expressed as follows: where is the type of a resource (there are different resource types); is the timeframe; is the number of timeframes in the planning horizon; is the type resource consumption of project in timeframe , and is the type resource limit in timeframe . The closer the is to one, the better the solution is.(4)Risk (). The risk objective is calculated as follows: where is the risk value of project . The closer the is to one, the better the solution is.
The constraints we have used are listed as follows: (a)Project starting timeframes. Most projects cannot start in an arbitrary timeframe, but very often in a few distinct timeframes. It is also possible that a project can only start in one timeframe in order to meet a special market opportunity. A feasible solution must adhere to the constraint of project starting time.(b)The “must-select” restriction. Due to the legal and economic circumstances, a project may have to be included in a valid portfolio. Therefore, it should be possible to define a “must-select” restriction for portfolio optimization.(c)Logical relationships. There are several logical relationships between projects such as linear, dependent, and mutually exclusive relationships. Linear relationship means if a certain project is selected for a portfolio, one or more predecessor projects must be selected obligatorily. If two projects are dependent, it means that the two projects must be selected to a portfolio together. On the contrary, two projects may not be selected for the same portfolio and thus are mutually exclusive.(d)Synergy effects. The synergy effect constraint is one of the objectives in the original Kremmel’s model. We consider it as a constraint when we optimize the first objective, that is, the potential revenue. If two projects are selected for the same portfolio, the total revenue could be more than the sum of the two project’s revenues or less than the sum. The synergy effects are also considered in the Pareto ant colony optimization approach presented in [4].
In this paper, we consider the aforementioned four objectives and the four constraints for the software project portfolio problem. In the next section, we introduce the algorithm called MOEA/D_RD to solve the multiobjective optimization problem for software project selection.
4. An Improved MOEA/D Based on Reference Distance (MOEA/D_RD)
4.1. MOEA/D Based on Weighted Sum Approach
In this paper, we improve the weighted sum approach in MOEA/D algorithm [14] for solving the software project selection optimization problem. The approach considers a convex combination of the different objectives. Let be a weight vector; is the number of objectives; is the th objective to be optimized; and for all and . Then the optimal solution to the following scalar optimization problem is a Pareto-optimal point to (1) as we can see that corresponds to one of the objectives in (6), where we use to emphasize that is a coefficient vector in this objective function, where is the variables to be optimized. To generate a set of different Pareto-optimal vectors, one can use different weight vectors in the above scalar optimization problem and the optimized problem is divided into subproblems. The greater is, the wider the search space is. However, the weighted sum-based MOEA/D has several drawbacks and we illustrate them as follows.
Given an example, as shown in Figure 1, and are two objectives; is the objective function of solution ; PF is the assumed optimal Pareto front; , , and are three solutions corresponding to weight vectors , and . The ideal case is that the algorithm moves , , and to meet the PF. MOEA/D randomly picks up two solutions from the neighborhood of and generates a new solution using genetic operators. If the fitness value of the new solution is better than , then is replaced by the new solution. If the new solution is fallen in the overlapping area of the search spaces of neighboring solutions and , then both and are replaced by the new solution. The strategy is efficient at the earlier search stage of the algorithm, and it can make the search direction move fast to the PF. But at the late stage of the algorithm, as shown in Figure 2, there is no overlapping area among most of the search spaces of solutions. The neighboring solutions of cannot generate a new effective solution. The search process would stagnate at the late stage of the algorithm.
If the PF is a line, as shown in Figure 3, for the weight vector , all solutions on the PF line are the same optimal solutions with the same fitness values. Among the solutions between the weight vectors and , the optimal solution is the intersection point of PF and . Similarly, among the solutions between the weight vectors and , the optimal solution is the interaction point of PF and . Assume that a solution with respect to during iteration is , would not be replaced by even if is closer to and is a better solution. It is because and are equally optimal with the same fitness values on the PF line. The search process is in a standstill.
If the PF is a convex curve, as shown in Figure 4, assume that is the solution with respect to during iteration; when the algorithm finds another solution , will be replaced by since the fitness value of is better than . Similarly, the solutions with respect to and will be replaced by the solutions that are located close to the ends of PF. At the late search process of the algorithm, most of solutions are aggregated at the ends of PF and the algorithm suffers in stagnation.
From the above analysis, we can see that the traditional weighted sum approach of MOEA/D suffers poor search ability. In the next subsection, we propose an improved MOEA/D based on reference distance to enhance the search ability of the algorithm.
4.2. An Improved Algorithm MOEA/D_RD Based on Reference Distance
To alleviate the aforementioned problems of MOEA/D, we propose an improved version based on reference distance, called MOEA/D_RD. Reference distance is the distance from each solution to the weight vector, as shown in Figure 5. For each weight vector, we can calculate the distance of all solutions to it. For example, the distance of five solutions to weight vector is depicted in Figure 6. We can see that is the solution with the shortest distance to among the solutions. The calculation of reference distance is described in the following.
Given: the weight vector , the line from original point to , the solution , the projection point from to is ; then, the distance from original point to is
MOEA/D_RD is described as follows.
At each generation , MOEA/D_RD maintains (i) is the number of the subproblems considered in MOEA/D_RD,(ii)a population of points ; where is a vector and is the current solution to the th subproblem; corresponds to the weight vector ,(iii), where FVi is the fitness value of , that is, for each ,(iv)an external population (EP), which is used to store nondominated solutions found during the search,(v)a variable , ; stands for the replace rate; the value of is empirically set. The variable Count is used to record the number of solutions being replaced at each generation.
The algorithm works as follows.
| ||||||||||||||||||||||||||||||||||||||||
Take Figure 5 as an example. Assume and ; if the solutions corresponding to and are replaced, that is, Count = 2, since , the corresponding solutions of need to be replaced. Because is dominated by , is not in EP. , , , and are in EP. is used to replace the solution in terms of since has the shortest distance to . And is used to replace the solution in terms of since has the shortest distance to . Although has the shortest distance to , but is not in EP, thus is used to replace the solution in terms of .
From the above example and algorithm description, we can see that MOEA/D_RD has the following features: (1)The replacing strategy of MOEA/D_RD makes some unselected nondominate solutions in MOEA/D to generate the new population.(2)Although MOEA/D uses uniform weight vector, the subproblems of multiple weight vectors may fall in the same area and it may bring about the low diversity of population. MOEA/D_RD brings the idea of reference distance, and it can help the individuals that stuck in local area to search more widely.(3)MOEA/D_RD can bring new individuals when the algorithm is in stagnation; at the same time, the reference distance can guarantee that the new individuals are generated from the parents in neighborhood.
In brief, compared to the original MOEA/D, the replacing strategy based on reference distance in MOEA/D_RD increases the diversity of population and can obtain well-distributed solutions. The improved algorithm performs well in high-dimensional multiobjective optimization.
5. Experimental Evaluation
This section presents the experiments carried out to evaluate the performance of the proposed approach. First, the test data set based on the Constructive Cost Model (COCOMO II) is described. Three evaluating metrics are then introduced. Lastly, we compare MOEA/D_RD with MOEA/D, NSGA2, and NSGA3. All experiments were run on an Intel Core i5-2450M [email protected] GHz, 4 GB memory PC with Win7 64-bit operating system.
5.1. COCOMO II Test Set
COCOMO II is a model to estimate the cost, effort, and schedule when planning a new software development activity. The test set is based on this model and consists of 50 software projects [5]. The number of lines of source code of these projects is between 1000 and 37000. The maximum duration of a project is 18 months, and the planning horizon is set to 3 years. The planning horizon is divided into 3 timeframes, one year (12 months) per timeframe. There are 1500 person-months in total for the planning horizon and 500 person-months per timeframe. Each project has an assigned risk value between 0.2 and 0.8. Potential revenue is set to the maximum of 150% and to the minimum of 85% of the initial costs. The total strategic alignment value is calculated by a weight sum of each strategy’s alignment value which is set randomly. A maximum number of 30% of all projects are selected to have synergy effects with exactly one project where there is 15% of the positive synergy and 15% of the negative synergy. A number of 10% of all projects are selected randomly to be mandatory, and 4 projects are manually selected to be mutually exclusive.
5.2. Evaluation Metrics
In order to verify the proposed algorithm and compare to other state-of-the-art algorithms, we use three performance indexes as the following: (i)Set coverage (C-metric) [14]: Let and be the two approximations to the PF of a multiobjective optimization problem, is defined as the percentage of the solutions in that are dominated by at least one solution in , that is, means that all solutions in are dominated by some solutions in , while implies that no solution in is dominated by a solution in . (ii)IGD-metric [7]: Let be a set of nondominated solutions obtained by the algorithm. Let be the true PF. Since we do not know the actual PF for the software portfolio optimization problem in this paper, we use the optimal solutions obtained by all the compared algorithms as the approximation of . The average distance from to is defined as where is the minimum Euclidean distance between and the points in . If is large enough to represent the PF very well, could measure both the diversity and convergence of in a sense. To have a low value of , set must be very close to the PF.(iii)GD-metric [7]: where and have the same definitions as in IGD-metric. is the minimum Euclidean distance between and the points in . The smaller value GD-metric is, the more stable the algorithm.
To decide the value of in MOEA/D_RD suitably, we first analyze the impact of to the performance. Figure 7 shows the different IGD-metric values with different values in the objectives of and optimization task. For every value, the algorithm is run 20 times and the reference PF consists of all the nondominated solutions of the 20 runs. Calculate the IGD-metric for every single value. When equals to 0, it means reference distance is not used in the algorithm. We can see that the IGD-metric is the best when is 3. The algorithm performs similarly when is between 3 and 8. Considering that the convergence is slow if is too small and the stagnation in search process is serious if is too large, we set to 5 in the following experiments.
5.3. Comparison between MOEA/D_RD and MOEA/D
As for the 4 objectives we mentioned in Section 3, and are positively correlated; that is, high revenue can be expected only when resources are effectively used throughout the whole planning horizon and vice versa. For and , usually the project with either the lowest risk or the highest strategic alignment value is selected to the portfolio. Thus, - and - are not studied in our 2-objective optimization experiments. The experiments are conducted on 2-objective optimization problems: -, -, -, and -; 3-objective optimization problems: --, --, --, and --; and 4-objective optimization problem: ---. There are 150 weight vectors in 2-objective optimization experiments, 351 weight vectors in 3-objective optimization experiments, and 455 weight vectors in 4-objective optimization experiment. The number of neighborhood is 10. The mutation rate is 0.01. The number of generation is 500 for 2-objective optimization and 1000 for 3- and 4-objective optimization problems. We run 20 independent runs with each of the compared algorithms where each run produced a set of nondominated solutions. The final population of nondominated solutions is plotted in Figures 8 and 9. We can see that MOEA/D-RD obtains more nondominated solutions.
Tables 1–3 give the comparisons between MOEA/D-RD and MOEA/D in terms of C-metric, IGD-metric, and GD-metric. The better performance is marked in bold. From Tables 1 and 2, we can see that MOEA/D outperforms MOEA/D-RD in only one item of --. MOEA/D_RD performs better in the other 8 optimization problems with smaller C-metric and IGD-metric.
Figures 10 and 11 illustrate the improvement of the diversity of population and the distribution uniformity of solutions in MOEA/D_RD. Figure 10 presents the final population in one random run for - problem. The number of population is 150, and there are only 9 different solutions at the last generation. We can see that the solutions in the neighborhood are almost the same and there is no new solution generated through genetic operators. The algorithm suffers in stagnation. Figure 11 gives the final population after 20 runs for - problem. We can see that the nondominated solutions obtained by MOEA/D_RD are distributed more uniformly than the solutions by MOEA/D.
5.4. Comparison between MOEA/D_RD and NSGA2
NSGA2 has performed effectively in various optimization problems since it is invented. We also employ NSGA2 to solve our software project portfolio optimization model. The number of population of NSGA2 is 160, 360, and 500, respectively, for 2-objective, 3-objective, and 4-objective optimization problems. The mutation rate is 0.01. The number of generation is 500 for 2-objective optimization problem and 1000 for 3- and 4-objective optimization problems. The final population of nondominated solutions is plotted in Figures 12 and 13 after 20 independent runs. We can see that NSGA2 performs better and obtains more nondominated solutions in 2- and 3-objective optimization problems. Tables 4–6 give the comparisons between MOEA/D-RD and NSGA2 in terms of C-metric, IGD-metric, and GD-metric. The better performance is marked in bold. MOEA/D_RD outperforms NSGA2 for 4-objective optimization problem.
5.5. Comparison between MOEA/D_RD and NSGA3
NSGA3 is the newest version of NSGA2 designed for many objective optimization problems. We use NSGA3 to solve the software project portfolio optimization problem especially the 3- and 4-objective optimization problems. The number of population for NSGA3 is set to 152, division parameter ρ 150, reference points 151 for 2-objective optimization experiments. The number of population is set to 352, division parameter ρ 25, reference points 351 for 3-objective optimization experiments. The number of population is 456, division parameter ρ 12, reference points 455 for 4-objective optimization experiments. The mutation rate is 0.01. The number of generation is 500 for biobjective optimization and 1000 for 3- and 4-objective optimization problems. The final population of nondominated solutions is plotted in Figures 14 and 15 after 20 independent runs. For 2-objective optimization problem, MOEA/D_RD can obtain more nondominated solutions and the distribution of solutions is more uniformly than NSGA3. For 3-objective optimization problem, the solutions obtained by NSGA3 are distributed in smaller area than MOEA/D_RD.
Tables 7–9 give the comparisons between MOEA/D_RD and NSGA3 in terms of C-metric, IGD-metric, and GD-metric. The better performance is marked in bold. From Tables 7 and 8, we can see that NSGA3 outperforms MOEA/D_RD in terms of C-metric while MOEA/D_RD outperforms NSGA3 in terms of IGD-metric. It means that NSGA3 can get better PF, but the distribution of solutions is worse than MOEA/D_RD. Table 9 indicates that NSGA3 can have better mean values but worse deviation values than MOEA/D_RD and we can have the same conclusion from Tables 7 and 8.
5.6. More Experiments
We also conducted some experiments to compare the four studied algorithms. The results using the PF obtained by the four algorithms and the correspondingly computed IGD-metric are shown in Table 10. NSGA2 performs the best in 6 2- and 3-objective optimization problems with the smallest IGD-metric values. But for the 4-objective optimization problem, MOEA/D_RD outperforms the other algorithms.
Table 11 presents the average running time of the four algorithms in 20 runs for the 9 optimization problems. We can see that MOEA/D consumes the least time and MOEA/D_RD costs the similar time compared with MOEA/D. NSGA2 needs several or more than ten times than MOEA/D_RD, and NSGA3 consumes the most time. To sum up, MOEA/D needs the least time but it is easy to suffer in stagnation and cannot obtain good nondominated solutions. NSGA3 is not likely suitable to solve the software project portfolio optimization problem. It needs the most time, and the distribution of solutions is not good. NSGA2 performs well in 2- and 3-objective optimization problems, but it needs much more running time than MOEA/D_RD. Generally speaking, MOEA/D_RD has the excellent overall performance. It can get the uniformly distributed nondominated solutions and performs the best for the 4-objective optimization problem. Although MOEA/D_RD is a little worse than NSGA2 in 2- and 3-objective optimization problems, but it consumes much less running time. In conclusion, we can say that MOEA/D_RD is an effective approach to the software project portfolio optimization problem.
5.7. Conclusion and Future Work
Based on Kremmel’s model, a compact model with 4-objective optimization model for software project portfolio problem is proposed in this paper. The model is adaptive for software companies who can revise the objectives and constraints according to their own requirements. To solve the proposed model, an improved MOEA/D algorithm called MOEA/D_RD based on reference distance is proposed accordingly. The algorithm uses reference distance to select some solutions to generate new solutions. Compared with MOEA/D, NSGA2, and NSGA3, MOEA/D_RD performs well in terms of the quality of solutions and running time, especially for 4-objective optimization problem. Future work could cover several topics. A great number of projects for the test set could be conducted. It also would be important to test the approach on a test set with real-world data which may include some incomplete and uncertain data.
Conflicts of Interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
Acknowledgments
This work was partially supported by the National Natural Science Foundation of China (NSFC) Project nos. 61202296, 71102146, 61272067, 61370229, and 61370178, the National High-Technology Research and Development Program (“863” program) of China under Grant no. 2013AA01A212, the Natural Science Foundation of Guangdong Province Project no. S2012030006242, the Frontier and Key Technology Innovation Special Funds in Guangdong Province Project no. 2015B010109003, and the National Key Technology R&D Program of China Project no. 2013BAH72B01.