Efficient Differential Grouping Method for Large-scale Constrained Optimization

Autores
Paz, Fabiola; Leguizamón, Guillermo; Mezura Montes, Efrén
Año de publicación
2024
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Solving large-scale constrained optimization problems (LSCOP) using cooperative co-evolutionary (CC) algorithms has received considerable attention in recent years. One of the most critical challenges of CC algorithms is the decomposition of the original problem. Currently, decomposition methods for solving LSCOPs often generate large subcomponents, poor accuracy, and consume significant computational resources. This affects the optimization performance. In this work, we present a decomposition method that aims to form efficient subcomponents that feature high accuracy, good size, and low computational resource cost. The proposal is evaluated on a set of benchmark functions subject to constraints up to 1,000 dimensions widely used in the literature, and compared with other state-of-the-art methods. The results demonstrate that our proposal performs the decomposition efficiently and succeeds in reducing the computational cost, making it a valuable contribution to the field of optimization.
Red de Universidades con Carreras en Informática
Materia
Ciencias Informáticas
Differential Grouping
Interaction Between Variables
Decomposition Methods
Cooperative Co-evolution Algorithms
Large-scale Constrained Optimization
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/176204

id SEDICI_61d14efab4dd5480736ac91215cbd321
oai_identifier_str oai:sedici.unlp.edu.ar:10915/176204
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Efficient Differential Grouping Method for Large-scale Constrained OptimizationPaz, FabiolaLeguizamón, GuillermoMezura Montes, EfrénCiencias InformáticasDifferential GroupingInteraction Between VariablesDecomposition MethodsCooperative Co-evolution AlgorithmsLarge-scale Constrained OptimizationSolving large-scale constrained optimization problems (LSCOP) using cooperative co-evolutionary (CC) algorithms has received considerable attention in recent years. One of the most critical challenges of CC algorithms is the decomposition of the original problem. Currently, decomposition methods for solving LSCOPs often generate large subcomponents, poor accuracy, and consume significant computational resources. This affects the optimization performance. In this work, we present a decomposition method that aims to form efficient subcomponents that feature high accuracy, good size, and low computational resource cost. The proposal is evaluated on a set of benchmark functions subject to constraints up to 1,000 dimensions widely used in the literature, and compared with other state-of-the-art methods. The results demonstrate that our proposal performs the decomposition efficiently and succeeds in reducing the computational cost, making it a valuable contribution to the field of optimization.Red de Universidades con Carreras en Informática2024-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf54-63http://sedici.unlp.edu.ar/handle/10915/176204enginfo:eu-repo/semantics/altIdentifier/isbn/978-950-34-2428-5info:eu-repo/semantics/reference/hdl/10915/172755info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:47:28Zoai:sedici.unlp.edu.ar:10915/176204Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:47:28.746SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Efficient Differential Grouping Method for Large-scale Constrained Optimization
title Efficient Differential Grouping Method for Large-scale Constrained Optimization
spellingShingle Efficient Differential Grouping Method for Large-scale Constrained Optimization
Paz, Fabiola
Ciencias Informáticas
Differential Grouping
Interaction Between Variables
Decomposition Methods
Cooperative Co-evolution Algorithms
Large-scale Constrained Optimization
title_short Efficient Differential Grouping Method for Large-scale Constrained Optimization
title_full Efficient Differential Grouping Method for Large-scale Constrained Optimization
title_fullStr Efficient Differential Grouping Method for Large-scale Constrained Optimization
title_full_unstemmed Efficient Differential Grouping Method for Large-scale Constrained Optimization
title_sort Efficient Differential Grouping Method for Large-scale Constrained Optimization
dc.creator.none.fl_str_mv Paz, Fabiola
Leguizamón, Guillermo
Mezura Montes, Efrén
author Paz, Fabiola
author_facet Paz, Fabiola
Leguizamón, Guillermo
Mezura Montes, Efrén
author_role author
author2 Leguizamón, Guillermo
Mezura Montes, Efrén
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Differential Grouping
Interaction Between Variables
Decomposition Methods
Cooperative Co-evolution Algorithms
Large-scale Constrained Optimization
topic Ciencias Informáticas
Differential Grouping
Interaction Between Variables
Decomposition Methods
Cooperative Co-evolution Algorithms
Large-scale Constrained Optimization
dc.description.none.fl_txt_mv Solving large-scale constrained optimization problems (LSCOP) using cooperative co-evolutionary (CC) algorithms has received considerable attention in recent years. One of the most critical challenges of CC algorithms is the decomposition of the original problem. Currently, decomposition methods for solving LSCOPs often generate large subcomponents, poor accuracy, and consume significant computational resources. This affects the optimization performance. In this work, we present a decomposition method that aims to form efficient subcomponents that feature high accuracy, good size, and low computational resource cost. The proposal is evaluated on a set of benchmark functions subject to constraints up to 1,000 dimensions widely used in the literature, and compared with other state-of-the-art methods. The results demonstrate that our proposal performs the decomposition efficiently and succeeds in reducing the computational cost, making it a valuable contribution to the field of optimization.
Red de Universidades con Carreras en Informática
description Solving large-scale constrained optimization problems (LSCOP) using cooperative co-evolutionary (CC) algorithms has received considerable attention in recent years. One of the most critical challenges of CC algorithms is the decomposition of the original problem. Currently, decomposition methods for solving LSCOPs often generate large subcomponents, poor accuracy, and consume significant computational resources. This affects the optimization performance. In this work, we present a decomposition method that aims to form efficient subcomponents that feature high accuracy, good size, and low computational resource cost. The proposal is evaluated on a set of benchmark functions subject to constraints up to 1,000 dimensions widely used in the literature, and compared with other state-of-the-art methods. The results demonstrate that our proposal performs the decomposition efficiently and succeeds in reducing the computational cost, making it a valuable contribution to the field of optimization.
publishDate 2024
dc.date.none.fl_str_mv 2024-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/176204
url http://sedici.unlp.edu.ar/handle/10915/176204
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/978-950-34-2428-5
info:eu-repo/semantics/reference/hdl/10915/172755
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
54-63
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616338255904768
score 13.070432