portfolio optimization with simulated annealing algorithm

نویسندگان

سعید قدوسی

کارشناس‎ارشد مدیریت مالی، دانشگاه تهران، تهران، ایران رضا تهرانی

دانشیار مدیریت مالی، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران مهدی بشیری

دانشیار مهندسی صنایع، دانشکدۀ فنی دانشگاه شاهد، تهران، ایران

چکیده

the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum current assets on portfolios. this study aims to solve the problem of optimizing portfolios with cardinality constrains, using simulated annealing algorithm. therefore, by using the information of 50 companies which have been more active in tehran’s exchange stock from april 2010 to april 2012, portfolios’ efficient frontier has been supposed from 10 to 50. results shows that first, simulated annealing algorithm has been successful in solving the above problem, and second, by selecting shares appropriately and determining suitable weights from it, smaller portfolios with more suitable performances can be selected.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust optimization with simulated annealing

Complex systems can be optimized to improve the performance with respect to desired functionalities. An optimized solution, however, can become suboptimal or even infeasible, when errors in implementation or input data are encountered. We report on a robust simulated annealing algorithm that does not require any knowledge of the problems structure. This is necessary in many engineering applicat...

متن کامل

Continious Optimization Problem Solution with Simulated Annealing and Genetic Algorithm

Simulated Annealing and Genetic Algorithm are two well-known metaheuristic algorithms for combinatorial optimization. These two methods have also been used for solving constrained continuous problems. In this study, five constrained continuous problems have been solved both Simulated Annealing (SA) and Genetic Algorithm (GA). Optimum results have been compared with real optimum values obtained ...

متن کامل

Comparative Analysis of Bacterial Foraging Optimization Algorithm with Simulated Annealing

Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for optimization and control. BFOA is inspired by the social foraging behavior of Escherichia coli. BFOA has already drawn the attention of researchers because of its efficiency in solving real-world optimization problems arising in several application domains. Simula...

متن کامل

Optimization by simulated annealing.

There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...

متن کامل

Algorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?

This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...

متن کامل

Simulated annealing for complex portfolio selection problems

This paper describes the application of a simulated annealing approach to the solution of a complex portfolio selection model. The model is a mixed integer quadratic programming problem which arises when Markowitz classical mean–variance model is enriched with additional realistic constraints. Exact optimization algorithms run into difficulties in this framework and this motivates the investiga...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023