Please use this identifier to cite or link to this item:

Title: Swarm Intelligence for Cardinality-Constrained Portfolio Problems
Authors: 林我聰
Deng, Guang-Feng;Lin, Woo-Tsong
Contributors: 資管系
Keywords: Particle swarm optimization;cardinality constrained portfolio optimization problem;Markowitz mean-variance model;nonlinear mixed quadratic programming problem;swarm intelligence
Date: 2010-11
Issue Date: 2014-02-18 15:18:20 (UTC+8)
Abstract: This work presents Particle Swarm Optimization (PSO), a collaborative population-based swarm intelligent algorithm for solving the cardinality constraints portfolio optimization problem (CCPO problem). To solve the CCPO problem, the proposed improved PSO increases exploration in the initial search steps and improves convergence speed in the final search steps. Numerical solutions are obtained for five analyses of weekly price data for the following indices for the period March, 1992 to September, 1997: Hang Seng 31 in Hong Kong, DAX 100 in Germany, FTSE 100 in UK, S&P 100 in USA and Nikkei 225 in Japan. The computational test results indicate that the proposed PSO outperformed basic PSO algorithm, genetic algorithm (GA), simulated annealing (SA), and tabu search (TS) in most cases.
Relation: Lecture Notes in Artificial Intelligence, 6423, 406-415
Source URI:
Data Type: article
DOI 連結:
Appears in Collections:[資訊管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
406415.pdf256KbAdobe PDF908View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing