Abstract
The purpose of this paper is to revisit the Multiobjective Population-Based Incremental Learning method and show how its performance can be improved in the context of a real-world financial optimization problem. The proposed enhancements lead to both better performance and improvements in the quality of solutions. Its performance was assessed in terms of runtime and speedup when parallelized. Also, metrics such as the average number of solutions, the average hypervolume, and coverage have been used in order to compare the Pareto frontiers obtained by both the original and enhanced methods. Results indicated that the proposed method is 22.1 % faster, present more solutions in the average (better defining the Pareto frontier) and often generates solutions having larger hypervolumes. The enhanced method achieves a speedup of 15.7 on 16 cores of a dual socket Intel multi-core machine when solving a Reinsurance Contract Optimization problem involving 15 Layers or sub-contracts.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In probability theory, the expected value, usually denoted by E[X], refers to the value of a random variable X that we would “expect” to find out if we could repeat the random variable process an infinite number of times and take the average of the values obtained.
References
Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)
Storn, R., Price, K.: Differential evolution: A simple and efficient adaptive scheme for global optimization over continuous spaces (1995)
Michalewicz, Z.: Genetic Algorithms + Data Structure = Evolution Programs. 3rd edn (1999)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)
Baluja, S.: Population based incremental learning (1994)
Servais, M., de Jager, G., Greene, J.R.: Function optimisation using multiple-base population based incremental learning. In: The Eighth Annual South African Workshop on Pattern Recognition, Rhodes University (1997)
Yuan, B., Gallagher, M.: Playing in continuous spaces: Some analysis and extension of population-based incremental learning. IEEE Congr. Evol. Comput. IEEE 17, 443–450 (2003)
Bureerat, S.: Improved population-based incremental learning in continuous spaces. In: Gaspar-Cunha, A., Takahashi, R., Schaefer, G., Costa, L. (eds.) Soft Computing in Industrial Applications. AISC, vol. 96, pp. 77–86. Springer, Heidelberg (2011)
Cortes, O.A.C., Rau-Chaplin, A., Wilson, D., Cook, I., Gaiser-Porter, J.: Efficient optimization of reinsurance contracts using discretized PBIL. In: The Third International Conference on Data Analytics, pp. 18–24 (2013)
Cortes, O.A.C., Rau-Chaplin, A., Wilson, D., Gaiser-Porter, J.: On PBIL, DE and PSO for optimizationof reinsurance contracts. In: Esparcia-Alcázar, A.I., Mora, A.M. (eds.) EvoApplications 2014. LNCS, vol. 8602, pp. 227–238. Springer, Heidelberg (2014)
Brown, L., Beria, A.A., Cortes, O., Rau-Chaplin, A., Wilson, D., Burke, N., Gaiser-Porter, J.: Parallel MO-PBIL: Computing pareto optimal frontiers efficiently with applications in reinsurance analytics. In: 2014 International Conference on High Performance Computing Simulation (HPCS), pp. 766–775, July 2014
Wang, H., Cortes, O., Rau-Chaplin, A.: Dynamic optimization of multi-layered reinsurance treaties. In: The 30th ACM/SIGApp. Symposium On Applied Computing (2015)
Cortes, O., Rau-Chaplin, A., do Prado, P.F.: On VEPSO and VEDE for solving a treaty optimization problem. In: IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 2427–2432, October 2014
Cai, J., Tan, K.S., Weng, C., Zhang, Y.: Optimal reinsurance under VaR and CTE risk measures. Insurance: Mathematics and Economics, pp. 185–196 (2008)
Zhang, Q.H.: Moea/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Inf. Process. Lett. 82(1), 7–13 (2002)
Acknowledgment
The authors would like to thank CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) and IFMA (Instituto Federal de Educação, Ciência e Tecnologia do Maranhão) for funding this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Cortes, O.A.C., Rau-Chaplin, A. (2016). Enhanced Multiobjective Population-Based Incremental Learning with Applications in Risk Treaty Optimization. In: Squillero, G., Burelli, P. (eds) Applications of Evolutionary Computation. EvoApplications 2016. Lecture Notes in Computer Science(), vol 9597. Springer, Cham. https://doi.org/10.1007/978-3-319-31204-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-31204-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31203-3
Online ISBN: 978-3-319-31204-0
eBook Packages: Computer ScienceComputer Science (R0)