317 research outputs found

    A survey on financial applications of metaheuristics

    Get PDF
    Modern heuristics or metaheuristics are optimization algorithms that have been increasingly used during the last decades to support complex decision-making in a number of fields, such as logistics and transportation, telecommunication networks, bioinformatics, finance, and the like. The continuous increase in computing power, together with advancements in metaheuristics frameworks and parallelization strategies, are empowering these types of algorithms as one of the best alternatives to solve rich and real-life combinatorial optimization problems that arise in a number of financial and banking activities. This article reviews some of the works related to the use of metaheuristics in solving both classical and emergent problems in the finance arena. A non-exhaustive list of examples includes rich portfolio optimization, index tracking, enhanced indexation, credit risk, stock investments, financial project scheduling, option pricing, feature selection, bankruptcy and financial distress prediction, and credit risk assessment. This article also discusses some open opportunities for researchers in the field, and forecast the evolution of metaheuristics to include real-life uncertainty conditions into the optimization problems being considered.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER, and the Universitat Jaume I mobility program (E-2015-36)

    Mining a Small Medical Data Set by Integrating the Decision Tree and t-test

    Get PDF
    [[abstract]]Although several researchers have used statistical methods to prove that aspiration followed by the injection of 95% ethanol left in situ (retention) is an effective treatment for ovarian endometriomas, very few discuss the different conditions that could generate different recovery rates for the patients. Therefore, this study adopts the statistical method and decision tree techniques together to analyze the postoperative status of ovarian endometriosis patients under different conditions. Since our collected data set is small, containing only 212 records, we use all of these data as the training data. Therefore, instead of using a resultant tree to generate rules directly, we use the value of each node as a cut point to generate all possible rules from the tree first. Then, using t-test, we verify the rules to discover some useful description rules after all possible rules from the tree have been generated. Experimental results show that our approach can find some new interesting knowledge about recurrent ovarian endometriomas under different conditions.[[journaltype]]ćœ‹ć€–[[incitationindex]]EI[[booktype]]çŽ™æœŹ[[countrycodes]]FI

    Optimization Heuristics for Determining Internal Rating Grading Scales

    Get PDF
    Basel II imposes regulatory capital on banks related to the default risk of their credit portfolio. Banks using an internal rating approach compute the regulatory capital from pooled probabilities of default. These pooled probabilities can be calculated by clustering credit borrowers into different buckets and computing the mean PD for each bucket. The clustering problem can become very complex when Basel II regulations and real-world constraints are taken into account. Search heuristics have already proven remarkable performance in tackling this problem as complex as it is. A Threshold Accepting algorithm is proposed, which exploits the inherent discrete nature of the clustering problem. This algorithm is found to outperform alternative methodologies already proposed in the literature, such as standard k-means and Differential Evolution. Besides considering several clustering objectives for a given number of buckets, we extend the analysis further by introducing new methods to determine the optimal number of buckets in which to cluster banks' clients.credit risk, probability of default, clustering, Threshold Accepting, Differential Evolution

    Optimization Heuristics for Determining Internal Rating Grading Scales

    Get PDF
    Basel II imposes regulatory capital on banks related to the default risk of their credit portfolio. Banks using an internal rating approach compute the regulatory capital from pooled probabilities of default. These pooled probabilities can be calculated by clustering credit borrowers into different buckets and computing the mean PD for each bucket. The clustering problem can become very complex when Basel II regulations and real-world constraints are taken into account. Search heuristics have already proven remarkable performance in tackling this problem as complex as it is. A Threshold Accepting algorithm is proposed, which exploits the inherent discrete nature of the clustering problem. This algorithm is found to outperform alternative methodologies already proposed in the literature, such as standard k-means and Differential Evolution. Besides considering several clustering objectives for a given number of buckets, we extend the analysis further by introducing new methods to determine the optimal number of buckets in which to cluster banks' clients.credit risk, probability of default, clustering, Threshold Accepting, Differential Evolution

    A literature review on the application of evolutionary computing to credit scoring

    Get PDF
    The last years have seen the development of many credit scoring models for assessing the creditworthiness of loan applicants. Traditional credit scoring methodology has involved the use of statistical and mathematical programming techniques such as discriminant analysis, linear and logistic regression, linear and quadratic programming, or decision trees. However, the importance of credit grant decisions for financial institutions has caused growing interest in using a variety of computational intelligence techniques. This paper concentrates on evolutionary computing, which is viewed as one of the most promising paradigms of computational intelligence. Taking into account the synergistic relationship between the communities of Economics and Computer Science, the aim of this paper is to summarize the most recent developments in the application of evolutionary algorithms to credit scoring by means of a thorough review of scientific articles published during the period 2000–2012.This work has partially been supported by the Spanish Ministry of Education and Science under grant TIN2009-14205 and the Generalitat Valenciana under grant PROMETEO/2010/028

    From metaheuristics to learnheuristics: Applications to logistics, finance, and computing

    Get PDF
    Un gran nombre de processos de presa de decisions en sectors estratĂšgics com el transport i la producciĂł representen problemes NP-difĂ­cils. Sovint, aquests processos es caracteritzen per alts nivells d'incertesa i dinamisme. Les metaheurĂ­stiques sĂłn mĂštodes populars per a resoldre problemes d'optimitzaciĂł difĂ­cils en temps de cĂ lcul raonables. No obstant aixĂČ, sovint assumeixen que els inputs, les funcions objectiu, i les restriccions sĂłn deterministes i conegudes. Aquests constitueixen supĂČsits forts que obliguen a treballar amb problemes simplificats. Com a conseqĂŒĂšncia, les solucions poden conduir a resultats pobres. Les simheurĂ­stiques integren la simulaciĂł a les metaheurĂ­stiques per resoldre problemes estocĂ stics d'una manera natural. AnĂ logament, les learnheurĂ­stiques combinen l'estadĂ­stica amb les metaheurĂ­stiques per fer front a problemes en entorns dinĂ mics, en quĂš els inputs poden dependre de l'estructura de la soluciĂł. En aquest context, les principals contribucions d'aquesta tesi sĂłn: el disseny de les learnheurĂ­stiques, una classificaciĂł dels treballs que combinen l'estadĂ­stica / l'aprenentatge automĂ tic i les metaheurĂ­stiques, i diverses aplicacions en transport, producciĂł, finances i computaciĂł.Un gran nĂșmero de procesos de toma de decisiones en sectores estratĂ©gicos como el transporte y la producciĂłn representan problemas NP-difĂ­ciles. Frecuentemente, estos problemas se caracterizan por altos niveles de incertidumbre y dinamismo. Las metaheurĂ­sticas son mĂ©todos populares para resolver problemas difĂ­ciles de optimizaciĂłn de manera rĂĄpida. Sin embargo, suelen asumir que los inputs, las funciones objetivo y las restricciones son deterministas y se conocen de antemano. Estas fuertes suposiciones conducen a trabajar con problemas simplificados. Como consecuencia, las soluciones obtenidas pueden tener un pobre rendimiento. Las simheurĂ­sticas integran simulaciĂłn en metaheurĂ­sticas para resolver problemas estocĂĄsticos de una manera natural. De manera similar, las learnheurĂ­sticas combinan aprendizaje estadĂ­stico y metaheurĂ­sticas para abordar problemas en entornos dinĂĄmicos, donde los inputs pueden depender de la estructura de la soluciĂłn. En este contexto, las principales aportaciones de esta tesis son: el diseño de las learnheurĂ­sticas, una clasificaciĂłn de trabajos que combinan estadĂ­stica / aprendizaje automĂĄtico y metaheurĂ­sticas, y varias aplicaciones en transporte, producciĂłn, finanzas y computaciĂłn.A large number of decision-making processes in strategic sectors such as transport and production involve NP-hard problems, which are frequently characterized by high levels of uncertainty and dynamism. Metaheuristics have become the predominant method for solving challenging optimization problems in reasonable computing times. However, they frequently assume that inputs, objective functions and constraints are deterministic and known in advance. These strong assumptions lead to work on oversimplified problems, and the solutions may demonstrate poor performance when implemented. Simheuristics, in turn, integrate simulation into metaheuristics as a way to naturally solve stochastic problems, and, in a similar fashion, learnheuristics combine statistical learning and metaheuristics to tackle problems in dynamic environments, where inputs may depend on the structure of the solution. The main contributions of this thesis include (i) a design for learnheuristics; (ii) a classification of works that hybridize statistical and machine learning and metaheuristics; and (iii) several applications for the fields of transport, production, finance and computing

    State-of-the-Art Renewable Energy in Korea

    Get PDF
    Nowadays, renewable energy plays an important role in our daily lives. This Special Issue addresses the current trend in the use of renewable energy in South Korea. The first aspect is a renewable-based power system, where both main and ancillary supplies are sourced from renewable energies; the second aspect is a distribution network for renewable energy; and the last aspect is a nanogrid network technology. Renewable energy requires many innovations over existing power infrastructure and regulation. These articles show the changing trend in various sectors in Korea

    Cash flow optimization for construction engineering portfolios

    Get PDF
    One of the main issues in construction projects is finance; proper cash-flow management is necessary to insure that a construction project finishes within time, on budget, and yielding a satisfying profit. Poor financial management might put the contractor, or the owner, in a situation where they are unable to finance the project due to insufficient liquidity, or where they are engaged in excessive loans to finance the project, decreasing the profit, and even creating unsettled debts. Engagement with a portfolio of large construction projects, like infrastructure projects, makes attention to finance more critical, due to large budgets and long project durations, which also requires attention to the time value of money when the project spans over many years and the work environment has a high inflation rate. This thesis aims at the analysis and optimization of the cash-flow request for large engineering portfolios from the contractor\u27s point of view. A computational model, with a friendly user interface, was created to achieve that. The user is able to create a portfolio of projects, and create activities in them with different relationship types, lags, constraints, and costs, as similar to commercial scheduling software. Parameters necessary for the renumeration are also considered, which include the down payment percentage, duration between invoices, duration for payment, retention percentage, etc. The model takes into consideration the time value of money, calculated with an interest rate assigned to the projects by the user; this could be the inflation rate or the (Minimum Attractive Rate of Return) MARR of the contractor. Optimization is done with the objective of maximizing the Net Present Value (NPV) for the projects as a whole, discounted at the start of the portfolio. The variables for the optimization are lags that are assigned for each activity, which, after rescheduling, delays the activities after their early start with the value of those lags, and thus creates a modified cash flow for the project. Optimization of those variables, within scheduling constraints results in a near-optimum NPV. Verification of the model was done using sets of portfolios, and the validation was done using an actual construction portfolio from real life. The results were satisfactory and matched initial expectations. The NPV was successfully optimized to a near optimum. A sensitivity analysis of the model was conducted and it showed that the model behaves as expected for different inputs. A time test was performed, taking into consideration the effect of the size and complexity of a portfolio on the calculation time for the model, and it showed that the speed was satisfactory, though it should be improved. Overall, the conclusion is that the model delivers its goal of maximizing the Net Present Value of a large portfolio as a whole
    • 

    corecore