Please use this identifier to cite or link to this item:
http://www.dspace.espol.edu.ec/handle/123456789/9108
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gracia León, María | - |
dc.contributor.author | Ruiz, Nelson | - |
dc.contributor.author | Echeverría, Fabricio | - |
dc.date.accessioned | 2010-03-04 | - |
dc.date.available | 2010-03-04 | - |
dc.date.issued | 2010-03-04 | - |
dc.identifier.uri | http://www.dspace.espol.edu.ec/handle/123456789/9108 | - |
dc.description.abstract | This work shows the application of the theory of genetic algorithms to an optimization problem of a portfolio of shares. Both of the optimization problems and the theory of genetic algorithms are exposed briefly and are useful to solve two specific problems, to find the best assignment when it is necessary to invest in a group of Mexican shares and another group of Ecuadorian shares. The exposition of this interesting topic is helped by software that allows seeing the step-by-step optimization process by using genetic algorithms. The concepts exposed at the beginning of this work can be better learnt with the use of this software that includes both graphical and numerical results. This software can be extended by adding some code so it is possible to use it to work with any group of shares. Generally speaking, readers who are interested in this topic can find that this work can be a useful beginning of other studies. | en |
dc.language.iso | spa | en |
dc.rights | openAccess | - |
dc.subject | ALGORITMOS GENÉTICOS | en |
dc.subject | CARTERA DE ACCIONES | en |
dc.subject | OPTIMIZACIÓN. | en |
dc.title | Optimización de una cartera de inversiones utilizando algoritmos genéticos | en |
dc.type | Article | en |
Appears in Collections: | Artículos de Tesis de Grado - ICM |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Optimización de una cartera de inversiones utilizando algoritmos.pdf | 883.23 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.