Computational Intelligence in Stock Portfolio Management: Comparison
Please note this is a comparison between Version 2 by Lindsay Dong and Version 1 by Francisco G. Salas.

Stock portfolio management consists of defining how some investment resources should be allocated to a set of stocks. It is an important component in the functioning of modern societies throughout the world. However, it faces important theoretical and practical challenges. ANNs have high accuracy, fast prediction speed and clear superiority in predictions related to financial markets.

  • stock portfolios
  • artificial neural networks
  • evolutionary algorithms
  • computational intelligence

1. Introduction

1.1. Fundamental Analysis

One of the most used sources of information in the management of stock portfolios comes from the so-called fundamental analysis. The fundamental indicators provided by this analysis allow the practitioner to evaluate stocks from multiple perspectives. Such indicators are constructed from the financial statements that the companies (underlying the stocks) present publicly on a regular basis.
Fundamental indicators provide information that is often exploited in the literature to forecast future stock performance and to select the most competitive stocks. These indicators can be used both qualitatively and quantitatively. Regarding the latter, the financial information published by companies is synthesized in the form of ratios that shed light on the current state of the company, providing remarkable information on what can be expected from the financial health of the company and the possible future price of its stock. When this analysis is used in the literature, the fundamental indicators are usually aggregated in an overall assessment value that requires subjective preferences from the practitioner (cf. e.g., [13][1]); however, the aggregation procedure is not straightforward and represents an important challenge.

1.2. Artificial Neural Networks

Artificial neural networks are nowadays very popular among techniques from computational intelligence that have been used for many applications, such as classification, clustering, pattern recognition and prediction in diverse scientific and technological disciplines ([15,16][2][3]). Similarly to other computational intelligence techniques, applications of ANN are very diversified due to its capability to model systems and phenomena from the fields of sciences, engineering and social sciences. Analogously to a nervous system, an ANN is built from neurons, which are the basic elements for processing signals. Neurons are interconnected to form a network, with additional connections (synaptic relations) for input and output signals. Weights are assigned to each of these and other connections. The computing of suitable values for these weights is performed by training algorithms. An ANN needs to be trained before it can be used by using actual data from the system or phenomenon to model. Neurons are configured to form layers, in which neurons have parallel connections for inputs and outputs. ANN complexity varies from a network with a single layer of a single neuron to networks with several layers, each having several neurons. Networks with only forward connections are known as feedforward networks. Networks with forward and backward connections are known as feedbackward networks ([15][2]). The term deep learning refers to ANN with complex multilayers ([17][4]). Roughly speaking, deep learning has more complex connections between layers and also more neurons than previous types of networks. Some neural networks that form deep learning networks are convolutional networks, recursive networks and recurrent networks.

2.3. Multi-Objective Optimization Problem

Without loss of generality, a multi-objective optimization problem (MOP) can be defined in terms of maximization (although minimization is also common) as follows: where Ω is the set of decision variable vectors x = [ x 1 , x 2 , , x m ) ] that fulfill the set of constraints of the problem, and then F : Ω R k , where R k  is the so-called objective space. It is evident that the notation used here states that all functions fi  f i (objectives) should be maximized; however, it is also possible that one requires some functions  f i fi to be minimized instead. To keep standard notation, weit assumes that the latter can be simply achieved by multiplying the minimizing function by 1.

1.4. Evolutionary Multi-Objective Optimization

