Skip to main content

Equity Option Strategy Discovery and Optimization Using a Memetic Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10142))

Abstract

Options in finance are becoming an increasingly popular investment instrument. Good returns, however, do depend on finding the right strategy for trading and risk management. In this paper we describe a memetic algorithm designed to discover and optimize multi-leg option strategies for the S&P500 index. Strategies comprising from one up to six option legs are examined. The fitness function is specifically designed to maximize profitability while seeking a certain trade success percentage and equity drawdown limit. Using historical option data from 2005 to 2016, our memetic algorithm discovered a four-leg option strategy that offers optimum performance.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Del Chicca, L., Larcher, G., Szoelgenyi, M.: Modeling and performance of certain put-write strategies. J. Altern. Invest. 15(4), 74–86 (2013). Spring

    Article  Google Scholar 

  2. Del Chicca, L., Larcher, G.: A comparison of different families of put-write option strategies. ACRN J. Finan. Risk Perspect. 1(1), 1–14 (2012)

    Google Scholar 

  3. Blackmore, S.: The Meme Machine. Oxford University Press, New York (1999)

    Google Scholar 

  4. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms. Technical report 826, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, CA (1989)

    Google Scholar 

  5. Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204–223 (2003)

    Article  Google Scholar 

  6. Richer, J.-M., Goëffon, A., Hao, J.-K.: A memetic algorithm for phylogenetic reconstruction with maximum parsimony. In: Pizzuti, C., Ritchie, M.D., Giacobini, M. (eds.) EvoBIO 2009. LNCS, vol. 5483, pp. 164–175. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01184-9_15

    Chapter  Google Scholar 

  7. Nguyen, Q.C., Ong, Y.S., Kuo, J.L.: A hierarchical approach to study the thermal behavior of protonated water clusters H\(^+\)(H\(_2\)O)\(_n\). J. Chem. Theory Comput. 5(10), 2629–2639 (2009)

    Article  Google Scholar 

  8. Chen, X., Ong, Y., Lim, M., Tan, K.C.: A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5), 591–607 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard Tymerski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tymerski, R., Greenwood, G., Sills, D. (2017). Equity Option Strategy Discovery and Optimization Using a Memetic Algorithm. In: Wagner, M., Li, X., Hendtlass, T. (eds) Artificial Life and Computational Intelligence. ACALCI 2017. Lecture Notes in Computer Science(), vol 10142. Springer, Cham. https://doi.org/10.1007/978-3-319-51691-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51691-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51690-5

  • Online ISBN: 978-3-319-51691-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics