This page has only limited features, please log in for full access.

Prof. Dr. Roberto Carballedo
University of Deusto

Basic Info


Research Keywords & Expertise

0 Heuristics
0 ITS
0 Optimization
0 Vehicle Routing
0 Artifical Intelligence

Fingerprints

Optimization
Vehicle Routing
ITS
Heuristics

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
Profile ImageUnai Hernandez-Jayo Faculty of Engineering, Univ...
Profile ImageXin-She Yang Middlesex University
Profile ImageItziar Salaberria Deusto Institute of Technolo...
Profile ImageEneko Osaba Tecnalia Research & Innovati...
Following: 6 users
View all

Feed

Journal article
Published: 13 December 2020 in Metals
Reads 0
Downloads 0

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.

ACS Style

Tugce Akyazi; Aitor Goti; Aitor Oyarbide-Zubillaga; Elisabete Alberdi; Roberto Carballedo; Rafael Ibeas; Pablo Garcia-Bringas. Skills Requirements for the European Machine Tool Sector Emerging from Its Digitalization. Metals 2020, 10, 1665 .

AMA Style

Tugce Akyazi, Aitor Goti, Aitor Oyarbide-Zubillaga, Elisabete Alberdi, Roberto Carballedo, Rafael Ibeas, Pablo Garcia-Bringas. Skills Requirements for the European Machine Tool Sector Emerging from Its Digitalization. Metals. 2020; 10 (12):1665.

Chicago/Turabian Style

Tugce Akyazi; Aitor Goti; Aitor Oyarbide-Zubillaga; Elisabete Alberdi; Roberto Carballedo; Rafael Ibeas; Pablo Garcia-Bringas. 2020. "Skills Requirements for the European Machine Tool Sector Emerging from Its Digitalization." Metals 10, no. 12: 1665.

Journal article
Published: 01 January 2018 in Neurocomputing
Reads 0
Downloads 0

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

ACS Style

E. Osaba; Roberto Carballedo; F. Diaz; E. Onieva; Antonio D. Masegosa; A. Perallos. Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems. Neurocomputing 2018, 271, 2 -8.

AMA Style

E. Osaba, Roberto Carballedo, F. Diaz, E. Onieva, Antonio D. Masegosa, A. Perallos. Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems. Neurocomputing. 2018; 271 ():2-8.

Chicago/Turabian Style

E. Osaba; Roberto Carballedo; F. Diaz; E. Onieva; Antonio D. Masegosa; A. Perallos. 2018. "Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems." Neurocomputing 271, no. : 2-8.

Book chapter
Published: 10 October 2017 in Studies in Computational Intelligence
Reads 0
Downloads 0
ACS Style

Eneko Osaba; Roberto Carballedo; Xin-She Yang; Iztok Jr. Fister; Pedro Lopez-Garcia; Javier Del Ser. On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators. Studies in Computational Intelligence 2017, 69 -89.

AMA Style

Eneko Osaba, Roberto Carballedo, Xin-She Yang, Iztok Jr. Fister, Pedro Lopez-Garcia, Javier Del Ser. On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators. Studies in Computational Intelligence. 2017; ():69-89.

Chicago/Turabian Style

Eneko Osaba; Roberto Carballedo; Xin-She Yang; Iztok Jr. Fister; Pedro Lopez-Garcia; Javier Del Ser. 2017. "On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators." Studies in Computational Intelligence , no. : 69-89.

Journal article
Published: 27 September 2017 in Sensors
Reads 0
Downloads 0

The evolution of the IoT (Internet of Things) paradigm applied to new scenarios as VANETs (Vehicular Ad Hoc Networks) has gained momentum in recent years. Both academia and industry have triggered advanced studies in the IoV (Internet of Vehicles), which is understood as an ecosystem where different types of users (vehicles, elements of the infrastructure, pedestrians) are connected. How to efficiently share the available radio resources among the different types of eligible users is one of the important issues to be addressed. This paper briefly analyzes various concepts presented hitherto in the literature and it proposes an enhanced algorithm for ensuring a robust co-existence of the aforementioned system users. Therefore, this paper introduces an underlay RRM (Radio Resource Management) methodology which is capable of (1) improving cellular spectral efficiency while making a minimal impact on cellular communications and (2) ensuring the different QoS (Quality of Service) requirements of ITS (Intelligent Transportation Systems) applications. Simulation results, where we compare the proposed algorithm to the other two RRM, show the promising spectral efficiency performance of the proposed RRM methodology.

