Roberto Carballedo

Prof. Dr. Roberto Carballedo

University of Deusto
orcid

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 February 2016 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
Eneko OsabaEneko Osaba
Eneko Osaba
XYXin-She Yang
Xin-She Yang
FDFernando Diaz
Fernando Diaz
PLPedro Lopez-Garcia
Pedro Lopez-Garcia
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's $t$-test, the Holm's test, and the Friedman test. We have also compared the convergence behaviour shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases.Comment: 1 figure, 8 table

1 January 2018 in Neurocomputing
Verified
Journal Article
Open access
Eneko OsabaEneko Osaba
Eneko Osaba
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
FDF. Diaz
F. Diaz
Enrique OnievaEnrique Onieva
Enrique Onieva
AMAntonio D. Masegosa
Antonio D. Masegosa
APA. Perallos
A. Perallos
Researchers who investigate in any area related to computational algorithms (both dening new algorithms or improving existing ones) usually nd large diculties to test their work. Comparisons among dierent researches in this eld are often a hard task, due to the ambiguity or lack of detail in the presentation of the work and its results. On many occasions, the replication of the work conducted by other researchers is required, which leads to a waste of time and a delay in the research advances. The authors of this study propose a procedure to introduce new techniques and their results in the eld of routing problems. In this paper this procedure is detailed, and a set of good practices to follow are deeply described. It is noteworthy that this procedure can be applied to any combinatorial optimization problem. Anyway, the literature of this study is focused on routing problems. This eld has been chosen because of its importance in real world, and its relevance in the actual literature

13 December 2020 in Metals
Verified
Journal Article
Open access
PDF file
TATugce Akyazi
Tugce Akyazi
AGAitor Goti
Aitor Goti
AOAitor Oyarbide-Zubillaga
Aitor Oyarbide-Zubillaga
EAElisabete Alberdi
Elisabete Alberdi
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
Pablo Garcia-BringasPablo Garcia-Bringas
Pablo Garcia-Bringas
The machine tool industry, which is the starting point of all the metal producing activities, is presently undergoing rapid and continuous changes as a result of the fourth industrial revolution Industry 4.0. Manufacturing models are profoundly transforming with emerging digitalization. Smart technologies like artificial intelligence (AI), big data, the Internet of Things (IoT), digital twin, allow the machine tool companies to optimize processes, increase efficiency and reduce waste through a new phase of automation. These technologies, as well, enable the machine tool producers to reach the aim of creating products with improved performance, extended life, high reliability that are eco-efficient. Therefore, Industry 4.0 could be perceived as an invaluable opportunity for the machine tool sector, only if the sector has a competent workforce capable of handling the implementation of new business models and technological developments. The main condition to create this highly qualified workforce is reskilling and upskilling of the current workforce. Once we define the expected evolution of skills requirements, we can clarify the skills mismatch between the workers and job profiles. Only then, we can reduce them by delivering well-developed trainings. For this purpose, this article identifies the current and foreseen skills requirements demanded by the machine tool industry workforce. To this end, we generated an integrated database for the sector with the present and prospective skills needs of the metal processing sector professionals. The presented sectoral database is a fundamental structure that will make the sector acquire targeted industrial reforms. It can also be an essential instrument for machine tool companies, policymakers, academics and education or training centers to build well-designed and effective training programs to enhance the skills of the labor force.

20 March 2016
Verified
Book Chapter
Open access
PDF file
Eneko OsabaEneko Osaba
Eneko Osaba
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
XYXin-She Yang
Xin-She Yang
FDFernando Diaz
Fernando Diaz
An evolutionary discrete version of the Firefly Algorithm (EDFA) is presented in this chapter for solving the well-known Vehicle Routing Problem with Time Windows (VRPTW). The contribution of this work is not only the adaptation of the EDFA to the VRPTW, but also with some novel route optimization operators. These operators incorporate the process of minimizing the number of routes for a solution in the search process where node selective extractions and subsequent reinsertion are performed. The new operators analyze all routes of the current solution and thus increase the diversification capacity of the search process (in contrast with the traditional node and arc exchange based operators). With the aim of proving that the proposed EDFA and operators are effective, some different versions of the EDFA are compared. The present work includes the experimentation with all the 56 instances of the well-known VRPTW set. In order to obtain rigorous and fair conclusions, two different statistical tests have been conducted.

4 August 2014 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
Eneko OsabaEneko Osaba
Eneko Osaba
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
FDF. Diaz
F. Diaz
EOE. Onieva
E. Onieva
III. de la Iglesia
I. de la Iglesia
APA. Perallos
A. Perallos
Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distributionz-test.

9 November 2013 in Journal of Zhejiang University SCIENCE C
Verified
Journal Article
Closed access
PDF file
Eneko OsabaEneko Osaba
Eneko Osaba
Enrique OnievaEnrique Onieva
Enrique Onieva
Roberto CarballedoRoberto Carballedo
Roberto Carballedo
FDFernando Díaz
Fernando Díaz
APAsier Perallos
Asier Perallos
XZXiao Zhang
Xiao Zhang
We propose a multi-crossover and adaptive island based population algorithm (MAIPA). This technique divides the entire population into subpopulations, or demes, each with a different crossover function, which can be switched according to the efficiency. In addition, MAIPA reverses the philosophy of conventional genetic algorithms. It gives priority to the autonomous improvement of the individuals (at the mutation phase), and introduces dynamism in the crossover probability. Each subpopulation begins with a very low value of crossover probability, and then varies with the change of the current generation number and the search performance on recent generations. This mechanism helps prevent premature convergence. In this research, the effectiveness of this technique is tested using three well-known routing problems, i.e., the traveling salesman problem (TSP), capacitated vehicle routing problem (CVRP), and vehicle routing problem with backhauls (VRPB). MAIPA proves to be better than a traditional island based genetic algorithm for all these three problems.