Optimal insurance risk allocation with steepest ascent and genetic algorithms

被引:2
|
作者
Ha, SiewMun [1 ]
机构
[1] AIR Worldwide, Decis Analyt, Boston, MA 02116 USA
关键词
Insurance; Genetic algorithms; Risk analysis; Portfolio optimization; Catastrophe risk allocation; Steepest ascent;
D O I
10.1108/15265941311301170
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
Purpose - Enhanced 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/approach - The 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. Findings - The 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/value - The 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.
引用
收藏
页码:129 / 139
页数:11
相关论文
共 50 条
  • [1] STEEPEST ASCENT ALGORITHMS FOR NONCONICAL MULTIPLE OBJECTIVE PROGRAMMING
    HAZEN, GB
    MORIN, TL
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1984, 100 (01) : 188 - 221
  • [2] Container ship stowage plan using steepest ascent hill climbing, genetic, and simulated annealing algorithms
    Yurtseven, M. A.
    Boulougouris, E.
    Turan, O.
    [J]. MARINE DESIGN XIII, VOLS 1 & 2, 2018, : 617 - 623
  • [3] Optimal allocation of statistical tolerance indices by genetic algorithms
    Otsuka, A.
    Nagata, F.
    [J]. ARTIFICIAL LIFE AND ROBOTICS, 2014, 19 (03) : 227 - 232
  • [4] Hybridisations Of Simulated Annealing And Modified Simplex Algorithms On A Path Of Steepest Ascent With Multi-Response For Optimal Parameter Settings Of ACO
    Luangpaiboon, P.
    [J]. IAENG TRANSACTIONS ON ENGINEERING TECHNOLOGIES, VOL 3, 2009, 1174 : 94 - 108
  • [5] Evaluation of the optimal steepest ascent algorithm for focusing light through turbid media
    Verma, Manish
    Liu, Quan
    [J]. OPTICAL COHERENCE IMAGING TECHNIQUES AND IMAGING IN SCATTERING MEDIA II, 2017, 10416
  • [6] TCPST allocation using optimal power flow and Genetic Algorithms
    Wirmond, Vilmair E.
    Fernandes, Thelma S. P.
    Tortelli, Odilon Luis
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2011, 33 (04) : 880 - 886
  • [7] Improving Genetic Algorithms for Optimal Land-Use Allocation
    Gharaibeh, Anne A.
    Ali, Mansoor H.
    Abo-Hammour, Zaer S.
    Al Saaideh, Mohammad
    [J]. JOURNAL OF URBAN PLANNING AND DEVELOPMENT, 2021, 147 (04)
  • [8] OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS .2. SOLUTION BY STEEPEST-ASCENT
    DENHAM, WF
    BRYSON, AE
    [J]. AIAA JOURNAL, 1964, 2 (01) : 25 - 34
  • [9] The Optimal Allocation of Distributed Generation with Nash Equilibrium based on Genetic Algorithms
    Yang, Guohua
    Wei, Ningbo
    Wang, Pengzhen
    Qin, Junqin
    Wang, Jinmei
    [J]. 2016 INTERNATIONAL CONFERENCE ON POWER ENGINEERING & ENERGY, ENVIRONMENT (PEEE 2016), 2016, : 57 - 61
  • [10] Genetic algorithms for hardware-software partitioning and optimal resource allocation
    Purnaprajna, Madhura
    Reformat, Marek
    Pedrycz, Witold
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2007, 53 (07) : 339 - 354