Multi-objective evolutionary algorithms (MOEAs) are high-level procedures designed to discover good enough solutions to MOPs (solutions that are close to the global optimum). They are especially useful with incomplete or imperfect information or a limited computing capacity ([19][5]). MOEAs address MOPs using principles from biological evolution. They use a population of individuals, each representing a solution to the MOP. The individuals in the population reproduce among them, using so-called evolutionary operators (selection, crossover, mutation), to produce a new generation of individuals. Often, this new generation of individuals is composed of both parents and children that posses the best fitness; this fitness represents the impact on the objectives of the MOP. Since each individual encodes a solution to the MOP, MOEAs can approximate a set of trade-off alternatives simultaneously. The performance of MOEAs has been assessed in different fields (e.g., [20,21][6][7]). They have been widely accepted as convenient tools for addressing the problem of stock portfolio management ([10,11,12][8][9][10]). The main goal of MOEAs is to find a set of solutions that approximate the true Pareto front in terms of convergence and diversity. Convergence refers to determining the solutions that belong to the PF, while diversity refers to determining the solutions that best represent all the PF. Thus, the intervention of the decision maker is not traditionally used in the process. Thus, rather little interest has been paid in the literature to choosing one of the efficient solutions as the final one in contrast to the interest paid in approximating the whole Pareto front. Usually, two types of MOEAs are highlighted in the literature: differential evolution and genetic algorithms. Differential evolution (DE) has been found to be very simple and effective ([22][11]), particularly when addressing non-linear single-objective optimization problems ([23,24][12][13]). On the other hand, in a genetic algorithm (GA), solutions to a problem are sought in the form of strings of characters (the best representations are usually those that reflect something about the problem that is being addressed), virtually always applying recombination operators such as crossing, selection and mutation operators. GAs compose one of the most popular meta-heuristics applied to the Portfolio Optimization Problem ([12][10]).

2. Computational Intelligence in Stock Portfolio Management

2.1. Portfolio Management: Price Forecasting, Stock Selection and Portfolio Optimization

In recent years, there have been plenty of contributions on price forecasting based on either statistical or computational intelligence methods (see [10,27][8][14]). The stock market is characterized by extreme fluctuations, non-linearity, and shifts in internal and external environmental variables. Artificial intelligence techniques can detect such non-linearity, resulting in much-improved forecast results [28][15]. Among the computational intelligence methods used for price forecasting are deep learning (e.g., [29,30,31,32][16][17][18][19]) and machine learning (e.g., [33,34,35][20][21][22]). In [10][8], a hybrid stock selection model with a stock prediction stage based on an artificial neural network (ANN) trained with the extreme learning machine (ELM) training algorithm ([6,36][23][24]) was proposed. The ELM algorithm has been tested for financial market prediction in other works (see [7,8,9][25][26][27]). There are important works on methods for stock selection, which have several different fundamental theories, from operations research methods (e.g., [37,38][28][29]) to approaches originating in modern portfolio theory (Mean-variance model) (e.g., [38,39][29][30]) and soft computing methods (e.g., [40,41][31][32]), including hybrid approaches (e.g., [10,42,43][8][33][34]). The fundamental theory for portfolio optimization is Markowitz’s mean-variance model ([44][35]). Its formulation marked the beginning of Modern portfolio theory ([45][36]). However, Markowitz’s original model is considered too basic since it neglects real-world issues related to investors, trading limitations, portfolio size and others ([43][34]). For evaluating a portfolio’s performance, the model is based on measuring the expected return and the risk; the latter is represented by the variance in the portfolio’s historical returns. Since the variance takes into account both negative and positive deviations, other risk measures have been proposed, such as the Conditional Value at Risk (CVaR) ([46,47][37][38]). As a result, numerous works have improved the model, creating more risk measures and proposing restrictions that bring them closer to practical aspects of stock market trading ([27][14]). Consequently, many optimization methods based on exact algorithms (e.g., [48,49,50,51,52,53,54,55][39][40][41][42][43][44][45][46]) and heuristic and hybrid optimization (e.g., [29,56,57,58,59,60,61,62,63,64,65][16][47][48][49][50][51][52][53][54][55][56]) have been proposed to solve the emerging portfolio optimization models ([27,40,45][14][31][36]).

2.2. Exploiting Uptrends and Downtrends in Strategies for Stock Investment

