Filter Results:
- Full text PDF available (23)
Publication Year
2011
2019
- This year (22)
- Last 5 years (62)
- Last 10 years (77)
Publication Type
Co-author
Journals and Conferences
Learn More
- Eneko Osaba, Roberto Carballedo, Fernando DÃaz, Asier Perallos
- 2013 IEEE 8th International Symposium on Applied…
- 2013
Genetic algorithms (GA) are one of the most successful techniques in solving combinatorial optimization problems. Its general character has enabled its application to different types of problems:… (More)
- Pedro López-GarcÃa, Enrique Onieva, Eneko Osaba, Antonio D. Masegosa, Asier Perallos
- IEEE Transactions on Intelligent Transportation…
- 2016
This paper presents a method of optimizing the elements of a hierarchy of fuzzy-rule-based systems (FRBSs). It is a hybridization of a genetic algorithm (GA) and the cross-entropy (CE) method, which… (More)
- Eneko Osaba, Fernando DÃaz, Enrique Onieva
- Applied Intelligence
- 2013
In this paper, a new multiple population based meta-heuristic to solve combinatorial optimization problems is introduced. This meta-heuristic is called Golden Ball (GB), and it is based on soccer… (More)
- Eneko Osaba, Xin-She Yang, Fernando DÃaz, Pedro López-GarcÃa, Roberto Carballedo
- Eng. Appl. of AI
- 2016
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… (More)
- Eneko Osaba, Fernando DÃaz, Roberto Carballedo, Enrique Onieva, Asier Perallos
- TheScientificWorldJournal
- 2014
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… (More)
- Eneko Osaba, Xin-She Yang, Fernando DÃaz, Enrique Onieva, Antonio D. Masegosa, Asier Perallos
- Soft Comput.
- 2017
A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich… (More)
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… (More)
Combinatorial optimization is a field that receives much attention in artificial intelligence. Many problems of this type can be found in the literature, and a large number of techniques have been… (More)
- Eneko Osaba, Fernando DÃaz, Enrique Onieva
- GECCO
- 2013
In this paper, we describe a new meta-heuristic to solve routing problems. This meta-heuristic is called Golden Ball (GB), and it is based on soccer concepts. To prove its quality we apply it to the… (More)
- Eneko Osaba, Roberto Carballedo, Fernando DÃaz, Enrique Onieva, I. de la Iglesia, Asier Perallos
- TheScientificWorldJournal
- 2014
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… (More)