<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-01T22:07:58Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/36848" metadataPrefix="mets">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/36848</identifier><datestamp>2026-02-03T11:31:00Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><mets xmlns="http://www.loc.gov/METS/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" ID="&#xa;&#x9;&#x9;&#x9;&#x9;DSpace_ITEM_10630-36848" TYPE="DSpace ITEM" PROFILE="DSpace METS SIP Profile 1.0" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd" OBJID="&#xa;&#x9;&#x9;&#x9;&#x9;hdl:10630/36848">
   <metsHdr CREATEDATE="2026-06-02T00:07:58Z">
      <agent ROLE="CUSTODIAN" TYPE="ORGANIZATION">
         <name>RIUMA. Repositorio Institucional de la Universidad de Málaga</name>
      </agent>
   </metsHdr>
   <dmdSec ID="DMD_10630_36848">
      <mdWrap MDTYPE="MODS">
         <xmlData xmlns:mods="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
            <mods:mods xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
               <mods:name>
                  <mods:role>
                     <mods:roleTerm type="text">author</mods:roleTerm>
                  </mods:role>
                  <mods:namePart>Harada, Tomohiro</mods:namePart>
               </mods:name>
               <mods:name>
                  <mods:role>
                     <mods:roleTerm type="text">author</mods:roleTerm>
                  </mods:role>
                  <mods:namePart>Alba-Torres, Enrique</mods:namePart>
               </mods:name>
               <mods:extension>
                  <mods:dateAccessioned encoding="iso8601">2025-01-23T13:17:08Z</mods:dateAccessioned>
               </mods:extension>
               <mods:extension>
                  <mods:dateAvailable encoding="iso8601">2025-01-23T13:17:08Z</mods:dateAvailable>
               </mods:extension>
               <mods:originInfo>
                  <mods:dateIssued encoding="iso8601">2020-08-20</mods:dateIssued>
               </mods:originInfo>
               <mods:identifier type="citation">Tomohiro Harada and Enrique Alba. 2020. Parallel Genetic Algorithms: A Useful Survey. ACM Comput. Surv. 53, 4, Article 86 (August 2020), 39 pages. https://doi.org/10.1145/3400031</mods:identifier>
               <mods:identifier type="uri">https://hdl.handle.net/10630/36848</mods:identifier>
               <mods:identifier type="doi">10.1145/3400031</mods:identifier>
               <mods:abstract>In this article, we encompass an analysis of the recent advances in parallel genetic algorithms (PGAs). We have selected these algorithms because of the deep interest in many research fields for techniques that can face complex applications where running times and other computational resources are greedily consumed by present solvers, and PGAs act then as efficient procedures that fully use modern computational platforms at the same time that allow the resolution of cutting edge open problems. We have faced this survey on PGAs with the aim of helping newcomers or busy researchers who want to have a wide vision on the field. Then, we discuss the most well-known models and their implementations from a recent (last six years) and useful point of view: we discuss on highly cited articles, keywords, the venues where they can be found, a very comprehensive (and new) taxonomy covering different research domains involved in PGAs, and a set of recent applications. We also introduce a new vision on open challenges, and try to give hints that guide practitioners and specialized researchers. Our conclusion is that there are many advantages to using these techniques, and lots of potential interactions to other evolutionary algorithms, as well as we contribute to creating a body of knowledge in PGAs by summarizing them in a structured way, so that the reader can find this article useful&#xd;
