IDEAS home Printed from https://ideas.repec.org/a/brf/journl/v5y2007i1p59-77.html

Genetic Algorithms for Development of New Financial Products

Author

Listed:
  • Eder Oliveira Abensur

    (Escola Politécnica e Faculdade de Economia, Administração e Contabilidade, Universidade de São Paulo)

Abstract

New Product Development (NPD) is recognized as a fundamental activity that has a relevant impact on the performance of companies. Despite the relevance of the financial market there is a lack of work on new financial product development. The aim of this research is to propose the use of Genetic Algorithms (GA) as an alternative procedure for evaluating the most favorable combination of variables for the product launch. The paper focuses on: (i) determining the essential variables of the financial product studied (investment fund); (ii) determining how to evaluate the success of a new investment fund launch and (iii) how GA can be applied to the financial product development problem. The proposed framework was tested using 4 years of real data from the Brazilian financial market and the results suggest that this is an innovative development methodology and useful for designing complex financial products with many attributes.

Suggested Citation

  • Eder Oliveira Abensur, 2007. "Genetic Algorithms for Development of New Financial Products," Brazilian Review of Finance, Brazilian Society of Finance, vol. 5(1), pages 59-77.
    • Handle: RePEc:brf:journl:v:5:y:2007:i:1:p:59-77
    as

    Download full text from publisher

    File URL: http://bibliotecadigital.fgv.br/ojs/index.php/rbfin/article/download/1166/376
    Download Restriction: no
    File URL: http://bibliotecadigital.fgv.br/ojs/index.php/rbfin/article/view/1166
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Edwin J. Elton & Martin J. Gruber & Christopher R. Blake, 2003. "Incentive Fees and Mutual Funds," Journal of Finance, American Finance Association, vol. 58(2), pages 779-804, April.
    2. repec:bla:jfinan:v:53:y:1998:i:5:p:1589-1622 is not listed on IDEAS
    3. Crama, Y. & Schyns, M., 2003. "Simulated annealing for complex portfolio selection problems," European Journal of Operational Research, Elsevier, vol. 150(3), pages 546-571, November.
    4. Rajeev Kohli & Ramesh Krishnamurti, 1987. "A Heuristic Approach to Product Design," Management Science, INFORMS, vol. 33(12), pages 1523-1533, December.
    5. Daniel Kahneman & Amos Tversky, 2013. "Prospect Theory: An Analysis of Decision Under Risk," World Scientific Book Chapters, in: Leonard C MacLean & William T Ziemba (ed.), HANDBOOK OF THE FUNDAMENTALS OF FINANCIAL DECISION MAKING Part I, chapter 6, pages 99-127, World Scientific Publishing Co. Pte. Ltd..
    6. Leyuan Shi & Sigurdur Ólafsson & Qun Chen, 2001. "An Optimization Framework for Product Design," Management Science, INFORMS, vol. 47(12), pages 1681-1692, December.
    7. C. Storey & D. Kelly, 2001. "Measuring the Performance of New Service Development Activities," The Service Industries Journal, Taylor & Francis Journals, vol. 21(2), pages 71-90, April.
    8. Allen, Franklin & Karjalainen, Risto, 1999. "Using genetic algorithms to find technical trading rules," Journal of Financial Economics, Elsevier, vol. 51(2), pages 245-271, February.
    9. McKee, Thomas E. & Lensberg, Terje, 2002. "Genetic programming and rough sets: A hybrid approach to bankruptcy classification," European Journal of Operational Research, Elsevier, vol. 138(2), pages 436-451, April.
    10. P. V. (Sundar) Balakrishnan & Varghese S. Jacob, 1996. "Genetic Algorithms for Product Design," Management Science, INFORMS, vol. 42(8), pages 1105-1117, August.
    11. Kohli, Rajeev & Krishnamurti, Ramesh, 1989. "Optimal product design using conjoint analysis: Computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 40(2), pages 186-195, May.
    12. Jin Li & Edward P. K. Tsang, 2000. "Reducing Failures In Investment Recommendations Using Genetic Programming," Computing in Economics and Finance 2000 332, Society for Computational Economics.
    13. Gruca, Thomas S. & Klemz, Bruce R., 2003. "Optimal new product positioning: A genetic algorithm approach," European Journal of Operational Research, Elsevier, vol. 146(3), pages 621-633, May.
    14. Rajeev Kohli & R. Sukumar, 1990. "Heuristics for Product-Line Design Using Conjoint Analysis," Management Science, INFORMS, vol. 36(12), pages 1464-1478, December.
    15. Stefan H. Thomke, 1998. "Managing Experimentation in the Design of New Products," Management Science, INFORMS, vol. 44(6), pages 743-762, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jeffrey D. Camm & James J. Cochran & David J. Curry & Sriram Kannan, 2006. "Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem," Management Science, INFORMS, vol. 52(3), pages 435-447, March.
    2. Alexandre Belloni & Robert Freund & Matthew Selove & Duncan Simester, 2008. "Optimizing Product Line Designs: Efficient Methods and Comparisons," Management Science, INFORMS, vol. 54(9), pages 1544-1552, September.
    3. Daniel Baier & Sascha Voekler, 2024. "One-stage product-line design heuristics: an empirical comparison," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(1), pages 73-107, March.
    4. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    5. Tarasewich, Peter & McMullen, Patrick R., 2001. "A pruning heuristic for use with multisource product design," European Journal of Operational Research, Elsevier, vol. 128(1), pages 58-73, January.
    6. Tan Wang & Genaro Gutierrez, 2022. "Robust Product Line Design by Protecting the Downside While Minding the Upside," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 194-217, January.
    7. Albritton, M. David & McMullen, Patrick R., 2007. "Optimal product design using a colony of virtual ants," European Journal of Operational Research, Elsevier, vol. 176(1), pages 498-520, January.
    8. G. E. Fruchter & A. Fligler & R. S. Winer, 2006. "Optimal Product Line Design: Genetic Algorithm Approach to Mitigate Cannibalization," Journal of Optimization Theory and Applications, Springer, vol. 131(2), pages 227-244, November.
    9. Winfried J. Steiner & Harald Hruschka, 2002. "Produktliniengestaltung mit Genetischen Algorithmen," Schmalenbach Journal of Business Research, Springer, vol. 54(7), pages 575-601, November.
    10. Stelios Tsafarakis, 2016. "Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover," Annals of Operations Research, Springer, vol. 247(2), pages 617-633, December.
    11. Leyuan Shi & Sigurdur Ólafsson & Qun Chen, 2001. "An Optimization Framework for Product Design," Management Science, INFORMS, vol. 47(12), pages 1681-1692, December.
    12. Wang, Xinfang (Jocelyn) & Curry, David J., 2012. "A robust approach to the share-of-choice product design problem," Omega, Elsevier, vol. 40(6), pages 818-826.
    13. Winfried Steiner & Harald Hruschka, 2002. "A Probabilistic One-Step Approach to the Optimal Product Line Design Problem Using Conjoint and Cost Data," Review of Marketing Science Working Papers 1-4-1003, Berkeley Electronic Press.
    14. Van den Broeke, Maud & Boute, Robert & Cardoen, Brecht & Samii, Behzad, 2017. "An efficient solution method to design the cost-minimizing platform portfolio," European Journal of Operational Research, Elsevier, vol. 259(1), pages 236-250.
    15. Xinfang (Jocelyn) Wang & Jeffrey D. Camm & David J. Curry, 2009. "A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem," Management Science, INFORMS, vol. 55(10), pages 1718-1728, October.
    16. Pantourakis, Michail & Tsafarakis, Stelios & Zervoudakis, Konstantinos & Altsitsiadis, Efthymios & Andronikidis, Andreas & Ntamadaki, Vasiliki, 2022. "Clonal selection algorithms for optimal product line design: A comparative study," European Journal of Operational Research, Elsevier, vol. 298(2), pages 585-595.
    17. Baier, Daniel & Gaul, Wolfgang, 1998. "Optimal product positioning based on paired comparison data," Journal of Econometrics, Elsevier, vol. 89(1-2), pages 365-392, November.
    18. Fish, Kelly E. & Johnson, John D. & Dorsey, Robert E. & Blodgett, Jeffery G., 2004. "Using an artificial neural network trained with a genetic algorithm to model brand share," Journal of Business Research, Elsevier, vol. 57(1), pages 79-85, January.
    19. Tsafarakis, Stelios & Marinakis, Yannis & Matsatsinis, Nikolaos, 2011. "Particle swarm optimization for optimal product line design," International Journal of Research in Marketing, Elsevier, vol. 28(1), pages 13-22.
    20. Nair, Suresh K. & Tarasewich, Peter, 2003. "A model and solution method for multi-period sales promotion design," European Journal of Operational Research, Elsevier, vol. 150(3), pages 672-687, November.

    More about this item

    Keywords

    ;
    ;
    ;

    JEL classification:

    • G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
    • G24 - Financial Economics - - Financial Institutions and Services - - - Investment Banking; Venture Capital; Brokerage
    • C49 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Other

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:brf:journl:v:5:y:2007:i:1:p:59-77. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Marcio Laurini (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.