ACS Style

Idoia De La Iglesia; Unai Hernandez-Jayo; Eneko Osaba; Roberto Carballedo. Smart Bandwidth Assignation in an Underlay Cellular Network for Internet of Vehicles. Sensors 2017, 17, 2217 .

AMA Style

Idoia De La Iglesia, Unai Hernandez-Jayo, Eneko Osaba, Roberto Carballedo. Smart Bandwidth Assignation in an Underlay Cellular Network for Internet of Vehicles. Sensors. 2017; 17 (10):2217.

Chicago/Turabian Style

Idoia De La Iglesia; Unai Hernandez-Jayo; Eneko Osaba; Roberto Carballedo. 2017. "Smart Bandwidth Assignation in an Underlay Cellular Network for Internet of Vehicles." Sensors 17, no. 10: 2217.

Conference paper
Published: 01 December 2016 in 2016 IEEE Vehicular Networking Conference (VNC)
Reads 0
Downloads 0

Research activities in the Vehicle-to-Everything domain have gained momentum in the recent years. A strive for “intelligent” cars, at certain stage probably even entirely autonomous, has triggered advanced studies - in both academia and industry. One of the significant issues to be addressed is how to efficiently share the available radio resources among various type of eligible users: legacy cellular and those emerging vehicle-type UEs. This paper proposes an enhanced algorithm for ensuring a robust co-existence of the aforementioned system users. This underlay Radio Resource Management (RRM) algorithm attempts to mitigate the interferences and ensure the different Quality of Service (QoS) requirements of Intelligent Transportation Systems (ITS) applications. Initial simulation results, comparing the proposed algorithm to the two selected State of the Art algorithms, are provided as a proof-of-concept.

ACS Style

Idoia De La Iglesia; Unai Hernandez-Jayo; Maciej Januszewski; Jedrzej Stanczak; Eneko Osaba; Roberto Carballedo. Poster: Efficient cluster-based resource allocation for co-existing vehicle and cellular users. 2016 IEEE Vehicular Networking Conference (VNC) 2016, 1 -2.

AMA Style

Idoia De La Iglesia, Unai Hernandez-Jayo, Maciej Januszewski, Jedrzej Stanczak, Eneko Osaba, Roberto Carballedo. Poster: Efficient cluster-based resource allocation for co-existing vehicle and cellular users. 2016 IEEE Vehicular Networking Conference (VNC). 2016; ():1-2.

Chicago/Turabian Style

Idoia De La Iglesia; Unai Hernandez-Jayo; Maciej Januszewski; Jedrzej Stanczak; Eneko Osaba; Roberto Carballedo. 2016. "Poster: Efficient cluster-based resource allocation for co-existing vehicle and cellular users." 2016 IEEE Vehicular Networking Conference (VNC) , no. : 1-2.

Conference paper
Published: 20 July 2016 in Proceedings of the 2016 on SIGMOD'16 PhD Symposium
Reads 0
Downloads 0

The Golden Ball is a multi-population meta-heuristic based on soccer concepts. It was first designed to solve combinatorial optimization problems. Until now, it has been tested with different kind of problems, but its efficiency has only been compared with some classical algorithms, such as different kind of Genetic Algorithms and Distributed Genetic Algorithms. In this work, the performance of the Golden Ball is compared with the ones obtained by two famous and widely used techniques: an Evolutionary Simulated Annealing and a Tabu Search. These both meta-heuristics are two of the most used ones along the history for solving optimization problems. In this first study, the comparison is performed for the well-known Traveling Salesman Problem.

ACS Style

Eneko Osaba; Roberto Carballedo; Pedro Lopez-Garcia; Fernando Diaz. Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem. Proceedings of the 2016 on SIGMOD'16 PhD Symposium 2016, 1469 -1470.

AMA Style

Eneko Osaba, Roberto Carballedo, Pedro Lopez-Garcia, Fernando Diaz. Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem. Proceedings of the 2016 on SIGMOD'16 PhD Symposium. 2016; ():1469-1470.

Chicago/Turabian Style

Eneko Osaba; Roberto Carballedo; Pedro Lopez-Garcia; Fernando Diaz. 2016. "Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem." Proceedings of the 2016 on SIGMOD'16 PhD Symposium , no. : 1469-1470.

