Applying Parallel and Distributed Models on Bio-Inspired Algorithms via a Clustering Method

Álvaro Gómez-Rubio, Ricardo Soto, Broderick Crawford, Adrián Jaramillo, David Mancilla, Carlos Castro and Rodrigo Olivares
Additional contact information
Álvaro Gómez-Rubio: Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
Ricardo Soto: Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
Broderick Crawford: Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
Adrián Jaramillo: Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
David Mancilla: Independent Researcher, Valparaíso 2362807, Chile
Carlos Castro: Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile
Rodrigo Olivares: Escuela de Ingeniería Informática, Universidad de Valparaíso, Valparaíso 2362905, Chile

Mathematics, 2022, vol. 10, issue 2, 1-24

Abstract: In the world of optimization, especially concerning metaheuristics, solving complex problems represented by applying big data and constraint instances can be difficult. This is mainly due to the difficulty of implementing efficient solutions that can solve complex optimization problems in adequate time, which do exist in different industries. Big data has demonstrated its efficiency in solving different concerns in information management. In this paper, an approach based on multiprocessing is proposed wherein clusterization and parallelism are used together to improve the search process of metaheuristics when solving large instances of complex optimization problems, incorporating collaborative elements that enhance the quality of the solution. The proposal deals with machine learning algorithms to improve the segmentation of the search space. Particularly, two different clustering methods belonging to automatic learning techniques, are implemented on bio-inspired algorithms to smartly initialize their solution population, and then organize the resolution from the beginning of the search. The results show that this approach is competitive with other techniques in solving a large set of cases of a well-known NP-hard problem without incorporating too much additional complexity into the metaheuristic algorithms.

Keywords: distributed metaheuristics; parallel metaheuristic; big data clustering; optimization problems (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/2/274/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/2/274/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:2:p:274-:d:726050

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().