Credit portfolio management using two-level particle swarm optimization

被引:27
作者
Lu, Fu-Qiang [1 ]
Huang, Min [2 ]
Ching, Wai-Ki [3 ]
Siu, Tak Kuen [4 ]
机构
[1] Northeastern Univ Qinhuangdao, Qinhuangdao 066004, Peoples R China
[2] Northeastern Univ, Coll Informat Sci & Engn, State Key Lab Integrated Automat Proc Ind, Shenyang 110819, Liaoning, Peoples R China
[3] Univ Hong Kong, Adv Modeling & Appl Comp Lab, Dept Math, Hong Kong, Hong Kong, Peoples R China
[4] Macquarie Univ, Dept Actuarial Studies, Fac Business & Econ, Sydney, NSW 2109, Australia
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Credit portfolio management; Genetic algorithm; Particle swarm optimization; Two-level particle swarm optimization; ALGORITHM; SELECTION; MODEL;
D O I
10.1016/j.ins.2013.03.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a novel Two-level Particle Swarm Optimization (TLPSO) to solve the credit portfolio management problem. A two-date credit portfolio management model is considered. The objective of the manager is to minimize the maximum expected loss of the portfolio subject to a given consulting budget constraint. The captured problem is very challenging due to its hierarchical structure and its time complexity, so the TLPSO is designed for the credit portfolio management model. The TLPSO has two searching processes, namely, "internal-search", the searching process of the maximization problem and "external-search", the searching process of the minimization problem. The performance of TLPSO is then compared with both the Genetic Algorithm (GA) and the Particle Swarm Optimization (PSO), in terms of efficient frontiers, fitness values, convergence rates, computational time consumption and reliability. The experiment results show, that TLPSO is more efficient and reliable for the credit portfolio management problem than the other tested methods. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:162 / 175
页数:14
相关论文
共 43 条
[1]   Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem [J].
Ahandani, Morteza Alinia ;
Baghmisheh, Mohammad Taghi Vakil ;
Zadeh, Mohammad Ali Badamchi ;
Ghaemi, Sehraneh .
SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7 :21-34
[2]   Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization [J].
Ali, Hamid ;
Shahzad, Waseem ;
Khan, Farrukh Aslam .
APPLIED SOFT COMPUTING, 2012, 12 (07) :1913-1928
[3]   The mean-variance cardinality constrained portfolio optimization problem: An experimental evaluation of five multiobjective evolutionary algorithms [J].
Anagnostopoulos, K. P. ;
Mamanis, G. .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (11) :14208-14217
[4]   On the optimal control of steel annealing processes via various versions of genetic and particle swarm optimization algorithms [J].
Arumugam, M. Senthil ;
Chandramohan, Aarthi ;
Murthy, Gajula Ramana .
OPTIMIZATION AND ENGINEERING, 2011, 12 (03) :371-392
[5]   Portfolio optimization with an envelope-based multi-objective evolutionary algorithm [J].
Branke, J. ;
Scheckenbach, B. ;
Stein, M. ;
Deb, K. ;
Schmeck, H. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) :684-693
[6]  
Buthainah A., 2002, MUTIPHASE PARTICLE S
[7]   Using investment satisfaction capability index based particle swarm optimization to construct a stock portfolio [J].
Chang, Jui-Fang ;
Shi, Peng .
INFORMATION SCIENCES, 2011, 181 (14) :2989-2999
[8]   The admissible portfolio selection problem with transaction costs and an improved PSO algorithm [J].
Chen, Wei ;
Zhang, Wei-Guo .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2010, 389 (10) :2070-2076
[9]   Genetic relation algorithm with guided mutation for the large-scale portfolio optimization [J].
Chen, Yan ;
Mabu, Shingo ;
Hirasawa, Kotaro .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) :3353-3363
[10]   A model of portfolio optimization using time adapting genetic network programming [J].
Chen, Yan ;
Mabu, Shingo ;
Hirasawa, Kotaro .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) :1697-1707