Book chapter
Published: 20 March 2016 in Econometrics for Financial Applications
Reads 0
Downloads 0

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.

ACS Style

Eneko Osaba; Roberto Carballedo; Xin-She Yang; Fernando Diaz. An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows. Econometrics for Financial Applications 2016, 21 -41.

AMA Style

Eneko Osaba, Roberto Carballedo, Xin-She Yang, Fernando Diaz. An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows. Econometrics for Financial Applications. 2016; ():21-41.

Chicago/Turabian Style

Eneko Osaba; Roberto Carballedo; Xin-She Yang; Fernando Diaz. 2016. "An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows." Econometrics for Financial Applications , no. : 21-41.

Journal article
Published: 01 February 2016 in Engineering Applications of Artificial Intelligence
Reads 0
Downloads 0

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 behavior 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.

ACS Style

Eneko Osaba; Xin-She Yang; Fernando Diaz; Pedro Lopez-Garcia; Roberto Carballedo. An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. Engineering Applications of Artificial Intelligence 2016, 48, 59 -71.

AMA Style

Eneko Osaba, Xin-She Yang, Fernando Diaz, Pedro Lopez-Garcia, Roberto Carballedo. An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. Engineering Applications of Artificial Intelligence. 2016; 48 ():59-71.

Chicago/Turabian Style

Eneko Osaba; Xin-She Yang; Fernando Diaz; Pedro Lopez-Garcia; Roberto Carballedo. 2016. "An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems." Engineering Applications of Artificial Intelligence 48, no. : 59-71.

Conference paper
Published: 01 February 2016 in 2016 13th International Conference on Remote Engineering and Virtual Instrumentation (REV)
Reads 0
Downloads 0

This conceptual test shows how the proposed Cooperative Safety system for Vulnerable Road Users (CS4VRU) architecture can be used to alert cyclists about closing vehicles adding a wearable device embedded in their helmet. Over the architecture provided by CS4VRU a safety application has been developed using the cellular as a communications hub that allows cyclist to share his position and receive information about the relative position of surrounding vehicles through a cooperative VANET network. Cyclist is warmed through a set of LEDs installed in his helmet. These LEDs are controlled by a small embedded system connected to the cellular using a Bluetooth Low Energy link.

ACS Style

Unai Hernandez-Jayo; Jagoba Perez; Idoia De-La-Iglesia; Roberto Carballedo. CS4VRU: Remote monitoring and warning system for Vulnerable Road. 2016 13th International Conference on Remote Engineering and Virtual Instrumentation (REV) 2016, 153 -158.

AMA Style

Unai Hernandez-Jayo, Jagoba Perez, Idoia De-La-Iglesia, Roberto Carballedo. CS4VRU: Remote monitoring and warning system for Vulnerable Road. 2016 13th International Conference on Remote Engineering and Virtual Instrumentation (REV). 2016; ():153-158.

Chicago/Turabian Style

Unai Hernandez-Jayo; Jagoba Perez; Idoia De-La-Iglesia; Roberto Carballedo. 2016. "CS4VRU: Remote monitoring and warning system for Vulnerable Road." 2016 13th International Conference on Remote Engineering and Virtual Instrumentation (REV) , no. : 153-158.

Conference paper
Published: 29 May 2015 in Transactions on Petri Nets and Other Models of Concurrency XV
Reads 0
Downloads 0

Transportation is an essential area in the nowadays society. Due to the rapid technological progress, it has gained a great importance, both for business sector and citizenry. Among the different types of transport, one that has gained notoriety recently is the transportation on-demand, because it can affect very positively the people quality of life. There are different kinds of on-demand transportation systems, being the Demand Responsive Transit (DRT) one of the most important one. In this work, a real-life DRT problem is proposed, and modeled as a Rich Traveling Salesman Problem. Specifically, the problem presented is a Multiple Asymmetric Traveling Salesman Problem with Simultaneous Pickup and Delivery. Furthermore, a benchmark for this new problem is also proposed, and its first resolution is offered. For the resolution of this benchmark the recently developed Golden Ball meta-heuristic has been implemented.

ACS Style

E. Osaba; F. Diaz; E. Onieva; Pedro López-García; R. Carballedo; A. Perallos. A Parallel Meta-heuristic for Solving a Multiple Asymmetric Traveling Salesman Problem with Simulateneous Pickup and Delivery Modeling Demand Responsive Transport Problems. Transactions on Petri Nets and Other Models of Concurrency XV 2015, 557 -567.

