Skip to main content
SpringerLink
Log in

Kernel Search: a new heuristic framework for portfolio selection

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper we propose a new heuristic framework, called Kernel Search, to solve the complex problem of portfolio selection with real features. The method is based on the identification of a restricted set of promising securities (kernel) and on the exact solution of the MILP problem on this set. The continuous relaxation of the problem solved on the complete set of available securities is used to identify the initial kernel and a sequence of integer problems are then solved to identify further securities to insert into the kernel. We analyze the behavior of several heuristic algorithms as implementations of the Kernel Search framework for the solution of the analyzed problem. The proposed heuristics are very effective and quite efficient. The Kernel Search has the advantage of being general and thus easily applicable to a variety of combinatorial problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Angelelli, E., Mansini, R., Speranza, M.G.: A comparison of MAD and CVaR models with real features. J. Bank. Finance 32, 1188–1197 (2008)

    Article  Google Scholar 

  2. Archetti, C., Speranza, M.G., Savelsbergh, M.: An optimization-based heuristic for the split delivery vehicle routing problem. Transp. Sci. 42, 22–31 (2008)

    Article  Google Scholar 

  3. Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130–1154 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27, 1271–1302 (2000)

    Article  MATH  Google Scholar 

  5. Chiodi, L., Mansini, R., Speranza, M.G.: Semi-absolute deviation rule for mutual funds portfolio selection. Ann. Oper. Res. 124, 245–265 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. 105, 471–499 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Guastaroba, G., Mansini, R., Speranza, M.G.: On the effectiveness of scenario generation techniques in single-period portfolio optimization. Eur. J. Oper. Res. 192, 500–511 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jobst, N.J., Horniman, M.H., Lucas, C., Mitra, G.: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints. Quant. Finance 1, 489–501 (2001)

    Article  MathSciNet  Google Scholar 

  9. Kellerer, H., Mansini, R., Speranza, M.G.: Selecting portfolios with fixed costs and minimum transaction lots. Ann. Oper. Res. 99, 287–304 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Konno, H., Wijayanayake, A.: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Program. 89, 233–250 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Konno, H., Yamamoto, R.: Integer programming approaches in mean-risk models. Comput. Manag. Sci. 2, 339–351 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Konno, H., Yamamoto, R.: Applications of integer programming to financial optimization. In: Zopounidis, et al. (eds.), Handbook of Financial Engineering, pp. 25–48. Springer, Berlin (2008)

    Chapter  Google Scholar 

  13. Mansini, R., Speranza, M.G.: Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114, 219–233 (1999)

    Article  MATH  Google Scholar 

  14. Mansini, R., Speranza, M.G.: An exact approach for the portfolio selection problem with transaction costs and rounds. IIE Trans. 37, 919–929 (2005)

    Article  Google Scholar 

  15. Mansini, R., Ogryczak, W., Speranza, M.G.: LP Solvable models for portfolio optimization: A classification and computational comparison. IMA J. Manag. Math. 14, 187–220 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Markowitz, H.M.: Portfolio selection. J. Finance 7, 77–91 (1952)

    Article  Google Scholar 

  17. Markowitz, H.M.: Portfolio Selection: Efficient Diversification of Investments. Wiley, New York (1959)

    Google Scholar 

  18. Pisinger, D.: Core problems in knapsack algorithms. Oper. Res. 47, 570–575 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Quantitative Methods, University of Brescia, Brescia, Italy

    Enrico Angelelli & M. Grazia Speranza

  2. Department of Information Engineering, University of Brescia, Brescia, Italy

    Renata Mansini

Authors
  1. Enrico Angelelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Renata Mansini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Grazia Speranza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Grazia Speranza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Angelelli, E., Mansini, R. & Speranza, M.G. Kernel Search: a new heuristic framework for portfolio selection. Comput Optim Appl 51, 345–361 (2012). https://doi.org/10.1007/s10589-010-9326-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9326-6

Keywords

Search

Navigation