Daniel Zaldivar Navarro

Dr. Daniel Zaldivar Navarro


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 November 2013 in Expert Systems with Applications
Verified
Journal Article
Closed access
Erik CuevasErik Cuevas
Erik Cuevas
MCMiguel Cienfuegos
Miguel Cienfuegos
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
Marco Antonio Perez-CisnerosMarco Antonio Perez-Cisneros
Marco Antonio Perez-Cisneros

1 September 2014 in Neurocomputing
Verified
Journal Article
Closed access
Diego OlivaDiego Oliva
Diego Oliva
ECErik Cuevas
Erik Cuevas
Gonzalo Pajares MartinsanzGonzalo Pajares Martinsanz
Gonzalo Pajares Martinsanz
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
Valentín Osuna-EncisoValentín Osuna-Enciso
Valentín Osuna-Enciso

1 July 2010 in Expert Systems with Applications
Verified
Journal Article
Closed access
Erik CuevasErik Cuevas
Erik Cuevas
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
Marco Antonio Perez-CisnerosMarco Antonio Perez-Cisneros
Marco Antonio Perez-Cisneros

23 October 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
Diego OlivaDiego Oliva
Diego Oliva
Erik CuevasErik Cuevas
Erik Cuevas
Gonzalo Pajares MartinsanzGonzalo Pajares Martinsanz
Gonzalo Pajares Martinsanz
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
Marco Antonio Perez-CisnerosMarco Antonio Perez-Cisneros
Marco Antonio Perez-Cisneros
In this paper, a multilevel thresholding (MT) algorithm based on the harmony search algorithm (HSA) is introduced. HSA is an evolutionary method which is inspired in musicians improvising new harmonies while playing. Different to other evolutionary algorithms, HSA exhibits interesting search capabilities still keeping a low computational overhead. The proposed algorithm encodes random samples from a feasible search space inside the image histogram as candidate solutions, whereas their quality is evaluated considering the objective functions that are employed by the Otsu’s or Kapur’s methods. Guided by these objective values, the set of candidate solutions are evolved through the HSA operators until an optimal solution is found. Experimental results demonstrate the high performance of the proposed method for the segmentation of digital images.

1 January 2012 in Information Sciences
Verified
Journal Article
Closed access
Erik CuevasErik Cuevas
Erik Cuevas
Diego OlivaDiego Oliva
Diego Oliva
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
Marco Antonio Perez-CisnerosMarco Antonio Perez-Cisneros
Marco Antonio Perez-Cisneros
Juan Humberto Sossa AzuelaJuan Humberto Sossa Azuela
Juan Humberto Sossa Azuela

6 March 2018 in Energies
Verified
Journal Article
Open access
PDF file
PDPrimitivo Diaz
Primitivo Diaz
Marco Antonio Perez-CisnerosMarco Antonio Perez-Cisneros
Marco Antonio Perez-Cisneros
Erik CuevasErik Cuevas
Erik Cuevas
OAOmar Avalos
Omar Avalos
JGJorge Gálvez
Jorge Gálvez
DNDaniel Zaldivar Navarro
Daniel Zaldivar Navarro
The efficient use of energy in electrical systems has become a relevant topic due to its environmental impact. Parameter identification in induction motors and capacitor allocation in distribution networks are two representative problems that have strong implications in the massive use of energy. From an optimization perspective, both problems are considered extremely complex due to their non-linearity, discontinuity, and high multi-modality. These characteristics make difficult to solve them by using standard optimization techniques. On the other hand, metaheuristic methods have been widely used as alternative optimization algorithms to solve complex engineering problems. The Crow Search Algorithm (CSA) is a recent metaheuristic method based on the intelligent group behavior of crows. Although CSA presents interesting characteristics, its search strategy presents great difficulties when it faces high multi-modal formulations. In this paper, an improved version of the CSA method is presented to solve complex optimization problems of energy. In the new algorithm, two features of the original CSA are modified: (I) the awareness probability (AP) and (II) the random perturbation. With such adaptations, the new approach preserves solution diversity and improves the convergence to difficult high multi-modal optima. In order to evaluate its performance, the proposed algorithm has been tested in a set of four optimization problems which involve induction motors and distribution networks. The results demonstrate the high performance of the proposed method when it is compared with other popular approaches.