{"title":"基于归档多目标模拟退火的双目标投资组合优化","authors":"Tanmay Sen, S. Saha, Asif Ekbal, A. Laha","doi":"10.1109/ICHPCA.2014.7045343","DOIUrl":null,"url":null,"abstract":"In the current paper, Bi-objective portfolio optimization problem has been tackled using multiobjective optimization framework. Three popular multiobjective optimization algorithms are used for solving this problem. These are: Archive Multi-objective Simulated Annealing (AMOSA) algorithm, Non-dominated Sorting Genetic algorithm II (NSGA-II) and Multi-objective Particle Swarm Optimization using Crowding distance (MOPSOCD). For each algorithm we trace the Pareto optimal front and compare the results by using four comparisons metrics, Spread, Spacing, Set Coverage and Maximum Spread. Comparative results show that NSGA-II performs the best as compared to the other two algorithms.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Bi-objective portfolio optimization using Archive Multi-objective Simulated Annealing\",\"authors\":\"Tanmay Sen, S. Saha, Asif Ekbal, A. Laha\",\"doi\":\"10.1109/ICHPCA.2014.7045343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the current paper, Bi-objective portfolio optimization problem has been tackled using multiobjective optimization framework. Three popular multiobjective optimization algorithms are used for solving this problem. These are: Archive Multi-objective Simulated Annealing (AMOSA) algorithm, Non-dominated Sorting Genetic algorithm II (NSGA-II) and Multi-objective Particle Swarm Optimization using Crowding distance (MOPSOCD). For each algorithm we trace the Pareto optimal front and compare the results by using four comparisons metrics, Spread, Spacing, Set Coverage and Maximum Spread. Comparative results show that NSGA-II performs the best as compared to the other two algorithms.\",\"PeriodicalId\":197528,\"journal\":{\"name\":\"2014 International Conference on High Performance Computing and Applications (ICHPCA)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on High Performance Computing and Applications (ICHPCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICHPCA.2014.7045343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICHPCA.2014.7045343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
本文采用多目标优化框架来解决双目标投资组合优化问题。三种常用的多目标优化算法用于解决该问题。这些算法包括:存档多目标模拟退火(AMOSA)算法、非支配排序遗传算法II (NSGA-II)和基于拥挤距离的多目标粒子群优化(MOPSOCD)。对于每种算法,我们都跟踪了Pareto最优前沿,并通过使用四个比较指标(Spread, Spacing, Set Coverage和Maximum Spread)来比较结果。对比结果表明,与其他两种算法相比,NSGA-II算法的性能最好。
Bi-objective portfolio optimization using Archive Multi-objective Simulated Annealing
In the current paper, Bi-objective portfolio optimization problem has been tackled using multiobjective optimization framework. Three popular multiobjective optimization algorithms are used for solving this problem. These are: Archive Multi-objective Simulated Annealing (AMOSA) algorithm, Non-dominated Sorting Genetic algorithm II (NSGA-II) and Multi-objective Particle Swarm Optimization using Crowding distance (MOPSOCD). For each algorithm we trace the Pareto optimal front and compare the results by using four comparisons metrics, Spread, Spacing, Set Coverage and Maximum Spread. Comparative results show that NSGA-II performs the best as compared to the other two algorithms.