English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88866/118573 (75%)
Visitors : 23554515      Online Users : 217
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/76510
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/76510


    Title: Applying particle swarm optimization to solve portfolio selection problems
    Authors: Deng, Guang-Feng;Chen, Chuen-Lung
    鄧廣豐;陳春龍
    Contributors: 資管系
    Keywords: Computational results;Efficient frontier;Evolutionary computation techniques;Library data;Markowitz;Mean variance;Mean-variance approach;Optimization problems;Particle swarm;Portfolio selection;Portfolio selection problems;Search Algorithms;Electronic commerce;Genetic algorithms;Particle swarm optimization (PSO);Simulated annealing;Tabu search;Problem solving
    Date: 2007
    Issue Date: 2015-07-13 16:05:30 (UTC+8)
    Abstract: Particle swarm optimization (PSO), introduced by Kennedy and Eberhart in 1995, is a social population-based search algorithm and is generally similar to the evolutionary computation techniques that have been successfully applied to solve various hard optimization problems. The standard Markowitz mean-variance approach to portfolio selection involves tracing out an efficient frontier, a continuous curve illustrating the tradeoff between return and risk. In this paper we applied the particle swarm approach to find an efficient frontier associated with the classical and general (unconstrained and constrained) mean-variance portfolio selection problem. The OR library data sets were tested in our paper and computational results showed that the PSO found better solutions when compared to genetic algorithm (GA), simulated annealing(SA), and tabu search(TS).
    Relation: Proceedings of the International Conference on Electronic Business (ICEB)
    7th International Conference on Electronic Business, ICEB 2007,2 December 2007 through 6 December 2007,Taipei
    Data Type: conference
    Appears in Collections:[資訊管理學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML570View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback