Ortalama-varyans portföy optimizasyonunda genetik algoritma uygulamaları üzerine bir literatür araştırması

Mean-variance portfolio optimization model, introduced by Markowitz, provides a fundamental answer to the problem of portfolio management. This model seeks an efficient frontier with the best trade-offs between two conflicting objectives of maximizing return and minimizing risk. The problem of determining an efficient frontier is known to be NP-hard. Due to the complexity of the problem, genetic algorithms have been widely employed by a growing number of researchers to solve this problem. In this study, a literature review of genetic algorithms implementations on mean-variance portfolio optimization is examined from the recent published literature. Main specifications of the problems studied and the specifications of suggested genetic algorithms have been summarized

A methodology for the selection of new technologies in the aviation industry

The purpose of this report is to present a technology selection methodology to quantify both tangible and intangible benefits of certain technology alternatives within a fuzzy environment. Specifically, it describes an application of the theory of fuzzy sets to hierarchical structural analysis and economic evaluations for utilisation in the industry. The report proposes a complete methodology to accurately select new technologies. A computer based prototype model has been developed to handle the more complex fuzzy calculations. Decision-makers are only required to express their opinions on comparative importance of various factors in linguistic terms rather than exact numerical values. These linguistic variable scales, such as ‘very high’, ‘high’, ‘medium’, ‘low’ and ‘very low’, are then converted into fuzzy numbers, since it becomes more meaningful to quantify a subjective measurement into a range rather than in an exact value. By aggregating the hierarchy, the preferential weight of each alternative technology is found, which is called fuzzy appropriate index. The fuzzy appropriate indices of different technologies are then ranked and preferential ranking orders of technologies are found. From the economic evaluation perspective, a fuzzy cash flow analysis is employed. This deals quantitatively with imprecision or uncertainties, as the cash flows are modelled as triangular fuzzy numbers which represent ‘the most likely possible value’, ‘the most pessimistic value’ and ‘the most optimistic value’. By using this methodology, the ambiguities involved in the assessment data can be effectively represented and processed to assure a more convincing and effective decision- making process when selecting new technologies in which to invest. The prototype model was validated with a case study within the aviation industry that ensured it was properly configured to meet the

Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs

In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided. In DRCMPSPWET, a project arrives on top of an existing project portfolio and a due date has to be quoted for the new project while minimizing the costs of schedule changes. The objective function consists of the weighted earliness tardiness costs of the activities of the existing projects in the current baseline schedule plus a term that increases linearly with the anticipated completion time of the new project. An iterated local search based approach is developed for large instances of this problem. In order to analyze the performance and behavior of the proposed method, a new multi-project data set is created by controlling the total number of activities, the due date tightness, the due date range, the number of resource types, and the completion time factor in an instance. A series of computational experiments are carried out to test the performance of the local search approach. Exact solutions are provided for the small instances. The results indicate that the local search heuristic performs well in terms of both solution quality and solution time

Tri-Criterion Model for Constructing Low-Carbon Mutual Fund Portfolios: A Preference-Based Multi-Objective Genetic Algorithm Approach