for practical research, graduate teaching, and as a pedagogical guide to this exciting domain.</mods:abstract>
               <mods:language>
                  <mods:languageTerm authority="rfc3066">eng</mods:languageTerm>
               </mods:language>
               <mods:accessCondition type="useAndReproduction" />
               <mods:subject>
                  <mods:topic>Algoritmos genéticos</mods:topic>
               </mods:subject>
               <mods:subject>
                  <mods:topic>Optimización combinatoria</mods:topic>
               </mods:subject>
               <mods:titleInfo>
                  <mods:title>Parallel genetic algorithms: a useful survey</mods:title>
               </mods:titleInfo>
               <mods:genre>journal article</mods:genre>
            </mods:mods>
         </xmlData>
      </mdWrap>
   </dmdSec>
   <amdSec ID="TMD_10630_36848">
      <rightsMD ID="RIG_10630_36848">
         <mdWrap MIMETYPE="text/plain" MDTYPE="OTHER" OTHERMDTYPE="DSpaceDepositLicense">
            <binData>CjEuIEFjZXB0YW5kbyBlc3RhIGxpY2VuY2lhLCB1c3RlZCAoZWwgYXV0b3IvZXMgbyBlbCBwcm9waWV0YXJpby9zIGRlIGxvcyBkZXJlY2hvcyBkZSBhdXRvcikgZ2FyYW50aXphIGEgbGEgVW5pdmVyc2lkYWQgZGUgTcOhbGFnYSBlbCBkZXJlY2hvIG5vIGV4Y2x1c2l2byBkZSBhcmNoaXZhciwgcmVwcm9kdWNpciwgY29udmVydGlyIChjb21vIHNlIGRlZmluZSBtw6FzIGFiYWpvKSwgY29tdW5pY2FyIHkvbyBkaXN0cmlidWlyIHN1IGRvY3VtZW50byBtdW5kaWFsbWVudGUgZW4gZm9ybWF0byBlbGVjdHLDs25pY28uCgoyLiBUYW1iacOpbiBlc3TDoSBkZSBhY3VlcmRvIGNvbiBxdWUgbGEgVW5pdmVyc2lkYWQgZGUgTcOhbGFnYSBwdWVkYSBjb25zZXJ2YXIgbcOhcyBkZSB1bmEgY29waWEgZGUgZXN0ZSBkb2N1bWVudG8geSwgc2luIGFsdGVyYXIgc3UgY29udGVuaWRvLCBjb252ZXJ0aXJsbyBhIGN1YWxxdWllciBmb3JtYXRvIGRlIGZpY2hlcm8sIG1lZGlvIG8gc29wb3J0ZSwgcGFyYSBwcm9ww7NzaXRvcyBkZSBzZWd1cmlkYWQsIHByZXNlcnZhY2nDs24geSBhY2Nlc28uCgozLiBEZWNsYXJhIHF1ZSBlbCBkb2N1bWVudG8gZXMgdW4gdHJhYmFqbyBvcmlnaW5hbCBzdXlvIHkvbyBxdWUgdGllbmUgZWwgZGVyZWNobyBwYXJhIG90b3JnYXIgbG9zIGRlcmVjaG9zIGNvbnRlbmlkb3MgZW4gZXN0YSBsaWNlbmNpYS4gVGFtYmnDqW4gZGVjbGFyYSBxdWUgc3UgZG9jdW1lbnRvIG5vIGluZnJpbmdlLCBlbiB0YW50byBlbiBjdWFudG8gbGUgc2VhIHBvc2libGUgc2FiZXIsIGxvcyBkZXJlY2hvcyBkZSBhdXRvciBkZSBuaW5ndW5hIG90cmEgcGVyc29uYSBvIGVudGlkYWQuCgo0LiBTaSBlbCBkb2N1bWVudG8gY29udGllbmUgbWF0ZXJpYWxlcyBkZSBsb3MgY3VhbGVzIG5vIHRpZW5lIGxvcyBkZXJlY2hvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgaGEgb2J0ZW5pZG8gZWwgcGVybWlzbyBzaW4gcmVzdHJpY2Npw7NuIGRlbCBwcm9waWV0YXJpbyBkZSBsb3MgZGVyZWNob3MgZGUgYXV0b3IgcGFyYSBvdG9yZ2FyIGEgbGEgVW5pdmVyc2lkYWQgZGUgTcOhbGFnYSBsb3MgZGVyZWNob3MgcmVxdWVyaWRvcyBwb3IgZXN0YSBsaWNlbmNpYSwgeSBxdWUgZXNlIG1hdGVyaWFsIGN1eW9zIGRlcmVjaG9zIHNvbiBkZSB0ZXJjZXJvcyBlc3TDoSBjbGFyYW1lbnRlIGlkZW50aWZpY2FkbyB5IHJlY29ub2NpZG8gZW4gZWwgdGV4dG8gbyBjb250ZW5pZG8gZGVsIGRvY3VtZW50byBlbnRyZWdhZG8uCgo1LiBTaSBlbCBkb2N1bWVudG8gc2UgYmFzYSBlbiB1bmEgb2JyYSBxdWUgaGEgc2lkbyBwYXRyb2NpbmFkYSBvIGFwb3lhZGEgcG9yIHVuYSBhZ2VuY2lhIHUgb3JnYW5pemFjacOzbiBkaWZlcmVudGUgZGUgbGEgVW5pdmVyc2lkYWQgZGUgTcOhbGFnYSwgc2UgcHJlc3Vwb25lIHF1ZSBzZSBoYSBjdW1wbGlkbyBjb24gY3VhbHF1aWVyIGRlcmVjaG8gZGUgcmV2aXNpw7NuIHUgb3RyYXMgb2JsaWdhY2lvbmVzIHJlcXVlcmlkYXMgcG9yIGVzdGUgY29udHJhdG8gbyBhY3VlcmRvLgoKNi4gTGEgVW5pdmVyc2lkYWQgZGUgTcOhbGFnYSBpZGVudGlmaWNhcsOhIGNsYXJhbWVudGUgc3UvcyBub21icmUvcyBjb21vIGVsL2xvcyBhdXRvci9lcyBvIHByb3BpZXRhcmlvL3MgZGUgbG9zIGRlcmVjaG9zIGRlbCBkb2N1bWVudG8sIHkgbm8gaGFyw6EgbmluZ3VuYSBhbHRlcmFjacOzbiBkZSBzdSBkb2N1bWVudG8gZGlmZXJlbnRlIGEgbGFzIHBlcm1pdGlkYXMgZW4gZXN0YSBsaWNlbmNpYS4KCg==</binData>
         </mdWrap>
      </rightsMD>
   </amdSec>
   <amdSec ID="FO_10630_36848_3">
      <techMD ID="TECH_O_10630_36848_3">
         <mdWrap MDTYPE="PREMIS">
            <xmlData xmlns:premis="http://www.loc.gov/standards/premis" xsi:schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
               <premis:premis>
                  <premis:object>
                     <premis:objectIdentifier>
                        <premis:objectIdentifierType>URL</premis:objectIdentifierType>
                        <premis:objectIdentifierValue>https://riuma.uma.es/bitstreams/cb32f5e5-72b7-47c6-97f3-0fda0aed2cb2/download</premis:objectIdentifierValue>
                     </premis:objectIdentifier>
                     <premis:objectCategory>File</premis:objectCategory>
                     <premis:objectCharacteristics>
                        <premis:fixity>
                           <premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
                           <premis:messageDigest>921e79890445d807f30ed9cce29e200f</premis:messageDigest>
                        </premis:fixity>
                        <premis:size>2646605</premis:size>
                        <premis:format>
                           <premis:formatDesignation>
                              <premis:formatName>application/pdf</premis:formatName>
                           </premis:formatDesignation>
                        </premis:format>
                     </premis:objectCharacteristics>
                     <premis:originalName>2020 ACM Computing Surveys - Parallel Genetic Algorithms (preprint).pdf</premis:originalName>
                  </premis:object>
               </premis:premis>
            </xmlData>
         </mdWrap>
      </techMD>
   </amdSec>
   <fileSec>
      <fileGrp USE="ORIGINAL">
         <file ID="BITSTREAM_ORIGINAL_10630_36848_3" MIMETYPE="application/pdf" SEQ="3" SIZE="2646605" CHECKSUM="921e79890445d807f30ed9cce29e200f" CHECKSUMTYPE="MD5" ADMID="FO_10630_36848_3" GROUPID="GROUP_BITSTREAM_10630_36848_3">
            <FLocat LOCTYPE="URL" xlink:type="simple" xlink:href="https://riuma.uma.es/bitstreams/cb32f5e5-72b7-47c6-97f3-0fda0aed2cb2/download" />
         </file>
      </fileGrp>
   </fileSec>
   <structMap LABEL="DSpace Object" TYPE="LOGICAL">
      <div TYPE="DSpace Object Contents" ADMID="DMD_10630_36848">
         <div TYPE="DSpace BITSTREAM">
            <fptr FILEID="BITSTREAM_ORIGINAL_10630_36848_3" />
         </div>
      </div>
   </structMap>
</mets>
</metadata></record></GetRecord></OAI-PMH>