Nicolás Caselli

Dr. Nicolás Caselli

School of Computer Science, Faculty of Engineering, Andrés Bello University, Santiago, Región Metropolitana, Chile
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 July 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
Sergio ValdiviaSergio Valdivia
Sergio Valdivia
Ricardo SotoRicardo Soto
Ricardo Soto
Broderick CrawfordBroderick Crawford
Broderick Crawford
Nicolás CaselliNicolás Caselli
Nicolás Caselli
FPFernando Paredes
Fernando Paredes
Rodrigo OlivaresRodrigo Olivares
Rodrigo Olivares
Metaheuristics are smart problem solvers devoted to tackling particularly large optimization problems. During the last 20 years, they have largely been used to solve different problems from the academic as well as from the real-world. However, most of them have originally been designed for operating over real domain variables, being necessary to tailor its internal core, for instance, to be effective in a binary space of solutions. Various works have demonstrated that this internal modification, known as binarization, is not a simple task, since the several existing binarization ways may lead to very different results. This of course forces the user to implement and analyze a large list of binarization schemas for reaching good results. In this paper, we explore two efficient clustering methods, namely KMeans and DBscan to alter a metaheuristic in order to improve it, and thus do not require on the knowledge of an expert user for identifying which binarization strategy works better during the run. Both techniques have widely been applied to solve clustering problems, allowing us to exploit useful information gathered during the search to efficiently control and improve the binarization process. We integrate those techniques to a recent metaheuristic called Crow Search, and we conduct experiments where KMeans and DBscan are contrasted to 32 different binarization methods. The results show that the proposed approaches outperform most of the binarization strategies for a large list of well-known optimization instances.

4 August 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Nicolás CaselliNicolás Caselli
Nicolás Caselli
Ricardo SotoRicardo Soto
Ricardo Soto
Broderick CrawfordBroderick Crawford
Broderick Crawford
Sergio ValdiviaSergio Valdivia
Sergio Valdivia
Rodrigo OlivaresRodrigo Olivares
Rodrigo Olivares
Metaheuristics are intelligent problem-solvers that have been very efficient in solving huge optimization problems for more than two decades. However, the main drawback of these solvers is the need for problem-dependent and complex parameter setting in order to reach good results. This paper presents a new cuckoo search algorithm able to self-adapt its configuration, particularly its population and the abandon probability. The self-tuning process is governed by using machine learning, where cluster analysis is employed to autonomously and properly compute the number of agents needed at each step of the solving process. The goal is to efficiently explore the space of possible solutions while alleviating human effort in parameter configuration. We illustrate interesting experimental results on the well-known set covering problem, where the proposed approach is able to compete against various state-of-the-art algorithms, achieving better results in one single run versus 20 different configurations. In addition, the result obtained is compared with similar hybrid bio-inspired algorithms illustrating interesting results for this proposal.

25 December 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
Nicolás CaselliNicolás Caselli
Nicolás Caselli
Ricardo SotoRicardo Soto
Ricardo Soto
Broderick CrawfordBroderick Crawford
Broderick Crawford
Sergio ValdiviaSergio Valdivia
Sergio Valdivia
ECElizabeth Chicata
Elizabeth Chicata
Rodrigo OlivaresRodrigo Olivares
Rodrigo Olivares
In the optimization field, the ability to efficiently tackle complex and high-dimensional problems remains a persistent challenge. Metaheuristic algorithms, with a particular emphasis on their autonomous variants, are emerging as promising tools to overcome this challenge. The term “autonomous” refers to these variants’ ability to dynamically adjust certain parameters based on their own outcomes, without external intervention. The objective is to leverage the advantages and characteristics of an unsupervised machine learning clustering technique to configure the population parameter with autonomous behavior, and emphasize how we incorporate the characteristics of search space clustering to enhance the intensification and diversification of the metaheuristic. This allows dynamic adjustments based on its own outcomes, whether by increasing or decreasing the population in response to the need for diversification or intensification of solutions. In this manner, it aims to imbue the metaheuristic with features for a broader search of solutions that can yield superior results. This study provides an in-depth examination of autonomous metaheuristic algorithms, including Autonomous Particle Swarm Optimization, Autonomous Cuckoo Search Algorithm, and Autonomous Bat Algorithm. We submit these algorithms to a thorough evaluation against their original counterparts using high-density functions from the well-known CEC LSGO benchmark suite. Quantitative results revealed performance enhancements in the autonomous versions, with Autonomous Particle Swarm Optimization consistently outperforming its peers in achieving optimal minimum values. Autonomous Cuckoo Search Algorithm and Autonomous Bat Algorithm also demonstrated noteworthy advancements over their traditional counterparts. A salient feature of these algorithms is the continuous nature of their population, which significantly bolsters their capability to navigate complex and high-dimensional search spaces. However, like all methodologies, there were challenges in ensuring consistent performance across all test scenarios. The intrinsic adaptability and autonomous decision making embedded within these algorithms herald a new era of optimization tools suited for complex real-world challenges. In sum, this research accentuates the potential of autonomous metaheuristics in the optimization arena, laying the groundwork for their expanded application across diverse challenges and domains. We recommend further explorations and adaptations of these autonomous algorithms to fully harness their potential.

Verified
Journal Article
Open access
PDF file
CTCarlos Toro
Carlos Toro
Walter DiazWalter Diaz
Walter Diaz
Gonzalo ReyesGonzalo Reyes
Gonzalo Reyes
MPMiguel Peña
Miguel Peña
Nicolás CaselliNicolás Caselli
Nicolás Caselli
Eduardo BalladaresEduardo Balladares
Eduardo Balladares
Accurate classification of sulfide minerals during combustion is essential for optimizing pyrometallurgical processes such as flash smelting, where efficient combustion impacts resource utilization, energy efficiency, and emission control. This study presents a deep learning-based approach for classifying visible and near-infrared (VIS-NIR) emission spectra from the combustion of high-grade sulfide minerals. A one-dimensional convolutional neural network (1D-CNN) was developed and trained on experimentally acquired spectral data, achieving a balanced accuracy score of 99.0% in a test set. The optimized deep learning model outperformed conventional machine learning methods, highlighting the effectiveness of deep learning for spectral analysis in high-temperature environments. In addition, Gradient-weighted Class Activation Mapping (Grad-CAM) was applied to enhance model interpretability and identify key spectral regions contributing to classification decisions. The results demonstrated that the model successfully distinguished spectral features associated with different mineral species, offering insights into combustion dynamics. These findings support the potential integration of deep learning for real-time spectral monitoring in industrial flash smelting operations, thereby enabling more precise process control and decision-making.

13 March 2025
Verified
Book Chapter
Closed access
PDF file
MRMarcelo Reyes Rogget
Marcelo Reyes Rogget
DZDavid Ruete Zúñiga
David Ruete Zúñiga
ANAlejandro Caroca Navarro
Alejandro Caroca Navarro
Danilo LealDanilo Leal
Danilo Leal
JMJean Paul Maidana
Jean Paul Maidana
NMNicolás Cruz Madariaga
Nicolás Cruz Madariaga

13 March 2025
Verified
Book Chapter
Closed access
PDF file
DZDavid Ruete Zúñiga
David Ruete Zúñiga
PLPilar López Lira
Pilar López Lira
ANAlejandro Caroca Navarro
Alejandro Caroca Navarro
Mailiu Díaz PeñaMailiu Díaz Peña
Mailiu Díaz Peña
Nicolás CaselliNicolás Caselli
Nicolás Caselli
JMJean Paul Maidana
Jean Paul Maidana