Determination of Optimal Portfolio by Calculating Transaction Costs using Genetic Algorithms on the Jakarta Islamic Index

The optimal portfolio is a portfolio that can provide maximum returns at the same level of risk. In investing, the term "high return, high risk" is known, meaning that the higher the return, the higher the risk. Therefore, investors need to develop an optimal portfolio to obtain the maximum return on investment at the same level of risk. This study aims to determine the optimal formation of a stock portfolio by calculating transaction costs using the genetic algorithm method on stocks that are members of the Jakarta Islamic Index. This research uses data of daily return on stocks included in Jakarta Islamic Index from 1 August 2020-1 August 2022. The dataset consists of two variables: the date of observation and daily stock returns. The method used in this study is the minimum variance method and the genetic algorithm. Data analysis was divided into two stages: model formulation and model testing through case studies. The analysis of optimal portfolio formation using genetic algorithms shows that in terms of performance, the minimum variance portfolio is superior to the genetic algorithm portfolio, as indicated by the Sharpe ratio value. Meanwhile, the genetic algorithm portfolio is superior to the minimum variance portfolio regarding transaction costs. The genetic algorithm portfolio can provide a fairly high total return, small transaction costs, and good performance compared to the minimum portfolio. Hence, the genetic algorithm portfolio is worthy of recommendation to investors

Identification of Two-shaft Gas Turbine Variables Using a Decoupled Multi-model Approach With Genetic Algorithm

In industrial practice, the representation of the dynamics of nonlinear systems by models linking their different operating variables requires an identification procedure to characterize their behavior from experimental data. This article proposes the identification of the variables of a two-shafts gas turbine based on a decoupled multi-model approach with genetic algorithm. Hence the multi-model is determined in the form of a weighted combination of the decoupled linear local state space sub-models, with optimization of an objective cost function in different modes of operation of this machine. This makes it possible to have robust and reliable models using input / output data collected on the examined system, limiting the influence of errors and identification noises

Markowitz-based cardinality constrained portfolio selection using Asexual Reproduction Optimization (ARO)

The Markowitz-based portfolio selection turns to an NP-hard problem when considering cardinality constraints. In this case, existing exact solutions like quadratic programming may not be efficient to solve the problem. Many researchers, therefore, used heuristic and metaheuristic approaches in order to deal with the problem. This work presents Asexual Reproduction Optimization (ARO), a model free metaheuristic algorithm inspired by the asexual reproduction, in order to solve the portfolio optimization problem including cardinality constraint to ensure the investment in a given number of different assets and bounding constraint to limit the proportions of fund invested in each asset. This is the first time that this relatively new metaheuristic is in the field of portfolio optimization, and we show that ARO results in better quality solutions in comparison with some of the well-known metaheuristics stated in the literature. To validate our proposed algorithm, we measured the deviation of obtained results from the standard efficient frontier. We report our computational results on a set of publicly available benchmark test problems relating to five main market indices containing 31, 85, 89, 98, and 225 assets. These results are used in order to test the efficiency of our proposed method in comparison to other existing metaheuristic solutions. The experimental results indicate that ARO outperforms Genetic Algorithm(GA), Tabu Search (TS), Simulated Annealing (SA), and Particle Swarm Optimization (PSO) in most of test problems. In terms of the obtained error, by using ARO, the average error of the aforementioned test problems is reduced by approximately 20 percent of the minimum average error calculated for the above-mentioned algorithms