Publicacións nas que colabora con José Fernando Díaz Martín (18)

2018

  1. Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems

    Neurocomputing, Vol. 271, pp. 2-8

2017

  1. A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

    Soft Computing, Vol. 21, Núm. 18, pp. 5295-5308

2015

  1. A migration strategy for distributed evolutionary algorithms based on stopping non-promising subpopulations: A case study on routing problems

    International Journal of Artificial Intelligence, Vol. 13, Núm. 2, pp. 46-56

  2. A parallel meta-heuristic for solving a multiple asymmetric traveling salesman problem with simulateneous pickup and delivery modeling demand responsive transport problems

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

  3. An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem

    SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings

2014

  1. A proposal of good practice in the formulation and comparison of meta-heuristics for solving routing problems

    Advances in Intelligent Systems and Computing

  2. A study on the efficiency of neutral crossover operators in genetic algorithms applied to the bin packing problem

    GECCO 2014 - Companion Publication of the 2014 Genetic and Evolutionary Computation Conference

  3. AMCPA: A population metaheuristic with adaptive crossover probability and multi-crossover mechanism for solving combinatorial optimization problems

    International Journal of Artificial Intelligence, Vol. 12, Núm. 2, pp. 1-23

  4. An adaptive multi-crossover population algorithm for solving routing problems

    Studies in Computational Intelligence, Vol. 512, pp. 113-124

  5. Comments on "albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320": A proposal of good practice

    Expert Systems with Applications, Vol. 41, Núm. 4 PART 1, pp. 1530-1531

  6. Crossover versus mutation: A comparative analysis of the evolutionary strategy of genetic algorithms applied to combinatorial optimization problems

    Scientific World Journal, Vol. 2014

  7. Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

    Scientific World Journal, Vol. 2014

  8. On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: A first study on the TSP

    2014 IEEE Conference on Evolving and Adaptive Intelligent Systems, EAIS 2014 - Conference Proceedings

2013

  1. A multi-crossover and adaptive island based population algorithm for solving routing problems

    Journal of Zhejiang University: Science C, Vol. 14, Núm. 11, pp. 815-821

  2. Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems

    SACI 2013 - 8th IEEE International Symposium on Applied Computational Intelligence and Informatics, Proceedings

  3. Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems

    2013 IEEE 8TH INTERNATIONAL SYMPOSIUM ON APPLIED COMPUTATIONAL INTELLIGENCE AND INFORMATICS (SACI 2013)

  4. Discussion related to "wang, C.-H., & Lu, J.-Z. (2009). A hybrid genetic algorithm that optimizes capacitated vehicle routing problem. Expert Systems with Applications, 36(2), 2921-2936"

    Expert Systems with Applications

2012

  1. Simulation tool based on a memetic algorithm to solve a real instance of a dynamic TSP

    Proceedings of the IASTED International Conference on Applied Simulation and Modelling, ASM 2012