AMA Style

E. Osaba, F. Diaz, E. Onieva, Pedro López-García, R. Carballedo, A. Perallos. A Parallel Meta-heuristic for Solving a Multiple Asymmetric Traveling Salesman Problem with Simulateneous Pickup and Delivery Modeling Demand Responsive Transport Problems. Transactions on Petri Nets and Other Models of Concurrency XV. 2015; ():557-567.

Chicago/Turabian Style

E. Osaba; F. Diaz; E. Onieva; Pedro López-García; R. Carballedo; A. Perallos. 2015. "A Parallel Meta-heuristic for Solving a Multiple Asymmetric Traveling Salesman Problem with Simulateneous Pickup and Delivery Modeling Demand Responsive Transport Problems." Transactions on Petri Nets and Other Models of Concurrency XV , no. : 557-567.

Conference paper
Published: 01 January 2015 in 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI)
Reads 0
Downloads 0

Nowadays, public transportation has become an essential area for the actual society, which directly affects the quality of life. There are different sort of public transportation systems. One type that receives much attention these days because of its great social interest is the transportation on-demand. Some of the most well-known on-demand transports systems are the Demand Responsive Transit, and the Dial-a-Ride. In this paper, a real-world Dial-a-Ride problem is presented and modeled as a Multi-Attribute Traveling Salesman Problem. In addition, in this work a benchmark of this problem is presented, and the first resolution of this benchmark is offered. For the resolution of the problem an Adaptive Multi-Crossover Population Algorithm has been implemented.

ACS Style

Eneko Osaba; Enrique Onieva; F. Diaz; Roberto Carballedo; P. Lopez; A. Perallos. An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride problem. 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI) 2015, 151 -156.

AMA Style

Eneko Osaba, Enrique Onieva, F. Diaz, Roberto Carballedo, P. Lopez, A. Perallos. An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride problem. 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI). 2015; ():151-156.

Chicago/Turabian Style

Eneko Osaba; Enrique Onieva; F. Diaz; Roberto Carballedo; P. Lopez; A. Perallos. 2015. "An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride problem." 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI) , no. : 151-156.

Conference paper
Published: 12 September 2014 in Communications in Computer and Information Science
Reads 0
Downloads 0

Today virtually all of our vehicles have GPS devices that provide highly accurate positioning. This type of positioning system has also come to public transportation such as trains and trams. These positioning systems represent a cost effective solution for railway companies operating in not evolved regions. The problem in these cases is that the routes of these trains pass through areas where coverage to calculate the position, or to send that position to the control center, is not sufficient. This paper focuses on the problem of the lack of coverage for the wireless transmission of positioning information. It discusses the feasibility of incorporating TETRA radio technology to increase the reliability of communications systems based on commonly mobile technologies (GPRS/3G). The main objective is to analyze the performance of TETRA technology for transmitting positioning information on a rail system. In the analysis, this technology is compared to alternatives based on GPRS and 3G.

ACS Style

Roberto Carballedo; Pablo Fernández; Unai Hernández Jayo; Asier Perallos. Using TETRA Technology for Improving a Decentralized Positioning System for Trains and Trams. Communications in Computer and Information Science 2014, 273 -283.

AMA Style

Roberto Carballedo, Pablo Fernández, Unai Hernández Jayo, Asier Perallos. Using TETRA Technology for Improving a Decentralized Positioning System for Trains and Trams. Communications in Computer and Information Science. 2014; ():273-283.

Chicago/Turabian Style

Roberto Carballedo; Pablo Fernández; Unai Hernández Jayo; Asier Perallos. 2014. "Using TETRA Technology for Improving a Decentralized Positioning System for Trains and Trams." Communications in Computer and Information Science , no. : 273-283.

Comparative study
Published: 04 August 2014 in The Scientific World Journal
Reads 0
Downloads 0

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 distribution z -test.

ACS Style

E. Osaba; Roberto Carballedo; F. Diaz; E. Onieva; I. de la Iglesia; A. Perallos. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems. The Scientific World Journal 2014, 2014, 1 -22.

AMA Style

E. Osaba, Roberto Carballedo, F. Diaz, E. Onieva, I. de la Iglesia, A. Perallos. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems. The Scientific World Journal. 2014; 2014 ():1-22.

