Optimal Portfolio Using a Genetic Algorithm

Distributing the amount of money to invest in each stock of a portfolio, while maximizing profit and minimizing risk is key. This project applied the method of a genetic algorithm in order to select an optimal portfolio. A genetic algorithm generates solutions to optimization problems using techniques inspired by natural evolution. A five stock, five years’ portfolio was utilized in order to demonstrate the efficiency of a genetic algorithm. The most important steps of this method were the fitness function and the crossover. The fitness function is a formula that determined the effectiveness of the portfolio distribution; it returned a value for each portfolio distribution and the higher the value the better the distribution. The fitness function allowed us to rank and sort the generated distributions. Then, the crossover was performed in order to see how the genetic algorithm converges towards the optimal solution. The best portfolio distributions, according to the fitness function, were used for the crossover in order to generate even better distributions. Crossover was executed a couple of times by generating new generations of distributions, until the best distribution was produced. The best distribution produced a twenty-five percent average return and its computing time was eleven minutes

Soft computing techniques applied to finance

Soft computing is progressively gaining presence in the financial world. The number of real and potential applications is very large and, accordingly, so is the presence of applied research papers in the literature. The aim of this paper is both to present relevant application areas, and to serve as an introduction to the subject. This paper provides arguments that justify the growing interest in these techniques among the financial community and introduces domains of application such as stock and currency market prediction, trading, portfolio management, credit scoring or financial distress prediction areas.Publicad

Heuristic Optimisation in Financial Modelling

There is a large number of optimisation problems in theoretical and applied finance that are difficult to solve as they exhibit multiple local optima or are not ‘well- behaved’ in other ways (eg, discontinuities in the objective function). One way to deal with such problems is to adjust and to simplify them, for instance by dropping constraints, until they can be solved with standard numerical methods. This paper argues that an alternative approach is the application of optimisation heuristics like Simulated Annealing or Genetic Algorithms. These methods have been shown to be capable to handle non-convex optimisation problems with all kinds of constraints. To motivate the use of such techniques in finance, the paper presents several actual problems where classical methods fail. Next, several well-known heuristic techniques that may be deployed in such cases are described. Since such presentations are quite general, the paper describes in some detail how a particular problem, portfolio selection, can be tackled by a particular heuristic method, Threshold Accepting. Finally, the stochastics of the solutions obtained from heuristics are discussed. It is shown, again for the example from portfolio selection, how this random character of the solutions can be exploited to inform the distribution of computations.Optimisation heuristics, Financial Optimisation, Portfolio Optimisation