[EN] Sustainable finance, which integrates environmental, social and governance criteria on financial decisions rests on the fact that money should be used for good purposes. Thus, the financial sector is also expected to play a more important role to decarbonise the global economy. To align financial flows with a pathway towards a low-carbon economy, investors should be able to integrate into their financial decisions additional criteria beyond return and risk to manage climate risk. We propose a tri-criterion portfolio selection model to extend the classical Markowitz's mean-variance approach to include investor's preferences on the portfolio carbon risk exposure as an additional criterion. To approximate the 3D Pareto front we apply an efficient multi-objective genetic algorithm called ev-MOGA which is based on the concept of epsilon-dominance. Furthermore, we introduce a-posteriori approach to incorporate the investor's preferences into the solution process regarding their climate-change related preferences measured by the carbon risk exposure and their loss-adverse attitude. We test the performance of the proposed algorithm in a cross-section of European socially responsible investments open-end funds to assess the extent to which climate-related risk could be embedded in the portfolio according to the investor's preferences.Hilario Caballero, A.; Garcia-Bernabeu, A.; Salcedo-Romero-De-Ávila, J.; Vercher, M. (2020). Tri-Criterion Model for Constructing Low-Carbon Mutual Fund Portfolios: A Preference-Based Multi-Objective Genetic Algorithm Approach. International Journal of Environmental research and Public Health. 17(17):1-15. https://doi.org/10.3390/ijerph17176324S1151717Morningstar Low Carbon Designationhttps://bit.ly/2SfAFUAKrueger, P., Sautner, Z., & Starks, L. T. (2020). The Importance of Climate Risks for Institutional Investors. The Review of Financial Studies, 33(3), 1067-1111. doi:10.1093/rfs/hhz137Syam, S. S. (1998). A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals. European Journal of Operational Research, 108(1), 196-207. doi:10.1016/s0377-2217(97)00048-9Li, D., Sun, X., & Wang, J. (2006). OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN-VARIANCE FORMULATION FOR PORTFOLIO SELECTION. Mathematical Finance, 16(1), 83-101. doi:10.1111/j.1467-9965.2006.00262.xBertsimas, D., & Shioda, R. (2007). Algorithm for cardinality-constrained quadratic optimization. Computational Optimization and Applications, 43(1), 1-22. doi:10.1007/s10589-007-9126-9Bawa, V. S. (1975). Optimal rules for ordering uncertain prospects. Journal of Financial Economics, 2(1), 95-121. doi:10.1016/0304-405x(75)90025-2Konno, H., & Yamazaki, H. (1991). Mean-Absolute Deviation Portfolio Optimization Model and Its Applications to Tokyo Stock Market. Management Science, 37(5), 519-531. doi:10.1287/mnsc.37.5.519Rockafellar, R. T., & Uryasev, S. (2002). Conditional value-at-risk for general loss distributions. Journal of Banking & Finance, 26(7), 1443-1471. doi:10.1016/s0378-4266(02)00271-6Mansini, R. (2003). LP solvable models for portfolio optimization: a classification and computational comparison. IMA Journal of Management Mathematics, 14(3), 187-220. doi:10.1093/imaman/14.3.187Hirschberger, M., Steuer, R. E., Utz, S., Wimmer, M., & Qi, Y. (2013). Computing the Nondominated Surface in Tri-Criterion Portfolio Selection. Operations Research, 61(1), 169-183. doi:10.1287/opre.1120.1140Utz, S., Wimmer, M., Hirschberger, M., & Steuer, R. E. (2014). Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds. European Journal of Operational Research, 234(2), 491-498. doi:10.1016/j.ejor.2013.07.024Utz, S., Wimmer, M., & Steuer, R. E. (2015). Tri-criterion modeling for constructing more-sustainable mutual funds. European Journal of Operational Research, 246(1), 331-338. doi:10.1016/j.ejor.2015.04.035Chang, T.-J., Meade, N., Beasley, J. E., & Sharaiha, Y. M. (2000). Heuristics for cardinality constrained portfolio optimisation. Computers & Operations Research, 27(13), 1271-1302. doi:10.1016/s0305-0548(99)00074-xMaringer, D., & Kellerer, H. (2003). Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectrum, 25(4), 481-495. doi:10.1007/s00291-003-0139-1Shaw, D. X., Liu, S., & Kopman, L. (2008). Lagrangian relaxation procedure for cardinality-constrained portfolio optimization. Optimization Methods and Software, 23(3), 411-420. doi:10.1080/10556780701722542Soleimani, H., Golmakani, H. R., & Salimi, M. H. (2009). Markowitz-based portfolio selection with minimum transaction lots, cardinality constraints and regarding sector capitalization using genetic algorithm. Expert Systems with Applications, 36(3), 5058-5063. doi:10.1016/j.eswa.2008.06.007Anagnostopoulos, K. P., & Mamanis, G. (2011). The mean–variance cardinality constrained portfolio optimization problem: An experimental evaluation of five multiobjective evolutionary algorithms. Expert Systems with Applications. doi:10.1016/j.eswa.2011.04.233Woodside-Oriakhi, M., Lucas, C., & Beasley, J. E. (2011). Heuristic algorithms for the cardinality constrained efficient frontier. European Journal of Operational Research, 213(3), 538-550. doi:10.1016/j.ejor.2011.03.030Meghwani, S. S., & Thakur, M. (2017). Multi-criteria algorithms for portfolio optimization under practical constraints. Swarm and Evolutionary Computation, 37, 104-125. doi:10.1016/j.swevo.2017.06.005Liagkouras, K., & Metaxiotis, K. (2016). A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem. Annals of Operations Research, 267(1-2), 281-319. doi:10.1007/s10479-016-2377-zMetaxiotis, K., & Liagkouras, K. (2012). Multiobjective Evolutionary Algorithms for Portfolio Management: A comprehensive literature review. Expert Systems with Applications, 39(14), 11685-11698. doi:10.1016/j.eswa.2012.04.053Silva, Y. L. T. V., Herthel, A. B., & Subramanian, A. (2019). A multi-objective evolutionary algorithm for a class of mean-variance portfolio selection problems. Expert Systems with Applications, 133, 225-241. doi:10.1016/j.eswa.2019.05.018Chang, T.-J., Yang, S.-C., & Chang, K.-J. (2009). Portfolio optimization problems in different risk measures using genetic algorithm. Expert Systems with Applications, 36(7), 10529-10537. doi:10.1016/j.eswa.2009.02.062Liagkouras, K. (2019). A new three-dimensional encoding multiobjective evolutionary algorithm with application to the portfolio optimization problem. Knowledge-Based Systems, 163, 186-203. doi:10.1016/j.knosys.2018.08.025Kaucic, M., Moradi, M., & Mirzazadeh, M. (2019). Portfolio optimization by improved NSGA-II and SPEA 2 based on different risk measures. Financial Innovation, 5(1). doi:10.1186/s40854-019-0140-6Babaei, S., Sepehri, M. M., & Babaei, E. (2015). Multi-objective portfolio optimization considering the dependence structure of asset returns. European Journal of Operational Research, 244(2), 525-539. doi:10.1016/j.ejor.2015.01.025Ruiz, A. B., Saborido, R., Bermúdez, J. D., Luque, M., & Vercher, E. (2019). Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences. Journal of Global Optimization, 76(2), 295-315. doi:10.1007/s10898-019-00782-1Anagnostopoulos, K. P., & Mamanis, G. (2010). A portfolio optimization model with three objectives and discrete variables. Computers & Operations Research, 37(7), 1285-1297. doi:10.1016/j.cor.2009.09.009Hu, Y., Chen, H., He, M., Sun, L., Liu, R., & Shen, H. (2019). Multi-Swarm Multi-Objective Optimizer Based on p-Optimality Criteria for Multi-Objective Portfolio Management. Mathematical Problems in Engineering, 2019, 1-22. doi:10.1155/2019/8418369Rangel-González, J. A., Fraire, H., Solís, J. F., Cruz-Reyes, L., Gomez-Santillan, C., Rangel-Valdez, N., & Carpio-Valadez, J. M. (2020). Fuzzy Multi-objective Particle Swarm Optimization Solving the Three-Objective Portfolio Optimization Problem. International Journal of Fuzzy Systems, 22(8), 2760-2768. doi:10.1007/s40815-020-00928-4Garcia-Bernabeu, A., Salcedo, J. V., Hilario, A., Pla-Santamaria, D., & Herrero, J. M. (2019). Computing the Mean-Variance-Sustainability Nondominated Surface by ev-MOGA. Complexity, 2019, 1-12. doi:10.1155/2019/6095712Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002). Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation, 10(3), 263-282. doi:10.1162/106365602760234108Matlab Central: ev-MOGA Multiobjective Evolutionary Algorithmhttps://bit.ly/3f2BYQMBlasco, X., Herrero, J. M., Sanchis, J., & Martínez, M. (2008). A new graphical visualization of n-dimensional Pareto front for decision-making in multiobjective optimization. Information Sciences, 178(20), 3908-3924. doi:10.1016/j.ins.2008.06.01

