Abstract
PurposeEnhanced risk management through the application of mathematical optimization is the next competitive‐advantage frontier for the primary‐insurance industry. The widespread adoption of catastrophe models for risk management provides the opportunity to exploit mathematical optimization techniques to achieve superior financial results over traditional methods of risk allocation. The purpose of this paper is to conduct a numerical experiment to evaluate the relative performances of the steepest‐ascent method and genetic algorithm in the solution of an optimal risk‐allocation problem in primary‐insurance portfolio management.Design/methodology/approachThe performance of two well‐established optimization methods – steepest ascent and genetic algorithm – are evaluated by applying them to solve the problem of minimizing the catastrophe risk of a US book of policies while concurrently maintaining a minimum level of return.FindingsThe steepest‐ascent method was found to be functionally dependent on, but not overly sensitive to, choice of initial starting policy. The genetic algorithm produced a superior solution to the steepest‐ascent method at the cost of increased computation time.Originality/valueThe results provide practical guidelines for algorithm selection and implementation for the reader interested in constructing an optimal insurance portfolio from a set of available policies.
Reference9 articles.
1. Bäck, T. (1996), Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms, Oxford University Press, New York, NY.
2. Cauchy, A. (1847), “Méthode générale pour la résolution des systèmes d'équations simultanées”, Comptes Rendus Hebd. Séeances Acad. Sci., Vol. 25, pp. 536‐8.
3. Hacker, K.A., Eddy, J. and Lewis, K.E. (2002), “Efficient global optimization using hybrid genetic algorithms”, paper presented at 9th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Atlanta, GA.
4. Holland, J.H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
5. Kellerer, H., Pferschy, U. and Pisinger, D. (2004), Knapsack Problems, Springer, Berlin.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献