Author
Listed:
- Á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)
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.
Suggested Citation
Álvaro Gómez-Rubio & Ricardo Soto & Broderick Crawford & Adrián Jaramillo & David Mancilla & Carlos Castro & Rodrigo Olivares, 2022.
"Applying Parallel and Distributed Models on Bio-Inspired Algorithms via a Clustering Method,"
Mathematics, MDPI, vol. 10(2), pages 1-24, January.
Handle:
RePEc:gam:jmathe:v:10:y:2022:i:2:p:274-:d:726050
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:2:p:274-:d:726050. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.