A variable neighborhood search simheuristic for project portfolio selection under uncertainty

With limited nancial resources, decision-makers in rms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes NP-hard. Thus, metaheuristics have been employed for solving large instances of the project portfolio selection problem (PPSP). However, most of the existing works do not account for uncertainty. This paper contributes to close this gap by analyzing a stochastic version of the PPSP: the goal is to maximize the expected net present value of the inversion, while considering random cash ows and discount rates in future periods, as well as a rich set of constraints including the maximum risk allowed. To solve this stochastic PPSP, a simulation-optimization algorithm is introduced. Our approach integrates a variable neighborhood search metaheuristic with Monte Carlo simulation. A series of computational experiments contribute to validate our approach and illustrate how the solutions vary as the level of uncertainty increases

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

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

Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises

Tesis por compendio[ES] La optimización en las empresas manufactureras es especialmente importante, debido a las grandes inversiones que realizan, ya que a veces estas inversiones no obtienen el rendimiento esperado porque los márgenes de beneficio de los productos son muy ajustados. Por ello, las empresas tratan de maximizar el uso de los recursos productivos y financieros minimizando el tiempo perdido y, al mismo tiempo, mejorando los flujos de los procesos y satisfaciendo las necesidades del mercado. El proceso de planificación es una actividad crítica para las empresas. Esta tarea implica grandes retos debido a los cambios del mercado, las alteraciones en los procesos de producción dentro de la empresa y en la cadena de suministro, y los cambios en la legislación, entre otros. La planificación del aprovisionamiento, la producción y la distribución desempeña un papel fundamental en el rendimiento de las empresas manufactureras, ya que una planificación ineficaz de los proveedores, los procesos de producción y los sistemas de distribución contribuye a aumentar los costes de los productos, a alargar los plazos de entrega y a reducir los beneficios. La planificación eficaz es un proceso complejo que abarca una amplia gama de actividades para garantizar que los equipos, los materiales y los recursos humanos estén disponibles en el momento y el lugar adecuados. Motivados por la complejidad de la planificación en las empresas manufactureras, esta tesis estudia y desarrolla herramientas cuantitativas para ayudar a los planificadores en los procesos de la planificación del aprovisionamiento, producción y distribución. Desde esta perspectiva, se proponen modelos realistas y métodos eficientes para apoyar la toma de decisiones en las empresas industriales, principalmente en las pequeñas y medianas empresas (PYMES). Las aportaciones de esta tesis suponen un avance científico basado en una exhaustiva revisión bibliográfica sobre la planificación del aprovisionamiento, la producción y la distribución que ayuda a comprender los principales modelos y algoritmos utilizados para resolver estos planes, y pone en relieve las tendencias y las futuras direcciones de investigación. También proporciona un marco holístico para caracterizar los modelos y algoritmos centrándose en la planificación de la producción, la programación y la secuenciación. Esta tesis también propone una herramienta de apoyo a la decisión para seleccionar un algoritmo o método de solución para resolver problemas concretos de la planificación del aprovisionamiento, producción y distribución en función de su complejidad, lo que permite a los planificadores no duplicar esfuerzos de modelización o programación de técnicas de solución. Por último, se desarrollan nuevos modelos matemáticos y enfoques de solución de última generación, como los algoritmos matheurísticos, que combinan la programación matemática y las técnicas metaheurísticas. Los nuevos modelos y algoritmos comprenden mejoras en términos de rendimiento computacional, e incluyen características realistas de los problemas del mundo real a los que se enfrentan las empresas de fabricación. Los modelos matemáticos han sido validados con un caso de una importante empresa del sector de la automoción en España, lo que ha permitido evaluar la relevancia práctica de estos novedosos modelos utilizando instancias de gran tamaño, similares a las existentes en la empresa objeto de estudio. Además, los algoritmos matheurísticos han sido probados utilizando herramientas libres y de código abierto. Esto también contribuye a la práctica de la investigación operativa, y proporciona una visión de cómo desplegar estos métodos de solución y el tiempo de cálculo y rendimiento de la brecha que se puede obtener mediante el uso de software libre o de código abierto.[CA] L'optimització a les empreses manufactureres és especialment important, a causa de les grans inversions que realitzen, ja que de vegades aquestes inversions no obtenen el rendiment esperat perquè els marges de benefici dels productes són molt ajustats. Per això, les empreses intenten maximitzar l'ús dels recursos productius i financers minimitzant el temps perdut i, alhora, millorant els fluxos dels processos i satisfent les necessitats del mercat. El procés de planificació és una activitat crítica per a les empreses. Aquesta tasca implica grans reptes a causa dels canvis del mercat, les alteracions en els processos de producció dins de l'empresa i la cadena de subministrament, i els canvis en la legislació, entre altres. La planificació de l'aprovisionament, la producció i la distribució té un paper fonamental en el rendiment de les empreses manufactureres, ja que una planificació ineficaç dels proveïdors, els processos de producció i els sistemes de distribució contribueix a augmentar els costos dels productes, allargar els terminis de lliurament i reduir els beneficis. La planificació eficaç és un procés complex que abasta una àmplia gamma d'activitats per garantir que els equips, els materials i els recursos humans estiguen disponibles al moment i al lloc adequats. Motivats per la complexitat de la planificació a les empreses manufactureres, aquesta tesi estudia i desenvolupa eines quantitatives per ajudar als planificadors en els processos de la planificació de l'aprovisionament, producció i distribució. Des d'aquesta perspectiva, es proposen models realistes i mètodes eficients per donar suport a la presa de decisions a les empreses industrials, principalment a les petites i mitjanes empreses (PIMES). Les aportacions d'aquesta tesi suposen un avenç científic basat en una exhaustiva revisió bibliogràfica sobre la planificació de l'aprovisionament, la producció i la distribució que ajuda a comprendre els principals models i algorismes utilitzats per resoldre aquests plans, i posa de relleu les tendències i les futures direccions de recerca. També proporciona un marc holístic per caracteritzar els models i algorismes centrant-se en la planificació de la producció, la programació i la seqüenciació. Aquesta tesi també proposa una eina de suport a la decisió per seleccionar un algorisme o mètode de solució per resoldre problemes concrets de la planificació de l'aprovisionament, producció i distribució en funció de la seua complexitat, cosa que permet als planificadors no duplicar esforços de modelització o programació de tècniques de solució. Finalment, es desenvolupen nous models matemàtics i enfocaments de solució d'última generació, com ara els algoritmes matheurístics, que combinen la programació matemàtica i les tècniques metaheurístiques. Els nous models i algoritmes comprenen millores en termes de rendiment computacional, i inclouen característiques realistes dels problemes del món real a què s'enfronten les empreses de fabricació. Els models matemàtics han estat validats amb un cas d'una important empresa del sector de l'automoció a Espanya, cosa que ha permés avaluar la rellevància pràctica d'aquests nous models utilitzant instàncies grans, similars a les existents a l'empresa objecte d'estudi. A més, els algorismes matheurístics han estat provats utilitzant eines lliures i de codi obert. Això també contribueix a la pràctica de la investigació operativa, i proporciona una visió de com desplegar aquests mètodes de solució i el temps de càlcul i rendiment de la bretxa que es pot obtindre mitjançant l'ús de programari lliure o de codi obert.[EN] Optimisation in manufacturing companies is especially important, due to the large investments they make, as sometimes these investments do not obtain the expected return because the profit margins of products are very tight. Therefore, companies seek to maximise the use of productive and financial resources by minimising lost time and, at the same time, improving process flows while meeting market needs. The planning process is a critical activity for companies. This task involves great challenges due to market changes, alterations in production processes within the company and in the supply chain, and changes in legislation, among others. Planning of replenishment, production and distribution plays a critical role in the performance of manufacturing companies because ineffective planning of suppliers, production processes and distribution systems contributes to higher product costs, longer lead times and less profits. Effective planning is a complex process that encompasses a wide range of activities to ensure that equipment, materials and human resources are available in the right time and the right place. Motivated by the complexity of planning in manufacturing companies, this thesis studies and develops quantitative tools to help planners in the replenishment, production and delivery planning processes. From this perspective, realistic models and efficient methods are proposed to support decision making in industrial companies, mainly in small- and medium-sized enterprises (SMEs). The contributions of this thesis represent a scientific breakthrough based on a comprehensive literature review about replenishment, production and distribution planning that helps to understand the main models and algorithms used to solve these plans, and highlights trends and future research directions. It also provides a holistic framework to characterise models and algorithms by focusing on production planning, scheduling and sequencing. This thesis also proposes a decision support tool for selecting an algorithm or solution method to solve concrete replenishment, production and distribution planning problems according to their complexity, which allows planners to not duplicate efforts modelling or programming solution techniques. Finally, new state-of-the-art mathematical models and solution approaches are developed, such as matheuristic algorithms, which combine mathematical programming and metaheuristic techniques. The new models and algorithms comprise improvements in computational performance terms, and include realistic features of real-world problems faced by manufacturing companies. The mathematical models have been validated with a case of an important company in the automotive sector in Spain, which allowed to evaluate the practical relevance of these novel models using large instances, similarly to those existing in the company under study. In addition, the matheuristic algorithms have been tested using free and open-source tools. This also helps to contribute to the practice of operations research, and provides insight into how to deploy these solution methods and the computational time and gap performance that can be obtained by using free or open-source software.This work would not have been possible without the following funding sources: Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for hiring predoctoral research staff with Grant (ACIF/2018/170) and the European Social Fund with the Grant Operational Programme of FSE 2014-2020. Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for predoctoral contract students to stay in research centers outside the research centers outside the Valencian Community (BEFPI/2021/040) and the European Social Fund.Guzmán Ortiz, BE. (2022). Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/187461Compendi

A survey on financial applications of metaheuristics

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)