Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations
This article proposes the use of a discrete version of the well known Particle Swarm Optimization, DPSO, a metaheuristic optimization algorithm for numerically solving a system of linear Diophantine equations. Likewise, the transformation of this type of problem (i.e. solving a system of equations)...
- Autores:
-
Amaya, Iván
Gómez, Luis
Correa, Rodrigo
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2014
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/71995
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/71995
http://bdigital.unal.edu.co/36467/
- Palabra clave:
- Linear Diophantine equations
objective function
optimization
particle swarm.
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
| id |
UNACIONAL2_8df132eab1b2834d299422e3ec346265 |
|---|---|
| oai_identifier_str |
oai:repositorio.unal.edu.co:unal/71995 |
| network_acronym_str |
UNACIONAL2 |
| network_name_str |
Universidad Nacional de Colombia |
| repository_id_str |
|
| spelling |
Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Amaya, Iván26796d1a-0895-4f38-9148-2b2c06596858300Gómez, Luisc9701fb0-c009-4ef8-9bdd-3a0d8b7ae15f300Correa, Rodrigo45253210-6ef4-4d6f-acb1-0c37bb9874243002019-07-03T14:48:27Z2019-07-03T14:48:27Z2014-06-24https://repositorio.unal.edu.co/handle/unal/71995http://bdigital.unal.edu.co/36467/This article proposes the use of a discrete version of the well known Particle Swarm Optimization, DPSO, a metaheuristic optimization algorithm for numerically solving a system of linear Diophantine equations. Likewise, the transformation of this type of problem (i.e. solving a system of equations) into an optimization one is also shown. The current algorithm is able to find all the integer roots in a given search domain, at least for the examples shown. Simple problems are used to show its efficacy. Moreover, aspects related to the processing time, as well as to the effect of increasing the population and the search space, are discussed. It was found that the strategy shown herein represents a good approach when dealing with systems that have more unknowns than equations, or when it becomes of considerable size, since a big search domain is required.application/pdfspaUniversidad Nacional de Colombia Sede Medellínhttp://revistas.unal.edu.co/index.php/dyna/article/view/37244Universidad Nacional de Colombia Revistas electrónicas UN DynaDynaDYNA; Vol. 81, núm. 185 (2014); 139-144 Dyna; Vol. 81, núm. 185 (2014); 139-144 2346-2183 0012-7353Amaya, Iván and Gómez, Luis and Correa, Rodrigo (2014) Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations. DYNA; Vol. 81, núm. 185 (2014); 139-144 Dyna; Vol. 81, núm. 185 (2014); 139-144 2346-2183 0012-7353 .Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equationsArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTLinear Diophantine equationsobjective functionoptimizationparticle swarm.ORIGINAL37244-162240-1-SP.pdfapplication/pdf419683https://repositorio.unal.edu.co/bitstream/unal/71995/1/37244-162240-1-SP.pdf0d7d9f8753069908e5bb476deb2230f0MD5137244-207736-1-PB.pdfapplication/pdf670496https://repositorio.unal.edu.co/bitstream/unal/71995/2/37244-207736-1-PB.pdf1c763c6b68ca175015a444c38002afd6MD52THUMBNAIL37244-162240-1-SP.pdf.jpg37244-162240-1-SP.pdf.jpgGenerated Thumbnailimage/jpeg4844https://repositorio.unal.edu.co/bitstream/unal/71995/3/37244-162240-1-SP.pdf.jpgb450d430a285e401c90b83e194e5a5b8MD5337244-207736-1-PB.pdf.jpg37244-207736-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg10216https://repositorio.unal.edu.co/bitstream/unal/71995/4/37244-207736-1-PB.pdf.jpgd3c95254748c5edbd5f8f5a80842d05bMD54unal/71995oai:repositorio.unal.edu.co:unal/719952023-06-21 23:03:28.056Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co |
| dc.title.spa.fl_str_mv |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| title |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| spellingShingle |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations Linear Diophantine equations objective function optimization particle swarm. |
| title_short |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| title_full |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| title_fullStr |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| title_full_unstemmed |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| title_sort |
Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations |
| dc.creator.fl_str_mv |
Amaya, Iván Gómez, Luis Correa, Rodrigo |
| dc.contributor.author.spa.fl_str_mv |
Amaya, Iván Gómez, Luis Correa, Rodrigo |
| dc.subject.proposal.spa.fl_str_mv |
Linear Diophantine equations objective function optimization particle swarm. |
| topic |
Linear Diophantine equations objective function optimization particle swarm. |
| description |
This article proposes the use of a discrete version of the well known Particle Swarm Optimization, DPSO, a metaheuristic optimization algorithm for numerically solving a system of linear Diophantine equations. Likewise, the transformation of this type of problem (i.e. solving a system of equations) into an optimization one is also shown. The current algorithm is able to find all the integer roots in a given search domain, at least for the examples shown. Simple problems are used to show its efficacy. Moreover, aspects related to the processing time, as well as to the effect of increasing the population and the search space, are discussed. It was found that the strategy shown herein represents a good approach when dealing with systems that have more unknowns than equations, or when it becomes of considerable size, since a big search domain is required. |
| publishDate |
2014 |
| dc.date.issued.spa.fl_str_mv |
2014-06-24 |
| dc.date.accessioned.spa.fl_str_mv |
2019-07-03T14:48:27Z |
| dc.date.available.spa.fl_str_mv |
2019-07-03T14:48:27Z |
| dc.type.spa.fl_str_mv |
Artículo de revista |
| dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
| dc.type.driver.spa.fl_str_mv |
info:eu-repo/semantics/article |
| dc.type.version.spa.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| dc.type.coar.spa.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
| dc.type.coarversion.spa.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| dc.type.content.spa.fl_str_mv |
Text |
| dc.type.redcol.spa.fl_str_mv |
http://purl.org/redcol/resource_type/ART |
| format |
http://purl.org/coar/resource_type/c_6501 |
| status_str |
publishedVersion |
| dc.identifier.uri.none.fl_str_mv |
https://repositorio.unal.edu.co/handle/unal/71995 |
| dc.identifier.eprints.spa.fl_str_mv |
http://bdigital.unal.edu.co/36467/ |
| url |
https://repositorio.unal.edu.co/handle/unal/71995 http://bdigital.unal.edu.co/36467/ |
| dc.language.iso.spa.fl_str_mv |
spa |
| language |
spa |
| dc.relation.spa.fl_str_mv |
http://revistas.unal.edu.co/index.php/dyna/article/view/37244 |
| dc.relation.ispartof.spa.fl_str_mv |
Universidad Nacional de Colombia Revistas electrónicas UN Dyna Dyna |
| dc.relation.ispartofseries.none.fl_str_mv |
DYNA; Vol. 81, núm. 185 (2014); 139-144 Dyna; Vol. 81, núm. 185 (2014); 139-144 2346-2183 0012-7353 |
| dc.relation.references.spa.fl_str_mv |
Amaya, Iván and Gómez, Luis and Correa, Rodrigo (2014) Discrete particle swarm optimization in the numerical solution of a system of linear diophantine equations. DYNA; Vol. 81, núm. 185 (2014); 139-144 Dyna; Vol. 81, núm. 185 (2014); 139-144 2346-2183 0012-7353 . |
| dc.rights.spa.fl_str_mv |
Derechos reservados - Universidad Nacional de Colombia |
| dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
| dc.rights.license.spa.fl_str_mv |
Atribución-NoComercial 4.0 Internacional |
| dc.rights.uri.spa.fl_str_mv |
http://creativecommons.org/licenses/by-nc/4.0/ |
| dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
Atribución-NoComercial 4.0 Internacional Derechos reservados - Universidad Nacional de Colombia http://creativecommons.org/licenses/by-nc/4.0/ http://purl.org/coar/access_right/c_abf2 |
| eu_rights_str_mv |
openAccess |
| dc.format.mimetype.spa.fl_str_mv |
application/pdf |
| dc.publisher.spa.fl_str_mv |
Universidad Nacional de Colombia Sede Medellín |
| institution |
Universidad Nacional de Colombia |
| bitstream.url.fl_str_mv |
https://repositorio.unal.edu.co/bitstream/unal/71995/1/37244-162240-1-SP.pdf https://repositorio.unal.edu.co/bitstream/unal/71995/2/37244-207736-1-PB.pdf https://repositorio.unal.edu.co/bitstream/unal/71995/3/37244-162240-1-SP.pdf.jpg https://repositorio.unal.edu.co/bitstream/unal/71995/4/37244-207736-1-PB.pdf.jpg |
| bitstream.checksum.fl_str_mv |
0d7d9f8753069908e5bb476deb2230f0 1c763c6b68ca175015a444c38002afd6 b450d430a285e401c90b83e194e5a5b8 d3c95254748c5edbd5f8f5a80842d05b |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 |
| repository.name.fl_str_mv |
Repositorio Institucional Universidad Nacional de Colombia |
| repository.mail.fl_str_mv |
repositorio_nal@unal.edu.co |
| _version_ |
1814089556277854208 |