Miguel Iglesias
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Miguel Iglesias has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Borja Ena
ArcelorMittal, Global R&D Asturias, Avilés, Spain
1 shared publication - César Menéndez
Engineering Projects, University of Oviedo, EIMEM Independencia 13, 33001 Oviedo, Spain
1 shared publication - Diego Díaz
ArcelorMittal Global R&D Asturias, Av. Marques de Suances s/n, 33400 Aviles, Spain
1 shared publication - Pablo Valledor
Global R & D Asturias, ArcelorMittal Inc., 33400 Avilés, Spain
1 shared publication
Latest Publications
- Open Access
- 1 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1476
Improved Method for Parallelization of Evolutionary Metaheuristics
This paper introduces a method for the distribution of any and all population-based metaheuristics. It improves on the naive approach, independent multiple runs, while adding negligible overhead. Existing methods that coordinate instances across a cluster typically require some compromise of more complex design, higher communication loads, and solution propagation rate, requiring more work to develop and more resources to run. The aim of the new method is not to achieve state-of-the-art results, but rather to provide a better baseline method than multiple independent runs. The main concept of the method is that one of the instances receives updates with the current best solution of all other instances. This work describes the general approach and its particularization to both genetic algorithms and ant colony optimization for solving Traveling Salesman Problems (TSPs). It also includes extensive tests on the TSPLIB benchmark problems of resulting quality of the solutions and anytime performance (solution quality versus time to reach it). These tests show that the new method yields better solutions for about two thirds of the problems and equivalent solutions in the remaining third, and consistently exhibits better anytime performance.
- 1 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1476
Open AccessImproved Method for Parallelization of Evolutionary Metaheuristics
This paper introduces a method for the distribution of any and all population-based metaheuristics. It improves on the naive approach, independent multiple runs, while adding negligible overhead. Existing methods that coordinate instances across a cluster typically require some compromise of more complex design, higher communication loads, and solution propagation rate, requiring more work to develop and more resources to run. The aim of the new method is not to achieve state-of-the-art results, but rather to provide a better baseline method than multiple independent runs. The main concept of the method is that one of the instances receives updates with the current best solution of all other instances. This work describes the general approach and its particularization to both genetic algorithms and ant colony optimization for solving Traveling Salesman Problems (TSPs). It also includes extensive tests on the TSPLIB benchmark problems of resulting quality of the solutions and anytime performance (solution quality versus time to reach it). These tests show that the new method yields better solutions for about two thirds of the problems and equivalent solutions in the remaining third, and consistently exhibits better anytime performance.