QPSO algorithm based on Lévy flight and its application in fuzzy portfolio
To solve constrained portfolio selection model effectively, an improved quantum-behaved particle swarm optimization algorithm(LQPSO) is presented. Firstly, considering its practicality in real dealing process, a class of fuzzy portfolio models with transaction costs and background risk is establishe...
Uloženo v:
| Vydáno v: | Applied soft computing Ročník 99; s. 106894 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.02.2021
|
| Témata: | |
| ISSN: | 1568-4946, 1872-9681 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | To solve constrained portfolio selection model effectively, an improved quantum-behaved particle swarm optimization algorithm(LQPSO) is presented. Firstly, considering its practicality in real dealing process, a class of fuzzy portfolio models with transaction costs and background risk is established. Then in the design of improved algorithm, Lévy flight strategy and contraction–expansion coefficient with nonlinear structure are taken into account for enhancing particle’s exploration ability, and premature prevention mechanism is used to increase population diversity. According to the following performance test, LQPSO demonstrates better convergence and robustness than PSO with inertia weight, QPSO and QPSO with a hybrid probability distribution in 12 benchmark functions. Furthermore, experimental results indicate that LQPSO outperforms several metaheuristics when seeking optimal solution for the fuzzy portfolio model with constraints.
•A class of fuzzy portfolio models with transaction costs and background risk is developed.•Lévy flight strategy is taken into account for enhancing particle’s exploration ability.•Contraction-expansion coefficient with nonlinear structure is considered to improve convergency speed.•Premature prevention mechanism is used to increase population diversity.•Compared with six metaheuristics, the improved algorithm is more robust and effective in experimental application. |
|---|---|
| ISSN: | 1568-4946 1872-9681 |
| DOI: | 10.1016/j.asoc.2020.106894 |