Publicaciones en colaboración con investigadores/as de Universidad de Córdoba (22)

2018

  1. Genetic algorithms

    Handbook of Heuristics (Springer International Publishing), pp. 431-464

2017

  1. GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem

    Computers and Operations Research, Vol. 78, pp. 243-254

  2. Optimizing network attacks by artificial bee colony

    Information Sciences, Vol. 377, pp. 30-50

2016

  1. A genetic algorithm for the minimum generating set problem

    Applied Soft Computing Journal, Vol. 48, pp. 254-264

  2. Randomized greedy multi-start algorithm for the minimum common integer partition problem

    Engineering Applications of Artificial Intelligence, Vol. 50, pp. 226-235

2015

  1. A two-stage constructive method for the unweighted minimum string cover problem

    Knowledge-Based Systems, Vol. 77, pp. 103-113

  2. The firefighter problem: Empirical results on random graphs

    Computers and Operations Research, Vol. 60, pp. 55-66

2014

  1. Strategic oscillation for the quadratic multiple knapsack problem

    Computational Optimization and Applications, Vol. 58, Núm. 1, pp. 161-185

  2. Tabu search with strategic oscillation for the quadratic minimum spanning tree

    IIE Transactions (Institute of Industrial Engineers), Vol. 46, Núm. 4, pp. 414-428

  3. Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem

    European Journal of Operational Research, Vol. 232, Núm. 3, pp. 454-463

  4. The firefighter problem: Application of hybrid ant colony optimization algorithms

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013

  1. An artificial bee colony algorithm for the maximally diverse grouping problem

    Information Sciences, Vol. 230, pp. 183-196

  2. An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

    Computers and Operations Research, Vol. 40, Núm. 7, pp. 1829-1841

2012

  1. A simulated annealing method based on a specialised evolutionary algorithm

    Applied Soft Computing Journal, Vol. 12, Núm. 2, pp. 573-588

  2. An artificial bee colony algorithm for the unrelated parallel machines scheduling problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Arbitrary function optimisation with metaheuristics: No free lunch and real-world problems: No free lunch and real-world problems

    Soft Computing, Vol. 16, Núm. 12, pp. 2115-2133

  4. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

    Annals of Operations Research, Vol. 201, Núm. 1, pp. 383-401

  5. Hybrid metaheuristics based on evolutionary algorithms and simulated annealing: Taxonomy, comparison, and synergy test

    IEEE Transactions on Evolutionary Computation, Vol. 16, Núm. 6, pp. 787-800

  6. Iterated greedy algorithms for the maximal covering location problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2011

  1. Analysing the significance of no free lunch theorems on the set of real-world binary problems

    International Conference on Intelligent Systems Design and Applications, ISDA