Francisco Javier Rodríguez Díaz
Francisco Javier Rodríguez Díaz
Department of Computer Science and Artificial Intelligence, University of Granada
Zweryfikowany adres z decsai.ugr.es - Strona główna
TytułCytowane przezRok
Hybrid metaheuristics based on evolutionary algorithms and simulated annealing: taxonomy, comparison, and synergy test
FJ Rodriguez, C Garcia-Martinez, M Lozano
IEEE Transactions on Evolutionary Computation 16 (6), 787-800, 2012
602012
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
FJ Rodriguez, M Lozano, C Blum, C García-Martínez
Computers & Operations Research 40 (7), 1829-1841, 2013
572013
An artificial bee colony algorithm for the maximally diverse grouping problem
FJ Rodriguez, M Lozano, C García-Martínez, JD González-Barrera
Information Sciences 230, 183-196, 2013
502013
Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem
C García-Martínez, FJ Rodriguez, M Lozano
European Journal of Operational Research 232 (3), 454-463, 2014
412014
Role differentiation and malleable mating for differential evolution: an analysis on large-scale optimisation
C García-Martínez, FJ Rodríguez, M Lozano
Soft Computing 15 (11), 2109-2126, 2011
382011
Arbitrary function optimisation with metaheuristics
C García-Martínez, FJ Rodriguez, M Lozano
Soft Computing 16 (12), 2115-2133, 2012
34*2012
Optimizing network attacks by artificial bee colony
M Lozano, C García-Martínez, FJ Rodríguez, HM Trujillo
Information Sciences 377, 30-50, 2017
322017
An artificial bee colony algorithm for the unrelated parallel machines scheduling problem
FJ Rodriguez, C García-Martínez, C Blum, M Lozano
International Conference on Parallel Problem Solving from Nature, 143-152, 2012
262012
Tabu search with strategic oscillation for the quadratic minimum spanning tree
M Lozano, F Glover, C García-Martínez, FJ Rodríguez, R Martí
IIE Transactions 46 (4), 414-428, 2014
242014
A simulated annealing method based on a specialised evolutionary algorithm
C García-Martínez, M Lozano, FJ Rodríguez-Díaz
Applied Soft Computing 12 (2), 573-588, 2012
222012
The firefighter problem: Empirical results on random graphs
C García-Martínez, C Blum, FJ Rodriguez, M Lozano
Computers & Operations Research 60, 55-66, 2015
202015
The firefighter problem: application of hybrid ant colony optimization algorithms
C Blum, MJ Blesa, C García-Martínez, FJ Rodríguez, M Lozano
European Conference on Evolutionary Computation in Combinatorial …, 2014
192014
A GA-based multiple simulated annealing
FJ Rodriguez-Diaz, C Garcia-Martinez, M Lozano
Evolutionary Computation (CEC), 2010 IEEE Congress on, 1-7, 2010
182010
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
FJ Rodriguez, C Blum, C García-Martínez, M Lozano
Annals of Operations Research 201 (1), 383-401, 2012
172012
Strategic oscillation for the quadratic multiple knapsack problem
C García-Martínez, F Glover, FJ Rodriguez, M Lozano, R Martí
Computational Optimization and Applications 58 (1), 161-185, 2014
162014
A new memetic algorithm for multi-document summarization based on CHC algorithm and greedy search
M Mendoza, C Cobos, E León, M Lozano, F Rodríguez, ...
Mexican International Conference on Artificial Intelligence, 125-138, 2014
152014
A genetic algorithm for the minimum generating set problem
M Lozano, M Laguna, R Martí, FJ Rodríguez, C García-Martínez
Applied Soft Computing 48, 254-264, 2016
132016
Study and classification of plum varieties using image analysis and deep learning techniques
FJ Rodríguez, A García, PJ Pardo, F Chávez, RM Luque-Baena
Progress in Artificial Intelligence 7 (2), 119-227, 2018
102018
Genetic Algorithms
C García-Martínez, FJ Rodriguez, M Lozano
Handbook of Heuristics, 431--464, 2018
82018
Randomized greedy multi-start algorithm for the minimum common integer partition problem
M Lozano, FJ Rodriguez, D Peralta, C García-Martínez
Engineering Applications of Artificial Intelligence 50, 226-235, 2016
62016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20