Min-Mei Huang
Research Subjects
Min-Mei Huang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Changqin Huang
College of Education, Zhejiang University, Hangzhou, China
1 shared publication Jijun Yuan
School of Finance, Guangdong University of Finance & Economics, Guangzhou 510320, China
1 shared publicationJing Xiao
School of Computer Science, South China Normal University, Guangzhou 510631, China
1 shared publication- Jing Xiao
School of Computer Science
1 shared publication - Jingjing Li
South China Normal University
1 shared publication Xi-Xi Hong
School of Computer Science
1 shared publication
Latest Publications
- Open Access
- 1 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
An Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization
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 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
Open AccessAn Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization
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.
- Open Access
- 17 March 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-11
An Adapted Firefly Algorithm for Product Development Project Scheduling with Fuzzy Activity Duration
Efficient scheduling plays an important role in product development project management, especially for the product development project with fuzzy activity times. In this research a trapezoidal fuzzy number is used to represent fuzzy activity duration, and an improved magnitude of the trapezoidal fuzzy number is adopted for fuzzy time comparison. Firstly, a mathematical model for the scheduling problem with minimizing the project completion time for the product development project is established. Then, an adapted fuzzy firefly algorithm is developed to solve the model. The priority value based coding method is used; the fuzzy parallel schedule generation scheme is adopted to generate feasible solutions, and the brightness comparisons are made before updating fireflies’ locations in the proposed algorithm. Finally, the performance of the proposed algorithm is presented by computational experiments based on PSPLIB benchmarks. An example of resource allocation of an electronic product development project is also used to illustrate the effectiveness and efficiency of the proposed algorithm.
- 17 March 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-11
Open AccessAn Adapted Firefly Algorithm for Product Development Project Scheduling with Fuzzy Activity Duration
Efficient scheduling plays an important role in product development project management, especially for the product development project with fuzzy activity times. In this research a trapezoidal fuzzy number is used to represent fuzzy activity duration, and an improved magnitude of the trapezoidal fuzzy number is adopted for fuzzy time comparison. Firstly, a mathematical model for the scheduling problem with minimizing the project completion time for the product development project is established. Then, an adapted fuzzy firefly algorithm is developed to solve the model. The priority value based coding method is used; the fuzzy parallel schedule generation scheme is adopted to generate feasible solutions, and the brightness comparisons are made before updating fireflies’ locations in the proposed algorithm. Finally, the performance of the proposed algorithm is presented by computational experiments based on PSPLIB benchmarks. An example of resource allocation of an electronic product development project is also used to illustrate the effectiveness and efficiency of the proposed algorithm.