Chicago/Turabian Style

E. Osaba; Roberto Carballedo; F. Diaz; E. Onieva; I. de la Iglesia; A. Perallos. 2014. "Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems." The Scientific World Journal 2014, no. : 1-22.

Research article
Published: 03 August 2014 in The Scientific World Journal
Reads 0
Downloads 0

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

ACS Style

E. Osaba; F. Diaz; Roberto Carballedo; E. Onieva; A. Perallos. Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems. The Scientific World Journal 2014, 2014, 1 -17.

AMA Style

E. Osaba, F. Diaz, Roberto Carballedo, E. Onieva, A. Perallos. Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems. The Scientific World Journal. 2014; 2014 ():1-17.

Chicago/Turabian Style

E. Osaba; F. Diaz; Roberto Carballedo; E. Onieva; A. Perallos. 2014. "Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems." The Scientific World Journal 2014, no. : 1-17.

Conference paper
Published: 12 July 2014 in Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
Reads 0
Downloads 0
ACS Style

Eneko Osaba; Fernando Diaz; Roberto Carballedo; Enrique Onieva; Pedro Lopez. A study on the impact of heuristic initialization functions in a genetic algorithm solving the N-queens problem. Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation 2014, 1473 -1474.

AMA Style

Eneko Osaba, Fernando Diaz, Roberto Carballedo, Enrique Onieva, Pedro Lopez. A study on the impact of heuristic initialization functions in a genetic algorithm solving the N-queens problem. Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation. 2014; ():1473-1474.

Chicago/Turabian Style

Eneko Osaba; Fernando Diaz; Roberto Carballedo; Enrique Onieva; Pedro Lopez. 2014. "A study on the impact of heuristic initialization functions in a genetic algorithm solving the N-queens problem." Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation , no. : 1473-1474.

Conference paper
Published: 12 July 2014 in Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
Reads 0
Downloads 0
ACS Style

Eneko Osaba; Fernando Diaz; Roberto Carballedo; Idoia de la Iglesia; Enrique Onieva; Asier Perallos. A study on the efficiency of neutral crossover operators in genetic algorithms applied to the bin packing problem. Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation 2014, 1471 -1472.

AMA Style

Eneko Osaba, Fernando Diaz, Roberto Carballedo, Idoia de la Iglesia, Enrique Onieva, Asier Perallos. A study on the efficiency of neutral crossover operators in genetic algorithms applied to the bin packing problem. Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation. 2014; ():1471-1472.

Chicago/Turabian Style

Eneko Osaba; Fernando Diaz; Roberto Carballedo; Idoia de la Iglesia; Enrique Onieva; Asier Perallos. 2014. "A study on the efficiency of neutral crossover operators in genetic algorithms applied to the bin packing problem." Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation , no. : 1471-1472.

Conference paper
Published: 01 June 2014 in 2014 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS)
Reads 0
Downloads 0

Combinatorial optimization is a widely studied field within artificial intelligence. There are many problems of this type, and many techniques applied to them can be found in the literature. Especially, population techniques have received much attention in this area, being genetic algorithms (GA) the most famous ones. Although throughout history many studies on GAs have been performed, there is still no study like the presented in this work. In this paper, a study on the influence of using heuristic initialization functions in genetic algorithms (GA) applied to combinatorial optimization problems is performed. Being the first phase of this research, the study is conducted using one of the best known problems in combinatorial optimization: the traveling salesman problem. Three different experimentations are carried out, using three different heuristic initialization functions. Additionally, for each experiment four versions of a GA have been developed for the comparison. Each of these variant differs in the initialization phase. The results obtained by each GA are compared to determine the influence of the use of heuristic functions for the initialization of the population.

ACS Style

E. Osaba; R. Carballedo; F. Díaz; E. Onieva; P. Lopez; A. Perallos; Osaba E.. 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, 1 -6.

AMA Style

E. Osaba, R. Carballedo, F. Díaz, E. Onieva, P. Lopez, A. Perallos, Osaba E.. 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; ():1-6.

Chicago/Turabian Style

E. Osaba; R. Carballedo; F. Díaz; E. Onieva; P. Lopez; A. Perallos; Osaba E.. 2014. "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) , no. : 1-6.

Journal article
Published: 05 May 2014 in Sensors
Reads 0
Downloads 0

