Publicación: AN OPPOSITION-BASED LEARNING CRO ALGORITHM FOR SOLVING THE SHORTEST COMMON SUPERSEQUENCE PROBLEM
| dc.creator | JOEL ALEJANDRO FUENTES LÓPEZ | |
| dc.date | 2022 | |
| dc.date.accessioned | 2025-01-10T15:31:06Z | |
| dc.date.available | 2025-01-10T15:31:06Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | AS A NON-DETERMINISTIC POLYNOMIAL HARD (NP-HARD) PROBLEM, THE SHORTEST COMMON SUPERSEQUENCE (SCS) PROBLEM IS NORMALLY SOLVED BY HEURISTIC OR METAHEURISTIC ALGORITHMS. ONE TYPE OF METAHEURISTIC ALGORITHMS THAT HAS RELATIVELY GOOD PERFORMANCE FOR SOLVING SCS PROBLEMS IS THE CHEMICAL REACTION OPTIMIZATION (CRO) ALGORITHM. SEVERAL CRO-BASED PROPOSALS EXIST; HOWEVER, THEY FACE SUCH PROBLEMS AS UNSTABLE MOLECULAR POPULATION QUALITY, UNEVEN DISTRIBUTION, AND LOCAL OPTIMUM (PREMATURE) SOLUTIONS. TO OVERCOME THESE PROBLEMS, WE PROPOSE A NEW APPROACH FOR THE SEARCH MECHANISM OF CRO-BASED ALGORITHMS. IT COMBINES THE OPPOSITION-BASED LEARNING (OBL) MECHANISM WITH THE PREVIOUSLY STUDIED IMPROVED CHEMICAL REACTION OPTIMIZATION (IMCRO) ALGORITHM. THIS UPGRADED VERSION IS DUBBED OBLIMCRO. IN ITS INITIALIZATION PHASE, THE OPPOSITE POPULATION IS CONSTRUCTED FROM A RANDOM POPULATION BASED ON OBL; THEN, THE INITIAL POPULATION IS GENERATED BY SELECTING MOLECULES WITH THE LOWEST POTENTIAL ENERGY FROM THE RANDOM AND OPPOSITE POPULATIONS. IN THE ITERATIVE PHASE, REACTION OPERATORS CREATE NEW MOLECULES, WHERE THE FINAL POPULATION UPDATE IS PERFORMED. EXPERIMENTS SHOW THAT THE AVERAGE RUNNING TIME OF OBLIMCRO IS MORE THAN 50% LESS THAN THE AVERAGE RUNNING TIME OF CRO_SCS AND ITS BASELINE ALGORITHM, IMCRO, FOR THE DESOXYRIBONUCLEIC ACID (DNA) AND PROTEIN DATASETS. | |
| dc.format | application/pdf | |
| dc.identifier.doi | 10.3390/e24050641 | |
| dc.identifier.issn | 1099-4300 | |
| dc.identifier.issn | 1099-4300 | |
| dc.identifier.uri | https://repositorio.ubiobio.cl/handle/123456789/12394 | |
| dc.language | spa | |
| dc.publisher | Entropy | |
| dc.relation.uri | 10.3390/e24050641 | |
| dc.rights | PUBLICADA | |
| dc.title | AN OPPOSITION-BASED LEARNING CRO ALGORITHM FOR SOLVING THE SHORTEST COMMON SUPERSEQUENCE PROBLEM | |
| dc.title.alternative | UN ALGORITMO CRO DE APRENDIZAJE BASADO EN LA OPOSICIÓN PARA RESOLVER EL PROBLEMA DE SUPERSECUENCIA COMÚN MÁS CORTO | |
| dc.type | ARTÍCULO | |
| dspace.entity.type | Publication | |
| ubb.Estado | PUBLICADA | |
| ubb.Otra Reparticion | DEPARTAMENTO DE CIENCIAS DE LA COMPUTACION Y TECNOLOGIA DE LA INFORMACION. | |
| ubb.Sede | CHILLÁN |