Regarding alternative strategies to the known buy-and-hold approach for stock investment, in ([69][57]), the authors propose two new trading strategies to outperform the buy-and-hold approach, which is based on the efficient market hypothesis. The proposed strategies are based on a generalized time-dependent strategy proposed in ([70][58]) but propose different timing for changing the buying/selling position. According to ([71][59]), the decision to adopt a long or short position in an asset requires a view of its immediate future price movements. A typical short seller would have to assess the potential future behavior of the asset price by means of evaluating several factors, such as past returns and market effects as well as technical indicators, such as market ratios ([71][59]). There are a few works published in the literature to address the problem of trading strategies for the short position. An interesting work that considers not only the short position but both the short and long positions is ([72][60]), in which a simultaneous long-short trading strategy (SLS) is proposed. Such a strategy is based partially on the property that a positive gain with zero initial investment is expected, which holds for all discrete and continuous price processes with independent multiplicative growth and a constant trend. Other works based on SLS are ([73,74,75][61][62][63]). Building stock portfolios with high returns and low risk is a common challenge for researchers in the financial area. Usually, the most common practice is to select the more promising stocks according to several factors, such as financial information, news of the market and technical analysis. Several approaches that use computational intelligence algorithms have been proposed in the literature to deal with the overwhelming complexity of building a stock portfolio. Usually, these approaches consider up to three activities to build a portfolio: return forecasting, stock selection and portfolio optimization. These activities decide which stocks should be supported, as well as the proportions of the investment to be allocated to them, by comparing the historical and forecasted performance of potential stock investments. Given the approaches mentioned above for addressing the three activities or stages: return forecasting, stock selection and portfolio optimization, a comprehensive approach for portfolio bulding and optimization can be carried out by applying a combination of computational intelligence techniques in each stage. A particular effective combination proven in the literature comprises: stock price forecasting by an artificial neural network (ANN) trained by the extreme learning machine (ELM) algorithm. Stock selection is modeled as an optimization problem that seeks to determine the most plausible stocks; thus, a differential evolution is exploited on the basis of the forecasted price and a set of factors of the so-called fundamental analysis. Finally, portfolio optimization is conducted through a genetic algorithm that uses confidence intervals of the portfolio returns to determine the best stock portfolio. It is worth to mention that forecasting the price of a given stock allows the comprehensive approach to focus on uptrends or downtrends (i.e., going long or short, respectively) for that stock. 


  1. Xidonas, P.; Mavrotas, G.; Psarras, J. A multicriteria methodology for equity selection using financial analysis. Comput. Oper. Res. 2009, 36, 3187–3203.
  2. Abiodun, O.I.; Jantan, A.; Omolara, A.E.; Dada, K.V.; Mohamed, N.A.; Arshad, H. State-of-the-art in artificial neural network applications: A survey. Heliyon 2018, 4, e00938.
  3. Sumathi, S.; Paneerselvam, S. Computational Intelligence Paradigms: Theory & Applications Using MATLAB; CRC Press: New York, NY, USA, 2010.
  4. Albawi, S.; Mohammed, T.A.; Al-Zawi, S. Understanding of a convolutional neural network. In Proceedings of the 2017 International Conference on Engineering and Technology (ICET), Antalya, Turkey, 21–23 August 2017; pp. 1–6.
  5. Bianchi, L.; Dorigo, M.; Gambardella, L.M.; Gutjahr, W.J. A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 2009, 8, 239–287.
  6. Pławiak, P. Novel genetic ensembles of classifiers applied to myocardium dysfunction recognition based on ECG signals. Swarm Evol. Comput. 2018, 39, 192–208.
  7. Pławiak, P. Novel methodology of cardiac health recognition based on ECG signals and evolutionary-neural system. Expert Syst. Appl. 2018, 92, 334–349.
  8. Yang, F.; Chen, Z.; Li, J.; Tang, L. A novel hybrid stock selection method with stock prediction. Appl. Soft Comput. 2019, 80, 820–831.
  9. Fernandez, E.; Navarro, J.; Solares, E.; Coello, C.C. A novel approach to select the best portfolio considering the preferences of the decision maker. Swarm Evol. Comput. 2019, 46, 140–153.
  10. Solares, E.; Coello, C.A.C.; Fernandez, E.; Navarro, J. Handling uncertainty through confidence intervals in portfolio optimization. Swarm Evol. Comput. 2019, 44, 774–787.
  11. Das, S.; Suganthan, P.N. Differential evolution: A survey of the state-of-the-art. IEEE Trans. Evol. Comput. 2010, 15, 4–31.
  12. Krink, T.; Paterlini, S. Multiobjective optimization using differential evolution for real-world portfolio optimization. Comput. Manag. Sci. 2011, 8, 157–179.
  13. Krink, T.; Mittnik, S.; Paterlini, S. Differential evolution and combinatorial search for constrained index-tracking. Ann. Oper. Res. 2009, 172, 153.
  14. Ferreira, F.; Gandomi, A.H.; Cardoso, R.T.N. Artificial Intelligence Applied to Stock Market Trading: A Review. IEEE Access 2021, 9, 30898–30917.
  15. Chopra, R.; Sharma, G.D. Application of Artificial Intelligence in Stock Market Forecasting: A Critique, Review, and Research Agenda. J. Risk Financ. Manag. 2021, 14, 526.
  16. Ma, Y.L.; Han, R.Z.; Wang, W.Z. Prediction-Based Portfolio Optimization Models Using Deep Neural Networks. IEEE Access 2020, 8, 115393–115405.
  17. Fischer, T.; Krauss, C. Deep learning with long short-term memory networks for financial market predictions. Eur. J. Oper. Res. 2018, 270, 654–669.
  18. Long, W.; Lu, Z.; Cui, L. Deep learning-based feature engineering for stock price movement prediction. Knowl.-Based Syst. 2019, 164, 163–173.
  19. Zhong, X.; Enke, D. Predicting the daily return direction of the stock market using hybrid machine learning algorithms. Financ. Innov. 2019, 5, 1–20.
  20. Kaczmarek, T.; Perez, K. Building portfolios based on machine learning predictions. Econ. Res.-Ekon. Istraz. 2021, 1–19.
  21. Patel, J.; Shah, S.; Thakkar, P.; Kotecha, K. Predicting stock and stock price index movement using Trend Deterministic Data Preparation and machine learning techniques. Expert Syst. Appl. 2015, 42, 259–268.
  22. Chong, E.; Han, C.; Park, F.C. Deep learning networks for stock market analysis and prediction: Methodology, data representations, and case studies. Expert Syst. Appl. 2017, 83, 187–205.
  23. Huang, G.B.; Zhu, Q.Y.; Siew, C.K. Extreme learning machine: Theory and applications. Neurocomputing 2006, 70, 489–501.
  24. Huang, G.B.; Siew, C.K. Extreme learning machine: RBF network case. In Proceedings of the 2004 8th International Conference on Control, Automation, Robotics and Vision (ICARCV) ICARCV 2004, Kunming, China, 6–9 December 2004; Volume 2, pp. 1029–1036.
  25. Li, X.; Xie, H.; Wang, R.; Cai, Y.; Cao, J.; Wang, F.; Min, H.; Deng, X. Empirical analysis: Stock market prediction via extreme learning machine. Neural Comput. Appl. 2016, 27, 67–78.
  26. Wang, F.; Zhang, Y.; Rao, Q.; Li, K.; Zhang, H. Exploring mutual information-based sentimental analysis with kernel-based extreme learning machine for stock prediction. Soft Comput. 2017, 21, 3193–3205.
  27. Das, S.P.; Padhy, S. Unsupervised extreme learning machine and support vector regression hybrid model for predicting energy commodity futures index. Memetic Comput. 2017, 9, 333–346.
  28. Peykani, P.; Mohammadi, E.; Jabbarzadeh, A.; Rostamy-Malkhalifeh, M.; Pishvaee, M.S. A novel two-phase robust portfolio selection and optimization approach under uncertainty: A case study of Tehran stock exchange. PLoS ONE 2020, 15, e239810.
  29. Mussafi, N.S.M.; Ismail, Z. Optimum Risk-Adjusted Islamic Stock Portfolio Using the Quadratic Programming Model: An Empirical Study in Indonesia. J. Asian Financ. Econ. Bus. 2021, 8, 839–850.
  30. Lim, S.; Kim, M.J.; Ahn, C.W. A Genetic Algorithm (GA) Approach to the Portfolio Design Based on Market Movements and Asset Valuations. IEEE Access 2020, 8, 140234–140249.
  31. Wang, W.Y.; Li, W.Z.; Zhang, N.; Liu, K.C. Portfolio formation with preselection using deep learning from long-term financial data. Expert Syst. Appl. 2020, 143, 113042.
  32. Zhang, C.; Liang, S.; Lyu, F.; Fang, L. Stock-index tracking optimization using auto-encoders. Front. Phys. 2020, 8, 388.
  33. Paiva, F.D.; Cardoso, R.T.N.; Hanaoka, G.P.; Duarte, W.M. Decision-making for financial trading: A fusion approach of machine learning and portfolio selection. Expert Syst. Appl. 2019, 115, 635–655.
  34. Galankashi, M.R.; Rafiei, F.M.; Ghezelbash, M. Portfolio selection: A fuzzy-ANP approach. Financ. Innov. 2020, 6, 34.
  35. Markowitz, H. Portfolio Selection. J. Financ. 1952, 7, 77–91.
  36. Kalayci, C.B.; Ertenlice, O.; Akbay, M.A. A comprehensive review of deterministic models and applications for mean-variance portfolio optimization. Expert Syst. Appl. 2019, 125, 345–368.
  37. Rockafellar, R.; Uryasev, S. Optimization of conditional value-at-risk. J. Risk 2002, 2, 21–41.
  38. Rockafellar, R.; Uryasev, S. Conditional value-at-risk for general loss distributions. J. Bank. Financ. 2002, 26, 1443–1471.
  39. Sehgal, R.; Mehra, A. Robust reward–risk ratio portfolio optimization. Int. Trans. Oper. Res. 2021, 28, 2169–2190.
  40. Hu, Y.; Lindquist, W.B.; Rachev, S.T. Portfolio Optimization Constrained by Performance Attribution. J. Risk Financ. Manag. 2021, 14, 201.
  41. Dai, Z.; Wen, F. Some improved sparse and stable portfolio optimization problems. Financ. Res. Lett. 2018, 27, 46–52.
  42. Baykasoğlu, A.; Yunusoglu, M.G.; Özsoydan, F.B. A GRASP based solution approach to solve cardinality constrained portfolio optimization problems. Comput. Ind. Eng. 2015, 90, 339–351.
  43. Mayambala, F.; Rönnberg, E.; Larsson, T. Eigendecomposition of the Mean-Variance Portfolio Optimization Model. In Optimization, Control, and Applications in the Information Age; Migdalas, A., Karakitsiou, A., Eds.; Springer International Publishing: Cham, Switzerland, 2015; pp. 209–232.
  44. Kocadağli, O.; Keskin, R. A novel portfolio selection model based on fuzzy goal programming with different importance and priorities. Expert Syst. Appl. 2015, 42, 6898–6912.
  45. He, F.; Qu, R. Hybridising Local Search With Branch-And-Bound For Constrained Portfolio Selection Problems. In Proceedings of the 30th European Council for Modeling and Simulation, Regensburg, Germany, 31 May–3 June 2016; Claus, T., Herrmann, F., Manitz, M., Rose, O., Eds.; Digital Library of the European Council for Modelling and Simulation: Regensburg, Germany, 2016; pp. 1–7.
  46. Ruiz-Torrubiano, R.; Suárez, A. A memetic algorithm for cardinality-constrained portfolio optimization with transaction costs. Appl. Soft Comput. 2015, 36, 125–142.
  47. Soleymani, F.; Paquet, E. Financial portfolio optimization with online deep reinforcement learning and restricted stacked autoencoder—DeepBreath. Expert Syst. Appl. 2020, 156, 113456.
  48. García, F.; Guijarro, F.; Oliver, J. Index tracking optimization with cardinality constraint: A performance comparison of genetic algorithms and tabu search heuristics. Neural Comput. Appl. 2018, 30, 2625–2641.
  49. Hadi, A.S.; Naggar, A.A.E.; Bary, M.N.A. New model and method for portfolios selection. Appl. Math. Sci. 2016, 10, 263–288.
  50. Liagkouras, K.; Metaxiotis, K. A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem. Ann. Oper. Res. 2018, 267, 281–319.
  51. Macedo, L.L.; Godinho, P.; Alves, M.J. Mean-semivariance portfolio optimization with multiobjective evolutionary algorithms and technical analysis rules. Expert Syst. Appl. 2017, 79, 33–43.
  52. Lwin, K.T.; Qu, R.; MacCarthy, B.L. Mean-VaR portfolio optimization: A nonparametric approach. Eur. J. Oper. Res. 2017, 260, 751–766.
  53. Ban, G.Y.; Karoui, N.E.; Lim, A.E.B. Machine Learning and Portfolio Optimization. Manag. Sci. 2016, 64, 1136–1154.
  54. Kizys, R.; Juan, A.; Sawik, B.; Calvet, L. A Biased-Randomized Iterated Local Search Algorithm for Rich Portfolio Optimization. Appl. Sci. 2019, 9, 3509.
  55. Kalayci, C.B.; Ertenlice, O.; Akyer, H.; Aygoren, H. An artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for cardinality constrained portfolio optimization. Expert Syst. Appl. 2017, 85, 61–75.
  56. Mendonça, G.H.; Ferreira, F.G.; Cardoso, R.T.; Martins, F.V. Multi-attribute decision making applied to financial portfolio optimization problem. Expert Syst. Appl. 2020, 158, 113527.
  57. Hui, E.C.; Chan, K.K.K. Alternative trading strategies to beat “buy-and-hold”. Phys. A Stat. Mech. Its Appl. 2019, 534, 120800.
  58. Hui, E.C.; Chan, K.K.K. A new time-dependent trading strategy for securitized real estate and equity indices. Int. J. Strateg. Prop. Manag. 2018, 22, 64–79.
  59. Allen, D.E.; Powell, R.J.; Singh, A.K. Chapter 32—Machine Learning and Short Positions in Stock Trading Strategies. In Handbook of Short Selling; Gregoriou, G.N., Ed.; Academic Press: San Diego, CA, USA, 2012; pp. 467–478.
  60. Baumann, M.H.; Grüne, L. Simultaneously long-short trading in discrete and continuous time. Syst. Control. Lett. 2017, 99, 85–89.
  61. Primbs, J.A.; Barmish, B.R. On Robustness of Simultaneous Long-Short Stock Trading Control with Time-Varying Price Dynamics. IFAC-PapersOnLine 2017, 50, 12267–12272.
  62. O’Brien, J.D.; Burke, M.E.; Burke, K. A Generalized Framework for Simultaneous Long-Short Feedback Trading. IEEE Trans. Autom. Control. 2021, 66, 2652–2663.
  63. Deshpande, A.; Gubner, J.A.; Barmish, B.R. On Simultaneous Long-Short Stock Trading Controllers with Cross-Coupling. IFAC PapersOnLine 2020, 53, 16989–16995.