A Hybrid Particle Swarm Optimization Approach and its Application to Solving Portfolio Selection Problems

Author(s):  
Shamshul Bahar Yaakob ◽  
◽  
Junzo Watada ◽  

In modern portfolio theory, the basic topic is how to construct a diversified portfolio of financial securities to improve trade-offs between risk and return. The objective of this paper is to apply a heuristic algorithm using Particle Swarm Optimization (PSO) to the portfolio selection problem. PSO makes the search algorithm efficient by combining a local search method through self-experience with the global search method through neighboring experience. PSO attempts to balance the exploration-exploitation tradeoff that achieves efficiency and accuracy of optimization. In this paper, a newly obtained approach is proposed by making simple modifications to the standard PSO: the velocity is controlled and the mutation operator of Genetic Algorithms (GA) is added to solve a stagnation problem. Our adaptation and implementation of the PSO search strategy are applied to portfolio selection. Results of typical applications demonstrate that the Velocity Control Hybrid PSO (VC-HPSO) proposed in this study effectively finds optimum solution to portfolio selection problems. Results also show that our proposed method is a viable approach to portfolio selection.

Energies ◽  
2019 ◽  
Vol 12 (16) ◽  
pp. 3052 ◽  
Author(s):  
Ali Ahmadian ◽  
Ali Elkamel ◽  
Abdelkader Mazouz

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing the total cost of the objective function with technical constraints make it a combinatorial problem which should be solved by powerful optimization algorithms. In this paper, a new improved hybrid Tabu search/particle swarm optimization algorithm is proposed to optimize the electric expansion planning. The proposed method is analyzed both mathematically and experimentally and it is applied to three different electric distribution networks as case studies. Numerical results and comparisons are presented and show the efficiency of the proposed algorithm. As a result, the proposed algorithm is more powerful than the other algorithms, especially in larger dimension networks.


Author(s):  
Chunli Zhu ◽  
Yuan Shen ◽  
Xiujun Lei

Traditional template matching-based motion estimation is a popular but time-consuming method for vibration vision measurement. In this study, the particle swarm optimization (PSO) algorithm is improved to solve this time-consumption problem. The convergence speed of the algorithm is increased using the adjacent frames search method in the particle swarm initialization process. A flag array is created to avoid repeated calculation in the termination strategy. The subpixel positioning accuracy is ensured by applying the surface fitting method. The robustness of the algorithm is ensured by applying the zero-mean normalized cross correlation. Simulation results demonstrate that the average extraction error of the improved PSO algorithm is less than 1%. Compared with the commonly used three-step search algorithm, diamond search algorithm, and local search algorithm, the improved PSO algorithm consumes the least number of search points. Moreover, tests on real-world image sequences show good estimation accuracy at very low computational cost. The improved PSO algorithm proposed in this study is fast, accurate, and robust, and is suitable for plane motion estimation in vision measurement.


Sign in / Sign up

Export Citation Format

Share Document