During the last years, the application of different wireless technologies has been explored in order to enable Internet connectivity from vehicles. In addition, the widespread adoption of smartphones by citizens represents a great opportunity to integrate such nomadic devices inside vehicles in order to provide new and personalized on trip services for passengers. In this paper, a proposal of communication architecture to provide the ubiquitous connectivity needed to enhance the smart train concept is presented and preliminarily tested. It combines an intra-wagon communication system based on nomadic devices connected through a Bluetooth Piconet Network with a highly innovative train-to-ground communication system. In order to validate this communication solution, several tests and simulations have been performed and their results are described in this paper.

ACS Style

Itziar Salaberria; Asier Perallos; Leyre Azpilicueta; Francisco Falcone; Roberto Carballedo; Ignacio Angulo; Pilar Elejoste; Alfonso Bahillo; José Javier Astrain; Jesús Villadangos. Ubiquitous Connected Train Based on Train-to-Ground and Intra-Wagon Communications Capable of Providing on Trip Customized Digital Services for Passengers. Sensors 2014, 14, 8003 -8025.

AMA Style

Itziar Salaberria, Asier Perallos, Leyre Azpilicueta, Francisco Falcone, Roberto Carballedo, Ignacio Angulo, Pilar Elejoste, Alfonso Bahillo, José Javier Astrain, Jesús Villadangos. Ubiquitous Connected Train Based on Train-to-Ground and Intra-Wagon Communications Capable of Providing on Trip Customized Digital Services for Passengers. Sensors. 2014; 14 (5):8003-8025.

Chicago/Turabian Style

Itziar Salaberria; Asier Perallos; Leyre Azpilicueta; Francisco Falcone; Roberto Carballedo; Ignacio Angulo; Pilar Elejoste; Alfonso Bahillo; José Javier Astrain; Jesús Villadangos. 2014. "Ubiquitous Connected Train Based on Train-to-Ground and Intra-Wagon Communications Capable of Providing on Trip Customized Digital Services for Passengers." Sensors 14, no. 5: 8003-8025.

Journal article
Published: 01 March 2014 in Expert Systems with Applications
Reads 0
Downloads 0
ACS Style

Eneko Osaba; Enrique Onieva; F. Díaz; Roberto Carballedo; A. Perallos. 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 2014, 41, 1530 -1531.

AMA Style

Eneko Osaba, Enrique Onieva, F. Díaz, Roberto Carballedo, A. Perallos. 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. 2014; 41 (4):1530-1531.

Chicago/Turabian Style

Eneko Osaba; Enrique Onieva; F. Díaz; Roberto Carballedo; A. Perallos. 2014. "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 41, no. 4: 1530-1531.

Book chapter
Published: 01 January 2014 in Econometrics for Financial Applications
Reads 0
Downloads 0

Throughout the history, Genetic Algorithms (GA) have been widely applied to a broad range of combinatorial optimization problems. Its easy applicability to areas such as transport or industry has been one of the reasons for its great success. In this paper, we propose a new Adaptive Multi-Crossover Population Algorithm (AMCPA). This new technique changes the philosophy of the basic genetic algorithms, giving priority to the mutation phase and providing dynamism to the crossover probability. To prevent the premature convergence, in the proposed AMCPA, the crossover probability begins with a low value, and varies depending on two factors: the algorithm performance on recent generations and the current generation number. Apart from this, as another mechanism to avoid premature convergence, our AMCPA has different crossover functions, which are used alternatively. We test the quality of our new technique applying it to three routing problems: the Traveling Salesman Problem (TSP), the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Backhauls (VRPB). We compare the results with the ones obtained by a basic GA to conclude that our new proposal outperforms it.

ACS Style

E. Osaba; E. Onieva; Roberto Carballedo; F. Diaz; A. Perallos. An Adaptive Multi-Crossover Population Algorithm for Solving Routing Problems. Econometrics for Financial Applications 2014, 512, 113 -124.

AMA Style

E. Osaba, E. Onieva, Roberto Carballedo, F. Diaz, A. Perallos. An Adaptive Multi-Crossover Population Algorithm for Solving Routing Problems. Econometrics for Financial Applications. 2014; 512 ():113-124.

Chicago/Turabian Style

E. Osaba; E. Onieva; Roberto Carballedo; F. Diaz; A. Perallos. 2014. "An Adaptive Multi-Crossover Population Algorithm for Solving Routing Problems." Econometrics for Financial Applications 512, no. : 113-124.