Skip to main content

A Genetic Algorithm for Solving Portfolio Optimization Problems with Transaction Costs and Minimum Transaction Lots

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

A mean-variance model is proposed for portfolio rebalancing optimization problems with transaction costs and minimum transaction lots. The portfolio optimization problems are modeled as a non-smooth nonlinear integer programming problem. A genetic algorithm based on real value genetic operators is designed to solve the proposed model. It is illustrated via a numerical example that the genetic algorithm can solve the portfolio rebalancing optimization problems efficiently.

Supported by National Sciences Foundation of China (No. 70301005) and the Liu Hui Center of Applied Mathematics of Nankai University and Tianjin University.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Masini, R., Speranza, M.G.: Heuristic Algorithms for a Portfolio Selection Problem with Minimum Transaction Lots. European Journal of Operational Research 114, 219–233 (1999)

    Article  Google Scholar 

  2. Kellerer, H., Mansini, R., Speranza, M.G.: On Selecting a Portfolio with Fixed Costs and Minimum Lots. Annals of Operations Research 99, 287–304 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Konno, H., Wijayanayake, A.: Portfolio Optimization Problems under Concave Transaction Costs and Minimal Transaction Unit Constraints. Mathematical Programming 89, 233–250 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford University Press, Oxford (1997)

    Book  MATH  Google Scholar 

  5. Deb, K., Agrawal, R.B.: Simulated Binary Crossover for Continuous Search Space. Complex Systems 9, 115–148 (1995)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, D., Li, X., Li, M. (2005). A Genetic Algorithm for Solving Portfolio Optimization Problems with Transaction Costs and Minimum Transaction Lots. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_99

Download citation

  • DOI: https://doi.org/10.1007/11539902_99

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics