English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4086580      Online Users : 846
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/114695


    Title: A study on the island-based grouping genetic algorithms for diverse group stock portfolio optimization
    Other Titles: 島群為基礎的群組遺傳演算法於多樣群組股票投資組合最佳化之研究
    Authors: 沈婉怡;Shen, Wan-Yi
    Contributors: 淡江大學資訊工程學系資訊網路與多媒體碩士班
    陳俊豪
    Keywords: diverse group stock portfolio;grouping problem;Island-based grouping genetic algorithm;maximally diverse grouping problem;portfolio optimization;分組問題;多樣群組股票投資組合;投資組合最佳化;島群群組遺傳演算法;最大多樣性分群問題
    Date: 2017
    Issue Date: 2018-08-03 15:01:01 (UTC+8)
    Abstract: 投資組合最佳化問題一直是相當有趣且值得研究的議題。投資組合的標的範圍相當多元,包含:債券、基金、股票等,一個合適的投資組合不僅可提升獲利能力,更能有效的分散風險。故至今已有相當多的演算法被提出用來解決投資組合最佳化問題。其中,考量可提供的投資組合數量與多樣性,透過群組遺傳演算法,許多演算法亦設計用於最佳化群組股票投資組合(group stock portfolio)或多樣群組股票投資組合(diverse group stock portfolio)並藉此提供不同的選擇給使用者制定投資策略。而當母體變大時,演化時間會相當耗時是現有方法的共同問題。故本論文提出兩個島群為基礎的最佳化方法來解決這個問題,分別為:整合式與各個擊破式島群為基礎的最佳化技術。
    方法一使用島嶼式群組遺傳演算法解決多樣群組股票投資組合最佳化問題,主要可分為兩階段:(1)多樣群組股票投資組合演化階段;(2)島嶼間個體遷徙階段。在第一階段,首先,每個島嶼會根據個股的現金股利產生初始母體,而每一個體則透過群組、股票與股票組合三部分來表示。接著,方法執行三種遺傳運算來產生新的個體,包括:交配、突變與反轉。此階段演化過程,每固定演化t世代時將觸發第二階段–島嶼間個體遷徙。在第二階段,每個島嶼的最佳個體將被送至主控島嶼,之後主控島嶼將收集的最佳個體遷移至各島嶼。此兩階段將持續執行直到符合結束條件。
    然而,當股票家數大幅增加時,方法一常無法有效的找出多樣群組股票投資組合,因此,方法二採用各個擊破策略的島群為基礎的最佳化技術油然而生。相較與方法一,方法二仍然分為兩階段,其主要的不同處在於兩機制:(1)島嶼初始母體產生機制;(2)島嶼母體同步機制。在島嶼初始母體產生機制部分,不同於第一個方法使用全部的n家股票,每各島嶼僅隨機選擇m家股票產生初始母體,如此每個島嶼的搜尋空間將大幅減少。但是也因此造成個體遷移後股票不盡相同,此問題則進一步透過島嶼母體同步機制調整。島嶼母體同步機制首先將保留新舊個體中皆出現的股票,如不足m家股票時,則從剩餘股票選擇風險較低的股票補足。由此,每個島嶼皆有機會得到最佳個體與來自其它島嶼的新股票。
    最後,實驗結果透過兩組真實股市資料皆驗證可有效改善問題,當母體大小增加時,方法一相較於現存方法可得到相似甚至更好的報酬;當股票家數增加時,方法二也能有效提升搜尋的效率及效能。
    Portfolio optimization is always an interesting and valuable research issue. Assets of portfolio are various, including bonds, funds, stocks, etc. A suitable portfolio can not only increase profitability but also decrease risk effectively. There are already many existing researches have been presented to solve portfolio optimization problems. Considering number and diversity of portfolios can be provided to users, using the grouping genetic algorithm, many algorithms have also been designed to optimize group stock portfolio or diverse group stock portfolio that can provide different ways to investors making investment strategies. Evolution process will take time when the population becomes bigger is a common problem in existing approaches. This thesis proposes two island-based approaches, integrated and divide-and-conquer approaches, to deal with this problem.
    In first approach, it utilizes island-based grouping genetic algorithm to solve the diverse group stock portfolio optimization problem. It includes two phases that chromosome evolution phase and chromosome migration phase. In the first phase, each island generates initial population in accordance with cash dividends. A chromosome is represented by the grouping part, stock part, and stock portfolio part. Then, three genetic operations are executed, including crossover, mutation and inversion, to generate offspring. During the evolution, the second phase will be started when the migration period t is reached in first phase. In second phase, the best individual in every island is sent to master island. Master island then migrates those best chromosomes to islands. These two phases are repeated until stop condition is reached.
    However, the first approach usually cannot find an effective way to find a diverse group stock portfolio when number of stocks is increase. Hence, the second approach that uses divide-and-conquer strategy is proposed to handle this problem. Comparing with the first approach, the two main differences are: (1) the island initial population initialization mechanism; (2) the island stock synchronization mechanism. Instead using all n stocks to generate initial population in the first approach, only m stocks are randomly selected to initialize initial population for each island, and because of that, the searching space is reduced in every island in second approach. Since m stock is used, stocks may different in every island after chromosome migration, the island stock synchronization mechanism is then used to fix it. The stocks appear in new and old chromosomes are kept for every island. If number of kept stocks is smaller than m, the gap will be filled with low risky stocks. Therefore, every island has chance to get best individual and stocks from other islands.
    At last, experimental results made on two real datasets show that the proposed approaches can solve the problems significantly. Compare to existing approaches, the first approach can reach similar or even better returns when population size is increased; Besides, the effectiveness and efficiency of the second approach can also be improved when number of stocks is increased.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML92View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback