A multi-objective mean-semivariance model for project selection using reinvestment and synergy under uncertainty

被引:9
作者
Hong, Kwon Ryong [1 ,2 ]
Huang, Xiaoxia [1 ]
Kim, Jang Su [1 ,3 ]
Kim, Nam Hyok [1 ,4 ]
机构
[1] Univ Sci & Technol Beijing, Sch Econ & Management, Beijing 100083, Peoples R China
[2] Kim Il Sung Univ, Inst Nat Sci, Pyongyang, North Korea
[3] Kim Il Sung Univ, Inst Informat Technol, High Tech Res & Dev Ctr, Pyongyang, North Korea
[4] Kim Il Sung Univ, Fac Informat Sci, Pyongyang, North Korea
关键词
Multi-objective project selection; Mean-semivariance model; Uncertainty theory; Reinvestment strategy; Synergy effect; Meta-heuristic algorithm; PORTFOLIO SELECTION; ALGORITHM; OPTIMIZATION; OIL;
D O I
10.1016/j.eswa.2023.119586
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Project selection problems with imprecise parameters is one of the hot spots that have attracted many scholars' interest. In this paper, we first propose a multi-objective mean-semivariance model to solve the multi-objective project selection problem considering reinvestment and synergy between projects with different investment and operation periods by applying the uncertainty theory. The investment outlay and profit are treated as uncertain variables with an uncertainty distribution function that are determined based on experts' evaluations. The objectives are to maximize the expected value of uncertain net present value (NPV) and to minimize its risk (semivariance). The difference between the models taking variance and semivariance as the risk of NPV is compared, and the effects of reinvestment and synergy on project selection are analyzed. We next propose new binary versions of Jaya and Rao algorithms and develop multi-objective binary meta-heuristic algorithms binMOJaya, binMORao1 and binMORao2 to solve the proposed model. The performances of the proposed three algorithms are demonstrated through comparison with other well-known binary multi-objective algorithms for the 10 problems including large-scale problems. Finally, the validity of proposed model is illustrated through an example problem using the zigzag uncertainty distribution. Computational experiments have shown that the proposed uncertain model explains reinvestment and synergy well, and that the proposed algorithms, especially the binMORao2 algorithm, are very suitable for solving the proposed model.
引用
收藏
页数:18
相关论文
共 47 条
[1]   A multi objective-BSC model for new product development project portfolio selection [J].
Abbasi, Darya ;
Ashrafi, Maryam ;
Ghodsypour, Seyed Hassan .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 162
[2]   An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications [J].
Abu Zitar, Raedal ;
Al-Betar, Mohammed Azmi ;
Awadallah, Mohammed A. ;
Abu Doush, Iyad ;
Assaleh, Khaled .
ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2022, 29 (02) :763-792
[3]   Pricing and effort decisions for a supply chain with uncertain information [J].
Chen, Lin ;
Peng, Jin ;
Liu, Zhibing ;
Zhao, Ruiqing .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (01) :264-284
[4]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[5]   An improved visualization-based approach for project portfolio selection [J].
da Silva, Celmar G. ;
Meidanis, Joao ;
Moura, Arnaldo V. ;
Souza, Maria Angelica ;
Viadanna, Paulo, Jr. ;
de Oliveira, Marcello R. ;
de Oliveira, Mauricio R. ;
Jardim, Lidianne H. ;
Costa Lima, Gabriel A. ;
de Barros, Rafael S. V. .
COMPUTERS IN HUMAN BEHAVIOR, 2017, 73 :685-696
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[8]   The (σ, S) policy for uncertain multi-product newsboy problem [J].
Ding, Sibo ;
Gao, Yuan .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) :3769-3776
[9]   Shortest path problem with uncertain arc lengths [J].
Gao, Yuan .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (06) :2591-2600
[10]   Two heuristics for the rainbow spanning forest problem [J].
Ghoshal, Sudishna ;
Sundar, Shyam .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (03) :853-864