Bio-inspired optimization, metaheuristics, multitasking and evolutionary machine learning, plus open-source optimization software.
Bio-inspired optimization and metaheuristics have been part of my research since the late 2000s and a constant thread since my second PhD (2013). I study them as a field in its own right and as a tool for designing and improving learning systems (evolutionary machine learning).
My first contributions applied heuristics such as harmony search to hard problems in telecommunications: multiuser detection, spectrum allocation in cognitive radio, localization in sensor networks and the deployment of wireless networks. Over the years the work has developed along four axes:
New algorithms and operators: grouping and dandelion-encoded harmony search, the coral reefs optimization algorithm (with Sancho Salcedo-Sanz), discrete bat and water-cycle algorithms, novelty search, and multifactorial cellular genetic algorithms for evolutionary multitasking.
Methodology and critical reviews: warnings against the proliferation of metaphor-based algorithms, taxonomies that separate inspiration from algorithmic behaviour, and guidelines for fair comparisons.
Evolutionary machine learning, where evolution designs, prunes, quantizes or trains learning models.
Real-world applications in telecommunications, logistics and routing, energy, scheduling, robotics, community detection and medicine.
The open-source frameworks jMetalPy and VAMOS make many of these methods easy to use. I was invited keynote speaker at GECCO 2025.
In Artificial Intelligence, there is an increasing demand for adaptive models capable of dealing with a diverse spectrum of learning tasks, surpassing the limitations of systems devised to cope with a single task. The recent emergence of General-Purpose Artificial Intelligence Systems (GPAIS) poses model configuration and adaptability challenges at far greater complexity scales than the optimal design of traditional Machine Learning models. Evolutionary Computation (EC) has been a useful tool for both the design and optimization of Machine Learning models, endowing them with the capability to configure and/or adapt themselves to the task under consideration. Therefore, their application to GPAIS is a natural choice. This paper aims to analyze the role of EC in the field of GPAIS, exploring the use of EC for their design or enrichment. We also match GPAIS properties to Machine Learning areas in which EC has had a notable contribution, highlighting recent milestones of EC for GPAIS. Furthermore, we discuss the challenges of harnessing the benefits of EC for GPAIS, presenting different strategies to both design and improve GPAIS with EC, covering tangential areas, identifying research niches, and outlining potential research directions for EC and GPAIS.
@article{molina2025evolutionary,title={{Evolutionary Computation for the Design and Enrichment of General-Purpose Artificial Intelligence Systems: Survey and Prospects}},author={Molina, D. and Poyatos, J. and Del Ser, Javier and García, S. and Ishibuchi, H. and Triguero, I. and Xue, B. and Yao, X. and Herrera, F.},journal={IEEE Transactions on Evolutionary Computation},year={2026},pages={925--941},number={3},volume={30},doi={10.1109/tevc.2025.3530096},}
Neurocomputing
VAMOS: A Framework for Fast, Configurable and Accessible Multiobjective Optimization in Python
Nicolás R. Uribe, Alberto Herrán, Antonio Jesús Nebro, Javier Del Ser, and Jose Manuel Colmenar
Python is widely used for empirical research in multi-objective optimization due to its accessibility and strong scientific ecosystem. However, most Python frameworks store populations as per-solution objects and keep critical computations in the interpreter, which prevents vectorization and significantly limits performance. This design gap makes Python-based metaheuristics much slower than their counterparts in compiled languages. In this paper we introduce VAMOS (Vectorized Architecture for Multiobjective Optimization Suite), a vectorized Python framework for multi-objective evolutionary algorithms (MOEAs). VAMOS maintains all population data in dense numerical arrays and dispatches hot-path operations to interchangeable numerical backends, decoupling algorithm logic from the underlying compute substrate. The framework implements eight MOEAs spanning dominance-based, decomposition-based, and indicator-based paradigms, and exposes rich component-level configurability, including interchangeable operators, external archives, and fine-grained parameter settings. VAMOS also integrates an automated algorithm-configuration module and provides a browser-based graphical interface to simplify use by non-experts. The results show that VAMOS achieves levels of solution quality statistically equivalent to those obtained by MOEAs implemented in state-of-the-art libraries, while reducing wall-clock time by large margins across all tested algorithms. These gains confirm that vectorized population models and backend-agnostic kernels at the core of VAMOS can deliver high performance in Python without compromising algorithmic behavior.
@article{uribe2026vamos,title={{VAMOS: A Framework for Fast, Configurable and Accessible Multiobjective Optimization in Python}},author={Uribe, Nicolás R. and Herrán, Alberto and Nebro, Antonio Jesús and Del Ser, Javier and Colmenar, Jose Manuel},journal={Neurocomputing},pages={135657},year={2026},doi={10.1016/j.neucom.2026.135657},}
Communications in computer and information science
Swarm Intelligence–Based Fractional System Identification on Programmable Logic Controllers for Industrial Applications
David Zamora-Arranz, Juan J. Gude, Pablo G. Bringas, and Javier Del Ser
In Communications in computer and information science, 2026
@inproceedings{zamoraarranz2026swarm,title={{Swarm Intelligence–Based Fractional System Identification on Programmable Logic Controllers for Industrial Applications}},author={Zamora-Arranz, David and Gude, Juan J. and Bringas, Pablo G. and Del Ser, Javier},booktitle={Communications in computer and information science},pages={637--649},year={2026},doi={10.1007/978-3-032-29254-4_51},}
2025
Neural Computing and Applications
Bio-Inspired Computation for Big Data Fusion, Storage, Processing, Learning and Visualization: State of the Art and Future Directions
Ana I. Torre-Bastida, Josu Diaz-de-Arcaya, Eneko Osaba, Khan Muhammad, David Camacho, and Javier Del Ser
This overview gravitates on research achievements that have recently emerged from the confluence between Big Data technologies and bio-inspired computation. A manifold of reasons can be identified for the profitable synergy between these two paradigms, all rooted on the adaptability, intelligence and robustness that biologically inspired principles can provide to technologies aimed to manage, retrieve, fuse and process Big Data efficiently. We delve into this research field by first analyzing in depth the existing literature, with a focus on advances reported in the last few years. This prior literature analysis is complemented by an identification of the new trends and open challenges in Big Data that remain unsolved to date, and that can be effectively addressed by bio-inspired algorithms. As a second contribution, this work elaborates on how bio-inspired algorithms need to be adapted for their use in a Big Data context, in which data fusion becomes crucial as a previous step to allow processing and mining several and potentially heterogeneous data sources. This analysis allows exploring and comparing the scope and efficiency of existing approaches across different problems and domains, with the purpose of identifying new potential applications and research niches. Finally, this survey highlights open issues that remain unsolved to date in this research avenue, alongside a prescription of recommendations for future research.
@article{torrebastida2021bioinspired,title={{Bio-Inspired Computation for Big Data Fusion, Storage, Processing, Learning and Visualization: State of the Art and Future Directions}},author={Torre-Bastida, Ana I. and Diaz-de-Arcaya, Josu and Osaba, Eneko and Muhammad, Khan and Camacho, David and Del Ser, Javier},journal={Neural Computing and Applications},pages={23097--23127},year={2025},number={28},volume={37},doi={10.1007/s00521-021-06332-9},}
IEEE Transactions on Intelligent Transportation Systems
Multi-Objective Optimization for Multimodal Multi-Objective Multi-Point Shortest Path Problem Considering Unforeseeable Road Eventualities
Zhiwei Xu, Kai Zhang, Javier Del Ser, Miqing Li, Xin Xu, Juanjuan He, and 1 more author
IEEE Transactions on Intelligent Transportation Systems, 2025
Multi-objective multi-point shortest path planning problems are commonly encountered in real-world applications. Numerous path planning algorithms have been proposed to accommodate different model assumptions. However, most existing algorithms can only identify a subset of the Pareto optimal paths and overlook equivalent Pareto optimal paths. Relying solely on a subset of Pareto optimal solutions is insufficient to effectively respond to unforeseeable road eventualities in the real-world traffic environment. In this paper, multi-objective multi-point shortest path planning problem is modeled as a multimodal multi-objective optimization problem with necessary points constrains. A multimodal multi-objective evolutionary algorithm using constraint dominance principle-based path comparison strategy and path similarity-based multimodal solutions selection strategy is proposed to address this problem. The proposed constraint dominance principle-based path comparison strategy can effectively navigate through large infeasible regions by relaxing necessary point constraints, thereby obtaining a true constrained Pareto front. The proposed path similarity-based multimodal solutions selection strategy can effectively balance the distribution of solutions in the decision space, thereby preserving multiple equivalent optimal solutions. The proposed algorithm is compared with five state-of-the-art path planning algorithms from the benchmark test suite derived from the 2021 IEEE CEC path planning competition, where city maps are adapted from real transportation networks in Chinese cities, in our experiments. The exceptional performance is demonstrated through thirty independent runs, yielding experimental results that showcase the superiority of the proposed algorithm on the test problem set. This superior performance highlights the potential for designing more resilient path planners suitable for scenarios affected by unpredictable road eventualities.
@article{xu2025multi,title={{Multi-Objective Optimization for Multimodal Multi-Objective Multi-Point Shortest Path Problem Considering Unforeseeable Road Eventualities}},author={Xu, Zhiwei and Zhang, Kai and Del Ser, Javier and Li, Miqing and Xu, Xin and He, Juanjuan and Wu, Ni},journal={IEEE Transactions on Intelligent Transportation Systems},volume={26},number={6},pages={8622--8640},year={2025},doi={10.1109/tits.2025.3556410},}
2024
2024 International Joint Conference on Neural Networks (IJCNN)
Balancing Performance, Efficiency and Robustness in Open-World Machine Learning via Evolutionary Multi-Objective Model Compression
Javier Del Ser, A. Martinez-Seras, Miren Nekane Bilbao, J. L. Lobo, Ibai Laña, and F. Herrera
In 2024 International Joint Conference on Neural Networks (IJCNN), 2024
Best Paper Award at the 2024 International Joint Conference on Neural Networks (IJCNN), selected among more than 1,000 presented papers.
When deploying machine learning models on resource-constrained hardware, reducing the memory footprint required by the model without compromising its performance is critical. Moreover, in open-world scenarios models often operate in dynamic and unpredictable environments where the data distribution evolves over time. Robust models can generalize well to unforeseen circumstances, including out-of-distribution inputs that may not have been encountered during the training phase. This adaptability is essential to handle the inherent variability of real-world data. This work formulates a multi-objective optimization problem that aims at optimizing the quantization resolution of the parameters of an already trained machine learning model based on three conflicting goals: maximizing the performance of the model on its designated learning task, minimizing the memory footprint of the compressed model, and enhancing its robustness against out-of-distribution data. Given the complexity of the resulting combinatorial optimization problem, we employ multi-objective evolutionary algorithms to efficiently obtain an approximation of the Pareto front balancing among the aforementioned objectives. Experiments with a randomized neural network compressed under the proposed formulation are run over several benchmark classification datasets. Different multi-objective solvers are employed to compare their effectiveness in terms of the convergence and diversity of their produced Pareto estimations. Additionally, we assess the achieved equilibrium between the three objectives against a floating-point implementation of the same model. Our experiments reveal that both the computational resources and the robustness of the model can be optimized via evolutionary quantization without significantly sacrificing its performance for the task at hand.
@inproceedings{delser2024balancing,title={{Balancing Performance, Efficiency and Robustness in Open-World Machine Learning via Evolutionary Multi-Objective Model Compression}},author={Del Ser, Javier and Martinez-Seras, A. and Bilbao, Miren Nekane and Lobo, J. L. and Laña, Ibai and Herrera, F.},booktitle={2024 International Joint Conference on Neural Networks (IJCNN)},pages={1--8},year={2024},doi={10.1109/ijcnn60899.2024.10651338},}
2023
Neural Networks
EvoPruneDeepTL: An Evolutionary Pruning Model for Transfer Learning Based Deep Neural Networks
Javier Poyatos, Daniel Molina, Aritz Martinez, Javier Del Ser, and Francisco Herrera
In recent years, Deep Learning models have shown a great performance in complex optimization problems. They generally require large training datasets, which is a limitation in most practical cases. Transfer learning allows importing the first layers of a pre-trained architecture and connecting them to fully-connected layers to adapt them to a new problem. Consequently, the configuration of the these layers becomes crucial for the performance of the model. Unfortunately, the optimization of these models is usually a computationally demanding task. One strategy to optimize Deep Learning models is the pruning scheme. Pruning methods are focused on reducing the complexity of the network, assuming an expected performance penalty of the model once pruned. However, the pruning could potentially be used to improve the performance, using an optimization algorithm to identify and eventually remove unnecessary connections among neurons. This work proposes EvoPruneDeepTL, an evolutionary pruning model for Transfer Learning based Deep Neural Networks which replaces the last fully-connected layers with sparse layers optimized by a genetic algorithm. Depending on its solution encoding strategy, our proposed model can either perform optimized pruning or feature selection over the densely connected part of the neural network. We carry out different experiments with several datasets to assess the benefits of our proposal. Results show the contribution of EvoPruneDeepTL and feature selection to the overall computational efficiency of the network as a result of the optimization process. In particular, the accuracy is improved, reducing at the same time the number of active neurons in the final layers.
@article{poyatos2023evoprunedeeptl,title={{EvoPruneDeepTL: An Evolutionary Pruning Model for Transfer Learning Based Deep Neural Networks}},author={Poyatos, Javier and Molina, Daniel and Martinez, Aritz and Del Ser, Javier and Herrera, Francisco},journal={Neural Networks},volume={158},pages={59--82},year={2023},doi={10.1016/j.neunet.2022.10.011},}
Applied Soft Computing
Multiobjective Evolutionary Pruning of Deep Neural Networks with Transfer Learning for Improving Their Performance and Robustness
Javier Poyatos, Daniel Molina, Aitor Martínez-Seras, Javier Del Ser, and Francisco Herrera
Evolutionary Computation algorithms have been used to solve optimization problems in relation with architectural, hyper-parameter or training configuration, forging the field known today as Neural Architecture Search. These algorithms have been combined with other techniques such as the pruning of Neural Networks, which reduces the complexity of the network, and the Transfer Learning, which lets the import of knowledge from another problem related to the one at hand. The usage of several criteria to evaluate the quality of the evolutionary proposals is also a common case, in which the performance and complexity of the network are the most used criteria. This work proposes MO-EvoPruneDeepTL, a multi-objective evolutionary pruning algorithm. MO-EvoPruneDeepTL uses Transfer Learning to adapt the last layers of Deep Neural Networks, by replacing them with sparse layers evolved by a genetic algorithm, which guides the evolution based in the performance, complexity and robustness of the network, being the robustness a great quality indicator for the evolved models. We carry out different experiments with several datasets to assess the benefits of our proposal. Results show that our proposal achieves promising results in all the objectives, and direct relation are presented among them. The experiments also show that the most influential neurons help us explain which parts of the input images are the most relevant for the prediction of the pruned neural network. Lastly, by virtue of the diversity within the Pareto front of pruning patterns produced by the proposal, it is shown that an ensemble of differently pruned models improves the overall performance and robustness of the trained networks.
@article{poyatos2023multiobjective,title={{Multiobjective Evolutionary Pruning of Deep Neural Networks with Transfer Learning for Improving Their Performance and Robustness}},author={Poyatos, Javier and Molina, Daniel and Martínez-Seras, Aitor and Del Ser, Javier and Herrera, Francisco},journal={Applied Soft Computing},volume={147},pages={110757},year={2023},doi={10.1016/j.asoc.2023.110757},}
IEEE Symposium Series on Computational Intelligence (SSCI)
Evolutionary Multi-Objective Quantization of Randomization-Based Neural Networks
Javier Del Ser, Alain Andrés, Miren Nekane Bilbao, Ibai Laña, and Jesús L. Lobo
In IEEE Symposium Series on Computational Intelligence (SSCI), 2023
The deployment of Machine Learning models on hardware devices has motivated a notable research activity around different strategies to alleviate their complexity and size. This is the case of neural architecture search or pruning in Deep Learning. This work places its focus on simplifying randomization-based neural networks by discovering fixed-point quantization policies that optimally balance the trade-off between performance and complexity reduction featured by these models. Specifically, we propose a combinatorial formulation of this problem, which we show to be efficiently solvable by multi-objective evolutionary algorithms. A benchmark for time series forecasting with Echo State Networks over 400 datasets reveals that high compression ratios can be achieved at practically admissible levels of performance degradation, showcasing the utility of the proposed problem formulation to deploy reservoir computing models on resource-constrained hardware devices.
@inproceedings{delser2023evolutionary,title={{Evolutionary Multi-Objective Quantization of Randomization-Based Neural Networks}},author={Del Ser, Javier and Andrés, Alain and Bilbao, Miren Nekane and Laña, Ibai and Lobo, Jesús L.},booktitle={IEEE Symposium Series on Computational Intelligence (SSCI)},volume={148},pages={1346--1351},year={2023},doi={10.1109/ssci52147.2023.10371852},}
IEEE International Conference on Intelligent Transportation Systems (ITSC)
On the Design and Performance of a Novel Metaheuristic Solver for the Extended Colored Traveling Salesman Problem
Branko Miloradović, Eneko Osaba, Javier Del Ser, Vuk Vujović, and Alessandro V. Papadopoulos
In IEEE International Conference on Intelligent Transportation Systems (ITSC), 2023
Intelligent transportation systems face various challenges, including traffic congestion, environmental pollution, and inefficient transportation management. Optimizing routes and schedules for efficient delivery of goods and services can mitigate the aforementioned problems. Many transportation and routing problems can be modeled as variants of the Traveling Salesmen Problem (TSP) depending on the specific requirements of the scenario at hand. This means that to efficiently solve the routing problem, all locations have to be visited by the available salesmen in a way that minimizes the overall makespan. This becomes a non-trivial problem when the number of salesmen and locations to be visited increases. The problem at hand is modeled as a special TSP variant, called Extended Colored TSP (ECTSP). It has additional constraints when compared to the classical TSP, which further complicates the search for a feasible solution. This work proposes a new metaheuristic approach to efficiently solve the ECTSP. We compare the proposed approach to existing solutions over a series of test instances. The results show a superior performance of our metaheuristic approach with respect to the state of the art, both in terms of solution quality and algorithm’s runtime.
@inproceedings{miloradovic2023design,title={{On the Design and Performance of a Novel Metaheuristic Solver for the Extended Colored Traveling Salesman Problem}},author={Miloradović, Branko and Osaba, Eneko and Del Ser, Javier and Vujović, Vuk and Papadopoulos, Alessandro V.},booktitle={IEEE International Conference on Intelligent Transportation Systems (ITSC)},year={2023},pages={1955--1962},doi={10.1109/itsc57777.2023.10421924},}
International Conference in Optimization and Learning (OLA)
Solving a Multi-Objective Job Shop Scheduling Problem with an Automatically Configured Evolutionary Algorithm
Jesus Para, Javier Del Ser, and Antonio J. Nebro
In International Conference in Optimization and Learning (OLA), 2023
@inproceedings{para2023solving,title={{Solving a Multi-Objective Job Shop Scheduling Problem with an Automatically Configured Evolutionary Algorithm}},author={Para, Jesus and Del Ser, Javier and Nebro, Antonio J.},booktitle={International Conference in Optimization and Learning (OLA)},series={Communications in Computer and Information Science},year={2023},pages={48--61},doi={10.1007/978-3-031-34020-8_4},}
IEEE International Conference on Intelligent Transportation Systems (ITSC)
Efficient Platooning for Urban Last Mile Logistics Using Multi-Objective Optimization: Performance Comparison and Load Strategies
Ibai Laña, Ignacio Inaki Olabarrieta, and Javier Del Ser
In IEEE International Conference on Intelligent Transportation Systems (ITSC), 2023
Urban logistics face significant challenges due to increasing traffic congestion, environmental concerns, and the growing demand for efficient goods transportation within cities. Platooning, a concept by which multiple vehicles travel in close proximity to each other, has emerged as a promising solution to effectively tackle some of the major challenges of urban last mile distribution. However, the coordination of the vehicles that are part of the platoon and the optimal routing of each of the vehicles once they leave the platoon is not a trivial task, so they are usually addressed separately. In this work we propose a novel platoon planning and routing approach specifically designed for urban logistics, which aims to reduce fuel consumption and minimize emissions. We first formulate this scenario mathematically as a multi-objective combinatorial optimization problem driven by two conflicting objectives: the shared convoy time and the total travel time to complete the delivery service. Departing from this problem, we aim to elucidate which is the best cargo assignment strategy, as well as the best performing optimization algorithm to solve the formulated multi-objective problem. Results obtained over a case study in the urban area of Bilbao (Spain) show that including the load assignment problem within the optimization problem has advantages over more rigid algorithmic approaches, while from the algorithmic perspective, the NSGA3 evolutionary metaheuristic reaches slightly superior Pareto quality metrics than other solvers.
@inproceedings{lana2023efficient,title={{Efficient Platooning for Urban Last Mile Logistics Using Multi-Objective Optimization: Performance Comparison and Load Strategies}},author={Laña, Ibai and Olabarrieta, Ignacio Inaki and Del Ser, Javier},booktitle={IEEE International Conference on Intelligent Transportation Systems (ITSC)},pages={4790--4797},year={2023},doi={10.1109/itsc57777.2023.10422602},}
Computers, Environment and Urban Systems
A Framework to Improve Urban Accessibility and Environmental Conditions in Age-Friendly Cities Using Graph Modeling and Multi-Objective Optimization
Iñigo Delgado-Enales, Javier Del Ser, and Patricia Molina-Costa
The rapid growth of cities in recent decades has unleashed several challenges for urban planning, which have been exacerbated by their aging population. Among the most pressing problems in cities are those related to mobility and environmental quality, by which a global concern has flourished around enhancing pedestrian accessibility for both environmental and health-related reasons. To tackle this issue, this paper presents a new framework that combines multi-objective optimization with a graph model that aims to support urban planning and management to enhance age-friendly cities. The framework allows designing urban projects that improve accessibility and reduce noise and/or air pollution through the installation of urban elements (ramps and escalators, elevators, acoustic and vegetation panels), while considering the overall economic cost of the installation. To explore the trade-off between these objectives, we resort to multi-objective evolutionary algorithms, which permit to compute near Pareto-optimal interventions over the graph model of the urban area under study. We showcase the applicability of the proposed framework over two use cases in the city of Barcelona (Spain), both quantitatively and qualitatively. Results evince that the framework can help urban planners make informed decisions towards enhancing urban accessibility and the environmental quality of age-friendly cities.
@article{delgadoenales2023framework,title={{A Framework to Improve Urban Accessibility and Environmental Conditions in Age-Friendly Cities Using Graph Modeling and Multi-Objective Optimization}},author={Delgado-Enales, Iñigo and Del Ser, Javier and Molina-Costa, Patricia},journal={Computers, Environment and Urban Systems},volume={102},pages={101966},year={2023},doi={10.1016/j.compenvurbsys.2023.101966},}
2022
DYNA
Nature- and Bio-Inspired Optimization: The Good, the Bad, the Ugly and the Hopeful
Daniel Molina, Javier Poyatos, Eneko Osaba, Javier Del Ser, and Francisco Herrera
Nowadays, optimization has become an important issue for industrial systems and product development. From an engineering perspective, optimization implies adjusting or fine tuning the design of the system considering performance factors. Unfortunately, in many real-world problems there are no mathematical techniques capable of solving them within reasonable times. Consequently, optimization is done manually in many practical cases. Over the last decades many meta-heuristic optimization techniques have been inspired by natural phenomena and behavioral patterns observed in animals. As such, nature- and bio-inspired optimization allows optimizing a problem without requiring special knowledge about it, but only the fitness function to optimize and mechanisms to create possible solutions. Bio-inspired optimization techniques generate new candidate solutions intelligently in search for the best one for the problem. Although they do not guarantee to obtain the optimum solution, they can autonomously achieve good results within reasonable time, having been successfully used in manifold real-world problems. There are so many bio-inspired optimization proposals in the literature that it could be overwhelming to choose one. This research area is expanding every year, with more bio-inspired techniques, and tools devised to use them in real applications. However, not all bio-inspired solvers are interesting. Many proposals are mathematically similar to well-established meta-heuristics, so they could render equally similar results. Furthermore, the performance of many of them has not been rigorously confirmed by experimentation. This article elaborates on recent applications (the good), the lack of innovation of new metaphor-based algorithms (the bad), poor methodological practices (the ugly) and the exciting future of opportunities and challenges (the hopeful) of this research area. Nature- and bio-inspired optimization can be great alternatives to optimize complex processes in many real-world industrial problems. But above all, the use of bio-inspired solvers requires a global understanding on the current status of this area. Providing such an overarching view to the audience from a multi-faceted perspective is the ultimate purpose of this manuscript.
@article{molina2022natureand,title={{Nature- and Bio-Inspired Optimization: The Good, the Bad, the Ugly and the Hopeful}},author={Molina, Daniel and Poyatos, Javier and Osaba, Eneko and Del Ser, Javier and Herrera, Francisco},journal={DYNA},volume={97},number={2},pages={114--117},year={2022},doi={10.6036/10331},}
Swarm and Evolutionary Computation
Memetic Computing: Accelerating Optimization Heuristics with Problem-Dependent Local Search Methods
Eneko Osaba, Javier Del Ser, Carlos Cotta, and Pablo Moscato
@article{osaba2022memetic,title={{Memetic Computing: Accelerating Optimization Heuristics with Problem-Dependent Local Search Methods}},author={Osaba, Eneko and Del Ser, Javier and Cotta, Carlos and Moscato, Pablo},journal={Swarm and Evolutionary Computation},pages={101047},publisher={Elsevier},year={2022},volume={70},doi={10.1016/j.swevo.2022.101047},}
Swarm and Evolutionary Computation
Evolutionary Multitask Optimization: Fundamental Research Questions, Practices, and Directions for the Future
Eneko Osaba, Javier Del Ser, and Ponnuthurai N. Suganthan
Transfer Optimization has gained a remarkable attention from the Swarm and Evolutionary Computation community in the recent years. It is undeniable that the concepts underlying Transfer Optimization are formulated on solid grounds. However, evidences observed in recent contributions confirm that there are critical aspects that are not properly addressed to date. This short communication aims to engage the readership around a reflection on these issues, and to provide rationale why they remain unsolved. Specifically, we emphasize on three critical points of Evolutionary Multitasking Optimization: i) the plausibility and practical applicability of this paradigm; ii) the novelty of some proposed multitasking methods; and iii) the methodologies used for evaluating newly proposed multitasking algorithms. As a result of this research, we conclude that some important efforts should be directed by the community in order to keep the future of this promising field on the right track. Our ultimate purpose is to unveil gaps in the current literature, so that prospective works can attempt to fix these gaps, avoiding to stumble on the same stones and eventually achieve valuable advances in the area.
@article{osaba2022evolutionary,title={{Evolutionary Multitask Optimization: Fundamental Research Questions, Practices, and Directions for the Future}},author={Osaba, Eneko and Del Ser, Javier and Suganthan, Ponnuthurai N.},journal={Swarm and Evolutionary Computation},volume={75},pages={101203},year={2022},doi={10.1016/j.swevo.2022.101203},}
Cognitive Computation
Evolutionary Multitask Optimization: A Methodological Overview, Challenges, and Future Research Directions
Eneko Osaba, Javier Del Ser, Aritz D. Martinez, and Amir Hussain
In this work, we consider multitasking in the context of solving multiple optimization problems simultaneously by conducting a single search process. The principal goal when dealing with this scenario is to dynamically exploit the existing complementarities among the problems (tasks) being optimized, helping each other through the exchange of valuable knowledge. Additionally, the emerging paradigm of evolutionary multitasking tackles multitask optimization scenarios by using biologically inspired concepts drawn from swarm intelligence and evolutionary computation. The main purpose of this survey is to collect, organize, and critically examine the abundant literature published so far in evolutionary multitasking, with an emphasis on the methodological patterns followed when designing new algorithmic proposals in this area (namely, multifactorial optimization and multipopulation-based multitasking). We complement our critical analysis with an identification of challenges that remain open to date, along with promising research directions that can leverage the potential of biologically inspired algorithms for multitask optimization. Our discussions held throughout this manuscript are offered to the audience as a reference of the general trajectory followed by the community working in this field in recent times, as well as a self-contained entry point for newcomers and researchers interested to join this exciting research avenue.
@article{osaba2022evolutionaryb,title={{Evolutionary Multitask Optimization: A Methodological Overview, Challenges, and Future Research Directions}},author={Osaba, Eneko and Del Ser, Javier and Martinez, Aritz D. and Hussain, Amir},journal={Cognitive Computation},pages={927--954},year={2022},number={3},volume={14},doi={10.1007/s12559-022-10012-8},}
2022 IEEE Congress on Evolutionary Computation (CEC)
A Multifactorial Cellular Genetic Algorithm for Multimodal Multitask Optimization
Eneko Osaba, Javier Del Ser, Aritz Martinez, and Jesus L. Lobo
In 2022 IEEE Congress on Evolutionary Computation (CEC), 2022
In multimodal optimization problems the main goal is to find as many global optima as possible by using a single search process. This type of optimization tasks emerges in many real-world scenarios in assorted fields including medicine, physics, and aerospace, among many others. However, addressing several multimodal optimization problems simultaneously has received little attention from the multitask optimization community to date. Even though solving different multimodal problems at the same time can largely benefit from the existing synergies among the modes of different tasks, this setup has been less studied than other optimization tasks. This work finds its inspiration in the incipient concepts of Evolutionary Multitasking and Multifactorial Optimization to propose a multifactorial Cellular Genetic Algorithm for solving multimodal optimization problems. Our designed algorithm expedites the search for the global optima of different problems at a time by including several algorithmic steps aimed at adapting the search itself as per the synergies found over the exploration of the problems’ landscape. An extensive experimentation has been designed using 14 different functions from the CEC‘2013 competition on multimodal optimization benchmark. Besides evaluating the performance of the devised algorithm to retain the global optima of every function in the benchmark, we also conduct an analysis of the transfer of knowledge among such functions. Finally, we compare its performance to that of a winning proposal in this CEC‘2013 competition so as to reflect on the suitability of the multitasking paradigm to solve multimodal optimization tasks.
@inproceedings{osaba2022multifactorial,title={{A Multifactorial Cellular Genetic Algorithm for Multimodal Multitask Optimization}},author={Osaba, Eneko and Del Ser, Javier and Martinez, Aritz and Lobo, Jesus L.},booktitle={2022 IEEE Congress on Evolutionary Computation (CEC)},year={2022},pages={1--8},doi={10.1109/cec55065.2022.9870324},}
IEEE Transactions on Evolutionary Computation
Adaptive Multi-Factorial Evolutionary Optimization for Multi-Task Reinforcement Learning
Aritz D. Martinez, Javier Del Ser, Eneko Osaba, and Francisco Herrera
IEEE Transactions on Evolutionary Computation, 2022
Evolutionary computation has largely exhibited its potential to complement conventional learning algorithms in a variety of machine learning tasks, especially those related to unsupervised (clustering) and supervised learning. It has not been until lately when the computational efficiency of evolutionary solvers has been put in prospective for training reinforcement learning models. However, most studies framed so far within this context have considered environments and tasks conceived in isolation, without any exchange of knowledge among related tasks. In this manuscript we present A-MFEA-RL, an adaptive version of the well-known MFEA algorithm whose search and inheritance operators are tailored for multitask reinforcement learning environments. Specifically, our approach includes crossover and inheritance mechanisms for refining the exchange of genetic material, which rely on the multilayered structure of modern deep-learning-based reinforcement learning models. In order to assess the performance of the proposed approach, we design an extensive experimental setup comprising multiple reinforcement learning environments of varying levels of complexity, over which the performance of A-MFEA-RL is compared to that furnished by alternative nonevolutionary multitask reinforcement learning approaches. As concluded from the discussion of the obtained results, A-MFEA-RL not only achieves competitive success rates over the simultaneously addressed tasks, but also fosters the exchange of knowledge among tasks that could be intuitively expected to keep a degree of synergistic relationship.
@article{martinez2021adaptive,title={{Adaptive Multi-Factorial Evolutionary Optimization for Multi-Task Reinforcement Learning}},author={Martinez, Aritz D. and Del Ser, Javier and Osaba, Eneko and Herrera, Francisco},journal={IEEE Transactions on Evolutionary Computation},volume={26},number={2},pages={233--247},year={2022},doi={10.1109/tevc.2021.3083362},}
Applied Sciences
Energy-Aware Multi-Objective Job Shop Scheduling Optimization with Metaheuristics in Manufacturing Industries: A Critical Survey, Results, and Perspectives
In recent years, the application of artificial intelligence has been revolutionizing the manufacturing industry, becoming one of the key pillars of what has been called Industry 4.0. In this context, we focus on the job shop scheduling problem (JSP), which aims at productions orders to be carried out, but considering the reduction of energy consumption as a key objective to fulfill. Finding the best combination of machines and jobs to be performed is not a trivial problem and becomes even more involved when several objectives are taken into account. Among them, the improvement of energy savings may conflict with other objectives, such as the minimization of the makespan. In this paper, we provide an in-depth review of the existing literature on multi-objective job shop scheduling optimization with metaheuristics, in which one of the objectives is the minimization of energy consumption. We systematically reviewed and critically analyzed the most relevant features of both problem formulations and algorithms to solve them effectively. The manuscript also informs with empirical results the main findings of our bibliographic critique with a performance comparison among representative multi-objective evolutionary solvers applied to a diversity of synthetic test instances. The ultimate goal of this article is to carry out a critical analysis, finding good practices and opportunities for further improvement that stem from current knowledge in this vibrant research area.
@article{para2022energyaware,title={{Energy-Aware Multi-Objective Job Shop Scheduling Optimization with Metaheuristics in Manufacturing Industries: A Critical Survey, Results, and Perspectives}},author={Para, Jesus and Del Ser, Javier and Nebro, Antonio J.},journal={Applied Sciences},volume={12},number={3},pages={1491},year={2022},doi={10.3390/app12031491},}
2022 IEEE Congress on Evolutionary Computation (CEC)
Improving the Urban Accessibility of Older Pedestrians Using Multi-Objective Optimization
Iñigo Delgado-Enales, Patricia Molina, Eneko Osaba, Silvia Urra-Uriarte, and Javier Del Ser
In 2022 IEEE Congress on Evolutionary Computation (CEC), 2022
Many countries around the world have witnessed the progressive ageing of their population, giving rise to a global concern to respond to the needs that this process will create. Besides the changes in the productive schemes and the evolution of the healthcare resources to new models, the accessibility of pedestrians belonging to this age range is grasping an increasing interest in urban planning processes. This work presents pre-liminary results of a framework that combines graph modeling and meta-heuristic optimization to inform decision makers in urban planning when deciding how to regenerate urban spaces taking into account pedestrian accessibility for the older people in urban areas with difficult orography. The goal of the framework is to decide where to deploy urban elements (mechanical ramps, escalators and lifts), so that an indirect measure of accessibility is improved while also accounting for the economical investment of the installation. We exploit the versatility of multi-objective evolutionary algorithms to tackle the underlying optimization problem. Experimental results of a case study located in the city of Santander (Spain) show that the proposed framework can support urban planners when making decisions regarding the accessibility of the public space.
@inproceedings{delgadoenales2022improving,title={{Improving the Urban Accessibility of Older Pedestrians Using Multi-Objective Optimization}},author={Delgado-Enales, Iñigo and Molina, Patricia and Osaba, Eneko and Urra-Uriarte, Silvia and Del Ser, Javier},booktitle={2022 IEEE Congress on Evolutionary Computation (CEC)},year={2022},pages={1--8},doi={10.1109/cec55065.2022.9870432},}
2022 IEEE Congress on Evolutionary Computation (CEC)
Electric Vehicle Routing Problems: Literature Review, Instances and Results with a Novel Ant Colony Optimization Method
Marios Thymianis, Alexandros Tzanetos, Eneko Osaba, Giorgos Dounias, and Javier Del Ser
In 2022 IEEE Congress on Evolutionary Computation (CEC), 2022
One of the most well-known problems in combinatorial optimization is the Vehicle Routing Problem (VRP). Significant research has been done around this problem in two different perspectives: investigating new solving approaches, and studying variants of VRP which take into consideration multiple restrictions and constraints. One of such versions is the Electric Vehicle Routing Problem (EVRP), whose main objective is to find the optimal route of a fleet of electric vehicles, taking into account the locations of charging stations and the battery consumption of the mobile units. The aim of this study is threefold: (a) to perform a brief literature review on meta-heuristic approaches applied to the EVRP, (b) to offer insights on the available data instances for this problem, and (c) to discuss on the results of an experimental benchmark aimed at comparing different meta-heuristic approaches over diverse EVRP instances, including the proposal and evaluation of a novel Ant Colony Optimization approach.
@inproceedings{thymianis2022electric,title={{Electric Vehicle Routing Problems: Literature Review, Instances and Results with a Novel Ant Colony Optimization Method}},author={Thymianis, Marios and Tzanetos, Alexandros and Osaba, Eneko and Dounias, Giorgos and Del Ser, Javier},booktitle={2022 IEEE Congress on Evolutionary Computation (CEC)},year={2022},pages={1--8},doi={10.1109/cec55065.2022.9870373},}
2021
Swarm and Evolutionary Computation
A Prescription of Methodological Guidelines for Comparing Bio-Inspired Optimization Algorithms
Antonio LaTorre, Daniel Molina, Eneko Osaba, Javier Poyatos, Javier Del Ser, and Francisco Herrera
Bio-inspired optimization (including Evolutionary Computation and Swarm Intelligence) is a growing research topic with many competitive bio-inspired algorithms being proposed every year. In such an active area, preparing a successful proposal of a new bio-inspired algorithm is not an easy task. Given the maturity of this research field, proposing a new optimization technique with innovative elements is no longer enough. Apart from the novelty, results reported by the authors should be proven to achieve a significant advance over previous outcomes from the state of the art. Unfortunately, not all new proposals deal with this requirement properly. Some of them fail to select appropriate benchmarks or reference algorithms to compare with. In other cases, the validation process carried out is not defined in a principled way (or is even not done at all). Consequently, the significance of the results presented in such studies cannot be guaranteed. In this work we review several recommendations in the literature and propose methodological guidelines to prepare a successful proposal, taking all these issues into account. We expect these guidelines to be useful not only for authors, but also for reviewers and editors along their assessment of new contributions to the field.
@article{latorre2021prescription,title={{A Prescription of Methodological Guidelines for Comparing Bio-Inspired Optimization Algorithms}},author={LaTorre, Antonio and Molina, Daniel and Osaba, Eneko and Poyatos, Javier and Del Ser, Javier and Herrera, Francisco},journal={Swarm and Evolutionary Computation},volume={67},pages={100973},publisher={Elsevier},year={2021},doi={10.1016/j.swevo.2021.100973},}
2021 IEEE Symposium Series on Computational Intelligence (SSCI)
More Is Not Always Better: Insights from a Massive Comparison of Meta-Heuristic Algorithms over Real-Parameter Optimization Problems
Javier Del Ser, Eneko Osaba, Aritz D. Martinez, Miren Nekane Bilbao, Javier Poyatos, Daniel Molina, and 1 more author
In 2021 IEEE Symposium Series on Computational Intelligence (SSCI), 2021
Much controversy has been lately risen around the design and performance of modern bio-inspired optimization methods, in particular due to the alleged lack of algorithmic novelty in their definition with respect to traditional heuristic solvers. In this work we present a first attempt at shedding empirical evidence over this debate, for which results of a benchmark with unprecedented scales in terms of problems and algorithms are reported and discussed. Specifically, informed conclusions are held in what refers to the claimed superior performance of these bio-inspired solvers and their competitiveness when compared to competition-winning alternatives. Finally, we prove that the tailored selection of a subset of problems and techniques can unfairly bias the comparisons favoring any of such algorithms, ultimately arriving at illusory conclusions about their comparative performance.
@inproceedings{delser2021more,title={{More Is Not Always Better: Insights from a Massive Comparison of Meta-Heuristic Algorithms over Real-Parameter Optimization Problems}},author={Del Ser, Javier and Osaba, Eneko and Martinez, Aritz D. and Bilbao, Miren Nekane and Poyatos, Javier and Molina, Daniel and Herrera, Francisco},booktitle={2021 IEEE Symposium Series on Computational Intelligence (SSCI)},year={2021},pages={1--7},doi={10.1109/ssci50451.2021.9660030},}
Swarm and Evolutionary Computation
A Tutorial on the Design, Experimentation and Application of Metaheuristic Algorithms to Real-World Optimization Problems
Eneko Osaba, Esther Villar-Rodriguez, Javier Del Ser, Antonio J Nebro, Daniel Molina, Antonio LaTorre, and 3 more authors
In the last few years, the formulation of real-world optimization problems and their efficient solution via metaheuristic algorithms has been a catalyst for a myriad of research studies. In spite of decades of historical advancements on the design and use of metaheuristics, large difficulties still remain in regards to the understandability, algorithmic design uprightness, and performance verifiability of new technical achievements. A clear example stems from the scarce replicability of works dealing with metaheuristics used for optimization, which is often infeasible due to ambiguity and lack of detail in the presentation of the methods to be reproduced. Additionally, in many cases, there is a questionable statistical significance of their reported results. This work aims at providing the audience with a proposal of good practices which should be embraced when conducting studies about metaheuristics methods used for optimization in order to provide scientific rigor, value and transparency. To this end, we introduce a step by step methodology covering every research phase that should be followed when addressing this scientific field. Specifically, frequently overlooked yet crucial aspects and useful recommendations will be discussed in regards to the formulation of the problem, solution encoding, implementation of search operators, evaluation metrics, design of experiments, and considerations for real-world performance, among others. Finally, we will outline important considerations, challenges, and research directions for the success of newly developed optimization metaheuristics in their deployment and operation over real-world application environments.
@article{osaba2021tutorial,title={{A Tutorial on the Design, Experimentation and Application of Metaheuristic Algorithms to Real-World Optimization Problems}},author={Osaba, Eneko and Villar-Rodriguez, Esther and Del Ser, Javier and Nebro, Antonio J and Molina, Daniel and LaTorre, Antonio and Suganthan, Ponnuthurai N and Coello, Carlos A Coello and Herrera, Francisco},journal={Swarm and Evolutionary Computation},volume={64},pages={100888},publisher={Elsevier},year={2021},doi={10.1016/j.swevo.2021.100888},}
Information Sciences
AT-MFCGA: An Adaptive Transfer-Guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking
Eneko Osaba, Javier Del Ser, Aritz D. Martinez, Jesus L. Lobo, and Francisco Herrera
@article{osaba2021atmfcga,title={{AT-MFCGA: An Adaptive Transfer-Guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking}},author={Osaba, Eneko and Del Ser, Javier and Martinez, Aritz D. and Lobo, Jesus L. and Herrera, Francisco},journal={Information Sciences},volume={570},number={C},year={2021},pages={577--598},doi={10.1016/j.ins.2021.05.005},}
2021 IEEE Symposium Series on Computational Intelligence (SSCI)
MO-MFCGA: Multiobjective Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking
Eneko Osaba, Javier Del Ser, Aritz D. Martinez, Jesus L. Lobo, Antonio J. Nebro, and Xin-She Yang
In 2021 IEEE Symposium Series on Computational Intelligence (SSCI), 2021
Multiobjetive optimization has gained a considerable momentum in the evolutionary computation scientific community. Methods coming from evolutionary computation have shown a remarkable performance for solving this kind of optimization problems thanks to their implicit parallelism and the simultaneous convergence towards the Pareto front. In any case, the resolution of multiobjective optimization problems (MOPs) from the perspective of multitasking optimization remains almost unexplored. Multitasking is an incipient research stream which explores how multiple optimization problems can be simultaneously addressed by performing a single search process. The main motivation behind this solving paradigm is to exploit the synergies between the different problems (or tasks) being optimized. Going deeper, we resort in this paper to the also recent paradigm Evolutionary Multitasking (EM). We introduce the adaptation of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) for solving MOPs, giving rise to the Multiobjective MFCGA (MO-MFCGA). An extensive performance analysis is conducted using the Multiobjective Multifactorial Evolutionary Algorithm as comparison baseline. The experimentation is conducted over 10 multitasking setups, using the Multiobjective Euclidean Traveling Salesman Problem as benchmarking problem. We also perform a deep analysis on the genetic transferability among the problem instances employed, using the synergies among tasks aroused along the MO-MFCGA search procedure.
@inproceedings{osaba2021momfcga,title={{MO-MFCGA: Multiobjective Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking}},author={Osaba, Eneko and Del Ser, Javier and Martinez, Aritz D. and Lobo, Jesus L. and Nebro, Antonio J. and Yang, Xin-She},booktitle={2021 IEEE Symposium Series on Computational Intelligence (SSCI)},year={2021},pages={1--8},doi={10.1109/ssci50451.2021.9660024},}
Information Fusion
Lights and Shadows in Evolutionary Deep Learning: Taxonomy, Critical Methodological Analysis, Cases of Study, Learned Lessons, Recommendations, and Challenges
Aritz D. Martinez, Javier Del Ser, Esther Villar-Rodriguez, Eneko Osaba, Javier Poyatos, Siham Tabik, and 2 more authors
@article{martinez2021lights,title={{Lights and Shadows in Evolutionary Deep Learning: Taxonomy, Critical Methodological Analysis, Cases of Study, Learned Lessons, Recommendations, and Challenges}},author={Martinez, Aritz D. and Del Ser, Javier and Villar-Rodriguez, Esther and Osaba, Eneko and Poyatos, Javier and Tabik, Siham and Molina, Daniel and Herrera, Francisco},journal={Information Fusion},volume={67},pages={161--194},year={2021},doi={10.1016/j.inffus.2020.10.014},}
Conferencia de la Asociación Española de Inteligencia Artificial (CAEPIA)
Mejorando Redes Profundas para Aprendizaje por Transferencia mediante Capas Dispersas Optimizadas con Algoritmos Evolutivos
Javier Poyatos Amador, Daniel Molina Cabrera, Aritz Martínez, Siham Tabik, Javier Del Ser, and Francisco Herrera
In Conferencia de la Asociación Española de Inteligencia Artificial (CAEPIA), 2021
@inproceedings{poyatosamador2021mejorando,title={{Mejorando Redes Profundas para Aprendizaje por Transferencia mediante Capas Dispersas Optimizadas con Algoritmos Evolutivos}},author={Poyatos Amador, Javier and Molina Cabrera, Daniel and Martínez, Aritz and Tabik, Siham and Del Ser, Javier and Herrera, Francisco},booktitle={Conferencia de la Asociación Española de Inteligencia Artificial (CAEPIA)},year={2021},}
2020
Cognitive Computation
Comprehensive Taxonomies of Nature- and Bio-Inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations
Daniel Molina, Javier Poyatos, Javier Del Ser, Salvador García, Amir Hussain, and Francisco Herrera
In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.
@article{molina2020comprehensive,title={{Comprehensive Taxonomies of Nature- and Bio-Inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations}},author={Molina, Daniel and Poyatos, Javier and Del Ser, Javier and García, Salvador and Hussain, Amir and Herrera, Francisco},journal={Cognitive Computation},volume={12},number={5},pages={897--939},publisher={Springer US, New York},year={2020},doi={10.1007/s12559-020-09730-8},}
Swarm and Evolutionary Computation
Evolutionary LSTM-FCN Networks for Pattern Classification in Industrial Processes
Patxi Ortego, Alberto Diez-Olivan, Javier Del Ser, Fernando Veiga, Mariluz Penalva, and Basilio Sierra
The Industry 4.0 revolution allows gathering big amounts of data that are used to train and deploy Artificial Intelligence algorithms to solve complex industrial problems, optimally and automatically. From those, Long-Short Term Memory Fully Convolutional Network (LSTM-FCN) networks are gaining a lot of attention over the last decade due to their capability of successfully modeling nonlinear feature interactions. However, they have not been yet fully applied for pattern classification tasks in time series data within the digital industry. In this paper, a novel approach based on an evolutionary algorithm for optimizing the networks hyperparameters and on the resulting deep learning model for pattern classification is proposed. In order to demonstrate the applicability of this method, a test scenario that involves a process related to blind fastener installation in the aeronautical industry is provided. The results achieved with the proposed approach are compared with shallow models and it is demonstrated that the proposed method obtains better results with an accuracy value of 95%.
@article{ortego2020evolutionary,title={{Evolutionary LSTM-FCN Networks for Pattern Classification in Industrial Processes}},author={Ortego, Patxi and Diez-Olivan, Alberto and Del Ser, Javier and Veiga, Fernando and Penalva, Mariluz and Sierra, Basilio},journal={Swarm and Evolutionary Computation},pages={100650},year={2020},volume={54},doi={10.1016/j.swevo.2020.100650},}
IEEE Transactions on Intelligent Transportation Systems
Bioinspired Computational Intelligence and Transportation Systems: A Long Road Ahead
Javier Del Ser, Eneko Osaba, Javier J. Sanchez-Medina, Iztok Fister, and Iztok Fister
IEEE Transactions on Intelligent Transportation Systems, 2020
This paper capitalizes on the increasingly high relevance gained by data-intensive technologies in the development of intelligent transportation system, which calls for the progressive adoption of adaptive, self-learning methods for solving modeling, simulation, and optimization problems. In this regard, certain mechanisms and processes observed in nature, including the animal brain, have proved themselves to excel not only in terms of efficiently capturing time-evolving stimuli, but also at undertaking complex tasks by virtue of mechanisms that can be extrapolated to computer algorithms and methods. This paper comprehensively reviews the state-of-the-art around the application of bioinspired methods to the challenges arising in the broad field of intelligent transportation system (ITS). This systematic survey is complemented by an initiatory taxonomic introduction to bioinspired computational intelligence, along with the basics of its constituent techniques. A focus is placed on which research niches are still unexplored by the community in different ITS subareas. The open issues and research directions for the practical implementation of ITS endowed with bioinspired computational intelligence are also discussed in detail.
@article{delser2020bioinspired,title={{Bioinspired Computational Intelligence and Transportation Systems: A Long Road Ahead}},author={Del Ser, Javier and Osaba, Eneko and Sanchez-Medina, Javier J. and Fister, Iztok and Fister, Iztok},journal={IEEE Transactions on Intelligent Transportation Systems},volume={21},number={2},pages={466--495},year={2020},doi={10.1109/tits.2019.2897377},}
Nature-Inspired Computation in Navigation and Routing Problems
Is the Vehicle Routing Problem Dead? An Overview Through Bioinspired Perspective and a Prospect of Opportunities
Eneko Osaba, Xin-She Yang, and Javier Del Ser
In Nature-Inspired Computation in Navigation and Routing Problems, 2020
@incollection{osaba2020vehicle,title={{Is the Vehicle Routing Problem Dead? An Overview Through Bioinspired Perspective and a Prospect of Opportunities}},author={Osaba, Eneko and Yang, Xin-She and Del Ser, Javier},booktitle={Nature-Inspired Computation in Navigation and Routing Problems},series={Springer Tracts in Nature-Inspired Computing},pages={57--84},publisher={Springer},year={2020},doi={10.1007/978-981-15-1842-3_3},}
Nature-Inspired Computation and Swarm Intelligence
Traveling Salesman Problem: A Perspective Review of Recent Research and New Results with Bio-Inspired Metaheuristics
Eneko Osaba, Xin-She Yang, and Javier Del Ser
In Nature-Inspired Computation and Swarm Intelligence, 2020
The traveling salesman problem (TSP) is one of the most studied problems in computational intelligence and operations research. Since its first formulation, a myriad of works has been published proposing different alternatives for its solution. Additionally, a plethora of advanced formulations have also been proposed by the related practitioners, trying to enhance the applicability of the basic TSP. This chapter is firstly devoted to providing an informed overview on the TSP. For this reason, we first review the recent history of this research area, placing emphasis on milestone studies contributed in recent years. Next, we aim at making a step forward in the field proposing an experimentation hybridizing three different reputed bio-inspired computational metaheuristics (namely, particle swarm optimization, the firefly algorithm, and the bat algorithm) and the novelty search mechanism. For assessing the quality of the implemented methods, 15 different datasets taken from the well-known TSPLIB have been used. We end this chapter by sharing our envisioned status of the field, for which we identify opportunities and challenges which should stimulate research efforts in years to come.
@incollection{osaba2020traveling,title={{Traveling Salesman Problem: A Perspective Review of Recent Research and New Results with Bio-Inspired Metaheuristics}},author={Osaba, Eneko and Yang, Xin-She and Del Ser, Javier},booktitle={Nature-Inspired Computation and Swarm Intelligence},pages={135--164},publisher={Academic Press},year={2020},doi={10.1016/b978-0-12-819714-1.00020-8},}
Applied Soft Computing
Community Detection in Networks Using Bio-Inspired Optimization: Latest Developments, New Results and Perspectives with a Selection of Recent Meta-Heuristics
Eneko Osaba, Javier Del Ser, David Camacho, Miren Nekane Bilbao, and Xin-She Yang
Detecting groups within a set of interconnected nodes is a widely addressed problem that can model a diversity of applications. Unfortunately, detecting the optimal partition of a network is a computationally demanding task, usually conducted by means of optimization methods. Among them, randomized search heuristics have been proven to be efficient approaches. This manuscript is devoted to providing an overview of community detection problems from the perspective of bio-inspired computation. To this end, we first review the recent history of this research area, placing emphasis on milestone studies contributed in the last five years. Next, we present an extensive experimental study to assess the performance of a selection of modern heuristics over weighted directed network instances. Specifically, we combine seven global search heuristics based on two different similarity metrics and eight heterogeneous search operators designed ad-hoc. We compare our methods with six different community detection techniques over a benchmark of 17 Lancichinetti–Fortunato–Radicchi network instances. Ranking statistics of the tested algorithms reveal that the proposed methods perform competitively, but the high variability of the rankings leads to the main conclusion: no clear winner can be declared. This finding aligns with community detection tools available in the literature that hinge on a sequential application of different algorithms in search for the best performing counterpart. We end our research by sharing our envisioned status of this area, for which we identify challenges and opportunities which should stimulate research efforts in years to come.
@article{osaba2020community,title={{Community Detection in Networks Using Bio-Inspired Optimization: Latest Developments, New Results and Perspectives with a Selection of Recent Meta-Heuristics}},author={Osaba, Eneko and Del Ser, Javier and Camacho, David and Bilbao, Miren Nekane and Yang, Xin-She},journal={Applied Soft Computing},volume={87},pages={106010},year={2020},doi={10.1016/j.asoc.2019.106010},}
Expert Systems
On the Design of Hybrid Bio-Inspired Meta-Heuristics for Complex Multiattribute Vehicle Routing Problems
Ana Maria Nogareda, Javier Del Ser, Eneko Osaba, and David Camacho
This paper addresses a multiattribute vehicle routing problem, the rich vehicle routing problem, with time constraints, heterogeneous fleet, multiple depots, multiple routes, and incompatibilities of goods. Four different approaches are presented and applied to 15 real datasets. They are based on two meta‐heuristics, ant colony optimization (ACO) and genetic algorithm (GA), that are applied in their standard formulation and combined as hybrid meta‐heuristics to solve the problem. As such ACO‐GA is a hybrid meta‐heuristic using ACO as main approach and GA as local search. GA‐ACO is a memetic algorithm using GA as main approach and ACO as local search. The results regarding quality and computation time are compared with two commercial tools currently used to solve the problem. Considering the number of customers served, one of the tools and the ACO‐GA approach outperforms the others. Considering the cost, ACO, GA, and GA‐ACO provide better results. Regarding computation time, GA and GA‐ACO have been found the most competitive among the benchmark.
@article{nogareda2020design,title={{On the Design of Hybrid Bio-Inspired Meta-Heuristics for Complex Multiattribute Vehicle Routing Problems}},author={Nogareda, Ana Maria and Del Ser, Javier and Osaba, Eneko and Camacho, David},journal={Expert Systems},volume={37},number={6},year={2020},pages={e12528},doi={10.1111/exsy.12528},}
2019
Swarm and Evolutionary Computation
Bio-Inspired Computation: Where We Stand and What’s Next
Javier Del Ser, Eneko Osaba, Daniel Molina, Xin-She Yang, Sancho Salcedo-Sanz, David Camacho, and 4 more authors
In recent years, the research community has witnessed an explosion of literature dealing with the mimicking of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques.
@article{del2019bio,title={{Bio-Inspired Computation: Where We Stand and What's Next}},author={Del Ser, Javier and Osaba, Eneko and Molina, Daniel and Yang, Xin-She and Salcedo-Sanz, Sancho and Camacho, David and Das, Swagatam and Suganthan, Ponnuthurai N and Coello, Carlos A Coello and Herrera, Francisco},journal={Swarm and Evolutionary Computation},volume={48},pages={220--250},publisher={Elsevier},year={2019},doi={10.1016/j.swevo.2019.04.008},}
Swarm and Evolutionary Computation
A Discrete and Improved Bat Algorithm for Solving a Medical Goods Distribution Problem with Pharmacological Waste Collection
Eneko Osaba, Xin-She Yang, Iztok Fister Jr., Javier Del Ser, Pedro Lopez-Garcia, and Alejo J. Vazquez-Pardavila
The work presented in this paper is focused on the resolution of a real-world drugs distribution problem with pharmacological waste collection. With the aim of properly meeting all the real-world restrictions that comprise this complex problem, we have modeled it as a multi-attribute or rich vehicle routing problem (RVRP). The problem has been modeled as a Clustered Vehicle Routing Problem with Pickups and Deliveries, Asymmetric Variable Costs, Forbidden Roads and Cost Constraints. To the best of authors knowledge, this is the first time that such a RVRP problem is tackled in the literature. For this reason, a benchmark composed of 24 datasets, from 60 to 1000 customers, has also been designed. For the developing of this benchmark, we have used real geographical positions located in Bizkaia, Spain. Furthermore, for the proper dealing of the proposed RVRP, we have developed a Discrete and Improved Bat Algorithm (DaIBA). The main feature of this adaptation is the use of the well-known Hamming Distance to calculate the differences between the bats. An effective improvement has been also contemplated for the proposed DaIBA, which consists on the existence of two different neighborhood structures, which are explored depending on the bat’s distance regarding the best individual of the swarm. For the experimentation, we have compared the performance of our presented DaIBA with three additional approaches: an evolutionary algorithm, an evolutionary simulated annealing and a firefly algorithm. Additionally, with the intention of obtaining rigorous conclusions, two different statistical tests have been conducted: the Friedman’s non-parametric test and the Holm’s post-hoc test. Furthermore, an additional experimentation has been performed in terms of convergence. Finally, the obtained outcomes conclude that the proposed DaIBA is a promising technique for addressing the designed problem.
@article{osaba2019discrete,title={{A Discrete and Improved Bat Algorithm for Solving a Medical Goods Distribution Problem with Pharmacological Waste Collection}},author={Osaba, Eneko and Yang, Xin-She and Fister Jr., Iztok and Del Ser, Javier and Lopez-Garcia, Pedro and Vazquez-Pardavila, Alejo J.},journal={Swarm and Evolutionary Computation},volume={44},pages={273--286},year={2019},doi={10.1016/j.swevo.2018.04.001},}
Applied Mathematics and Computation
Novelty Search for Global Optimization
Iztok Fister, Andres Iglesias, Akemi Galvez, Javier Del Ser, Eneko Osaba, Iztok Fister Jr., and 2 more authors
Novelty search is a tool in evolutionary and swarm robotics for maintaining the diversity of population needed for continuous robotic operation. It enables nature-inspired algorithms to evaluate solutions on the basis of the distance to their k-nearest neighbors in the search space. Besides this, the fitness function represents an additional measure for evaluating the solution, with the purpose of preserving the so-named novelty solutions into the next generation. In this study, a differential evolution was hybridized with novelty search. The differential evolution is a well-known algorithm for global optimization, which is applied to improve the results obtained by the other solvers on the CEC-14 benchmark function suite. Furthermore, functions of different dimensions were taken into consideration, and the influence of the various novelty search parameters was analyzed. The results of experiments show a great potential for using novelty search in global optimization.
@article{fister2019novelty,title={{Novelty Search for Global Optimization}},author={Fister, Iztok and Iglesias, Andres and Galvez, Akemi and Del Ser, Javier and Osaba, Eneko and Fister Jr., Iztok and Perc, Matjaz and Slavinec, Mitja},journal={Applied Mathematics and Computation},volume={347},pages={865--881},year={2019},doi={10.1016/j.amc.2018.11.052},}
Swarm and Evolutionary Computation
jMetalPy: A Python Framework for Multi-Objective Optimization with Metaheuristics
Antonio Benitez-Hidalgo, Antonio J Nebro, Jose Garcia-Nieto, Izaskun Oregi, and Javier Del Ser
@article{benitez2019jmetalpy,title={{jMetalPy: A Python Framework for Multi-Objective Optimization with Metaheuristics}},author={Benitez-Hidalgo, Antonio and Nebro, Antonio J and Garcia-Nieto, Jose and Oregi, Izaskun and Del Ser, Javier},journal={Swarm and Evolutionary Computation},volume={51},number={100598},pages={100598},year={2019},doi={10.1016/j.swevo.2019.100598},}
Applied Soft Computing
Bio-Inspired Optimization for the Molecular Docking Problem: State of the Art, Recent Results, and Perspectives
Maria Jesus Garcia-Godoy, Esteban Lopez-Camacho, Jose Garcia-Nieto, Javier Del Ser, Antonio J. Nebro, and Jose F. Aldana-Montes
Molecular docking is a Bioinformatics method based on predicting the position and orientation of a small molecule or ligand when it is bound to a target macromolecule. This method can be modeled as an optimization problem where one or more objectives can be defined, typically around an energy scoring function. This paper reviews developments in the field of single- and multi-objective meta-heuristics for efficiently addressing molecular docking optimization problems. We comprehensively analyze both problem formulations and applied techniques from Evolutionary Computation and Swarm Intelligence, jointly referred to as Bio-inspired Optimization. Our prospective analysis is supported by an experimental study dealing with a molecular docking problem driven by three conflicting objectives, which is tackled by using different multi-objective heuristics. We conclude that genetic algorithms are the most widely used techniques by far, with a noted increasing prevalence of particle swarm optimization in the last years, being these last techniques particularly adequate when dealing with multi-objective formulations of molecular docking problems. We end this experimental survey by outlining future research paths that should be under target in this vibrant area.
@article{garciagodoy2019bioinspired,title={{Bio-Inspired Optimization for the Molecular Docking Problem: State of the Art, Recent Results, and Perspectives}},author={Garcia-Godoy, Maria Jesus and Lopez-Camacho, Esteban and Garcia-Nieto, Jose and Del Ser, Javier and Nebro, Antonio J. and Aldana-Montes, Jose F.},journal={Applied Soft Computing},volume={79},pages={30--45},publisher={Elsevier},year={2019},doi={10.1016/j.asoc.2019.03.044},}
Swarm and Evolutionary Computation
Foreword: New Theoretical Insights and Practical Applications of Bio-Inspired Computation Approaches
@article{delser2020foreword,title={{Foreword: New Theoretical Insights and Practical Applications of Bio-Inspired Computation Approaches}},author={Del Ser, Javier and Geem, Zong Woo and Yang, Xin-She},journal={Swarm and Evolutionary Computation},volume={45},pages={68--69},year={2019},doi={10.1016/j.swevo.2018.12.008},}
Soft Computing
Optimal Design of Microgrid’s Network Topology and Location of the Distributed Renewable Energy Resources Using the Harmony Search Algorithm
Carlos Camacho-Gomez, S. Jimenez-Fernandez, R. Mallol-Poyato, Javier Del Ser, and S. Salcedo-Sanz
@article{camachogomez2019optimal,title={{Optimal Design of Microgrid’s Network Topology and Location of the Distributed Renewable Energy Resources Using the Harmony Search Algorithm}},author={Camacho-Gomez, Carlos and Jimenez-Fernandez, S. and Mallol-Poyato, R. and Del Ser, Javier and Salcedo-Sanz, S.},journal={Soft Computing},volume={23},number={15},pages={6495--6510},year={2019},doi={10.1007/s00500-018-3300-0},}
Sustainability
Optimal Microgrid Topology Design and Siting of Distributed Generation Sources Using a Multi-Objective Substrate Layer Coral Reefs Optimization Algorithm
Silvia Jimenez-Fernandez, Carlos Camacho-Gomez, Ricardo Mallol-Poyato, Juan Carlos Fernandez, Javier Del Ser, Antonio Portilla-Figueras, and 1 more author
In this work, a problem of optimal placement of renewable generation and topology design for a Microgrid (MG) is tackled. The problem consists of determining the MG nodes where renewable energy generators must be optimally located and also the optimization of the MG topology design, i.e., deciding which nodes should be connected and deciding the lines’ optimal cross-sectional areas (CSA). For this purpose, a multi-objective optimization with two conflicting objectives has been used, utilizing the cost of the lines, C, higher as the lines’ CSA increases, and the MG energy losses, E, lower as the lines’ CSA increases. To characterize generators and loads connected to the nodes, on-site monitored annual energy generation and consumption profiles have been considered. Optimization has been carried out by using a novel multi-objective algorithm, the Multi-objective Substrate Layers Coral Reefs Optimization algorithm (Mo-SL-CRO). The performance of the proposed approach has been tested in a realistic simulation of a MG with 12 nodes, considering photovoltaic generators and micro-wind turbines as renewable energy generators, as well as the consumption loads from different commercial and industrial sites. We show that the proposed Mo-SL-CRO is able to solve the problem providing good solutions, better than other well-known multi-objective optimization techniques, such as NSGA-II or multi-objective Harmony Search algorithm.
@article{jimenezfernandez2019optimal,title={{Optimal Microgrid Topology Design and Siting of Distributed Generation Sources Using a Multi-Objective Substrate Layer Coral Reefs Optimization Algorithm}},author={Jimenez-Fernandez, Silvia and Camacho-Gomez, Carlos and Mallol-Poyato, Ricardo and Fernandez, Juan Carlos and Del Ser, Javier and Portilla-Figueras, Antonio and Salcedo-Sanz, Sancho},journal={Sustainability},volume={11},number={1},pages={169},year={2019},doi={10.3390/su11010169},}
Swarm and Evolutionary Computation
Weighted Strategies to Guide a Multi-Objective Evolutionary Algorithm for Multi-UAV Mission Planning
Cristian Ramirez Atencia, Javier Del Ser, and David Camacho
Management and mission planning over a swarm of unmanned aerial vehicle (UAV) remains to date as a challenging research trend in what regards to this particular type of aircrafts. These vehicles are controlled by a number of ground control station (GCS), from which they are commanded to cooperatively perform different tasks in specific geographic areas of interest. Mathematically the problem of coordinating and assigning tasks to a swarm of UAV can be modeled as a constraint satisfaction problem, whose complexity and multiple conflicting criteria has hitherto motivated the adoption of multi-objective solvers such as multi-objective evolutionary algorithm (MOEA). The encoding approach consists of different alleles representing the decision variables, whereas the fitness function checks that all constraints are fulfilled, minimizing the optimization criteria of the problem. In problems of high complexity involving several tasks, UAV and GCS, where the space of search is huge compared to the space of valid solutions, the convergence rate of the algorithm increases significantly. To overcome this issue, this work proposes a weighted random generator for the creation and mutation of new individuals. The main objective of this work is to reduce the convergence rate of the MOEA solver for multi-UAV mission planning using weighted random strategies that focus the search on potentially better regions of the solution space. Extensive experimental results over a diverse range of scenarios evince the benefits of the proposed approach, which notably improves this convergence rate with respect to a naive MOEA approach.
@article{ramirezatencia2019weighted,title={{Weighted Strategies to Guide a Multi-Objective Evolutionary Algorithm for Multi-UAV Mission Planning}},author={Ramirez Atencia, Cristian and Del Ser, Javier and Camacho, David},journal={Swarm and Evolutionary Computation},volume={44},pages={480--495},year={2019},doi={10.1016/j.swevo.2018.06.005},}
International Conference on the Applications of Evolutionary Computation (Part of EvoStar)
Trophallaxis, Low-Power Vision Sensors and Multi-Objective Heuristics for 3D Scene Reconstruction Using Swarm Robotics
María Carrillo, Javier Sánchez-Cubillo, Eneko Osaba, Miren Nekane Bilbao, and Javier Del Ser
In International Conference on the Applications of Evolutionary Computation (Part of EvoStar), 2019
@inproceedings{carrillo2019trophallaxis,title={{Trophallaxis, Low-Power Vision Sensors and Multi-Objective Heuristics for 3D Scene Reconstruction Using Swarm Robotics}},author={Carrillo, María and Sánchez-Cubillo, Javier and Osaba, Eneko and Bilbao, Miren Nekane and Del Ser, Javier},booktitle={International Conference on the Applications of Evolutionary Computation (Part of EvoStar)},series={Lecture Notes in Computer Science},pages={599--615},publisher={Springer},address={Cham},year={2019},doi={10.1007/978-3-030-16692-2_40},}
IEEE International Conference on Intelligent Transportation Systems (ITSC)
Deep Recurrent Neural Networks and Optimization Meta-Heuristics for Green Urban Route Planning with Dynamic Traffic Estimates
Ismael Estalayo, Eneko Osaba, Ibai Laña, and Javier Del Ser
In IEEE International Conference on Intelligent Transportation Systems (ITSC), 2019
Within the current technological landscape sketched out by Intelligent Transport Systems (ITS), traffic flow prediction and route planning are two of the cornerstones on which the scientific community has been focused for years. Applications leveraging advances in these fields range from individual mobility planning to the establishment of optimal delivery routes, with doubtless benefits yielded to an immense strata of society. Intuitively, combining both prediction and route planning in a single, robust system could boost even further their paramount importance within the ITS field. However, most approaches reported so far in literature develop route planning techniques relying on actual traffic data (current or past observations) rather than on future traffic estimations, which could reliably represent the traffic flow status while the route is being performed. Unfortunately, research efforts around the monolithic hybridization of traffic prediction and route planning are still scarce. This manuscript embraces this noted issue as its main motivation by proposing an advanced routing platform endowed with a Long Short-Term Memory (LSTM) model for traffic forecasting purposes. The predictive output of this model serves as the input to a route planner, which constructs optimal green routes minimizing not only the total travel time, but also the CO2emissions of the vehicle. The system has been tested using Open Trip Planner and real data collected over the city of Århus (Denmark), from which three different types of routes have been built and analyzed along a selection of predictive time horizons. The obtained results are promising and underscore the need for considering traffic predictions along the route for an improved usability of current route planning frameworks.
@inproceedings{estalayo2019deep,title={{Deep Recurrent Neural Networks and Optimization Meta-Heuristics for Green Urban Route Planning with Dynamic Traffic Estimates}},author={Estalayo, Ismael and Osaba, Eneko and Laña, Ibai and Del Ser, Javier},booktitle={IEEE International Conference on Intelligent Transportation Systems (ITSC)},year={2019},pages={1336--1342},doi={10.1109/itsc.2019.8916957},}
IEEE Congress on Evolutionary Computation (IEEE CEC)
Return, Diversification and Risk in Cryptocurrency Portfolios Using Deep Recurrent Neural Networks and Multi-Objective Evolutionary Algorithms
Ismael Estalayo, Javier Del Ser, Eneko Osaba, Miren Nekane Bilbao, Khan Muhammad, Akemi Galvez, and 1 more author
In IEEE Congress on Evolutionary Computation (IEEE CEC), 2019
Nowadays the widespread adoption of cryptocurrencies (also referred to as Altcoins) has universalized the access of the society to trading opportunities in alternative markets, thereby laying a rich substrate for the development of new applications and services aimed at easing the management of personal investment portfolios. When selecting how much to invest and in which asset it is often the case that multiple criteria conflict with each other within a single decision making process, which calls for efficient means to optimally balance such contradicting objectives. In this paper we report initial findings around the combination of Deep Learning (DL) models and Multi-Objective Evolutionary Algorithms (MOEAs) for allocating cryptocurrency portfolios. Technical rationale and details are given on the design of a stacked DL recurrent neural network, and how its predictive power can be exploited for yielding accurate ex ante estimates of the return and risk of the portfolio. These two objectives are complemented by a measure of the diversity of the investment. Results are presented and discussed with real cryptocurrency data, showcasing the potential of our technical approach to produce near-optimal portfolios by balancing the aforementioned objectives. Our study stimulates further research towards incorporating other factors in the design of predictive portfolios, such as the confidence of the DL model output.
@inproceedings{estalayo2019return,title={{Return, Diversification and Risk in Cryptocurrency Portfolios Using Deep Recurrent Neural Networks and Multi-Objective Evolutionary Algorithms}},author={Estalayo, Ismael and Del Ser, Javier and Osaba, Eneko and Bilbao, Miren Nekane and Muhammad, Khan and Galvez, Akemi and Iglesias, Andres},booktitle={IEEE Congress on Evolutionary Computation (IEEE CEC)},year={2019},pages={755--761},doi={10.1109/cec.2019.8790121},}
2019 IEEE Congress on Evolutionary Computation (CEC)
Cooperative Game Concepts in Solving Global Optimization
Iztok Fister, Andres Iglesias, Akemi Galvez, Javier Del Ser, Eneko Osaba, and Iztok Fister
In 2019 IEEE Congress on Evolutionary Computation (CEC), 2019
Nowadays, cooperative game theory has been applied to many domains of human activities. In this study, the cooperative game concept needed for calculating Shapley value is used in solving global optimization. Precisely, the marginal contribution that an agent carries by joining a coalition is calculated as an increase in population diversity of coalition. This concept is incorporated into differential evolution and its self-adaptive variants jDE in order to show that distributing the monolithic population of solutions into more coalitions and their parallel evolution can improve the results of the original algorithms.
@inproceedings{fister2019cooperative,title={{Cooperative Game Concepts in Solving Global Optimization}},author={Fister, Iztok and Iglesias, Andres and Galvez, Akemi and Del Ser, Javier and Osaba, Eneko and Fister, Iztok},booktitle={2019 IEEE Congress on Evolutionary Computation (CEC)},year={2019},pages={1525--1532},doi={10.1109/cec.2019.8789970},}
Genetic and Evolutionary Computation Conference Companion (GECCO)
Discovering Dependencies Among Mined Association Rules with Population-Based Metaheuristics
Iztok Fister Jr., Akemi Galvez, Eneko Osaba, Javier Del Ser, Andres Iglesias, and Iztok Fister
In Genetic and Evolutionary Computation Conference Companion (GECCO), 2019
Stochastic population-based nature-inspired metaheuristics have been proven as a robust tool for mining association rules. These algorithms are very scalable, as well as very fast compared with some deterministic ones that search for solutions exhaustively. Typically, algorithms for association rule mining identify a lot of rules depending, on the transaction database and number of attributes. Therefore, evaluating these rules is very complex. On the other hand, establishing the relationships between discovered association rules can be considered as a very hard problem that cannot easily be solved manually. In this paper, we propose a new algorithm based on stochastic population-based nature-inspired metaheuristics for discovering dependencies among association rules.
@inproceedings{fister2019discovering,title={{Discovering Dependencies Among Mined Association Rules with Population-Based Metaheuristics}},author={Fister Jr., Iztok and Galvez, Akemi and Osaba, Eneko and Del Ser, Javier and Iglesias, Andres and Fister, Iztok},booktitle={Genetic and Evolutionary Computation Conference Companion (GECCO)},year={2019},pages={1668--1674},doi={10.1145/3319619.3326833},}
International Conference on Computational Science
Bat Algorithm for Kernel Computation in Fractal Image Reconstruction
Akemi Gálvez, Eneko Osaba, Javier Del Ser, and Andrés Iglesias
In International Conference on Computational Science, 2019
@inproceedings{galvez2019bat,title={{Bat Algorithm for Kernel Computation in Fractal Image Reconstruction}},author={Gálvez, Akemi and Osaba, Eneko and Del Ser, Javier and Iglesias, Andrés},booktitle={International Conference on Computational Science},series={Lecture Notes in Computer Science},year={2019},pages={381--394},doi={10.1007/978-3-030-22744-9_30},}
Genetic and Evolutionary Computation Conference Companion (GECCO)
Computing Rational Border Curves of Melanoma and Other Skin Lesions from Medical Images with Bat Algorithm
Akemi Galvez, Iztok Fister Jr., Eneko Osaba, Iztok Fister, Javier Del Ser, and Andres Iglesias
In Genetic and Evolutionary Computation Conference Companion (GECCO), 2019
Border detection of melanoma and other skin lesions from images is an important step in the medical image processing pipeline. Although this task is typically carried out manually by the dermatologists, some recent papers have applied evolutionary computation techniques to automate this process. However, these works are only focused on the polynomial case, ignoring the more powerful (but also more difficult) case of rational curves. In this paper, we address this problem with rational Bézier curves by applying the bat algorithm, a popular bio-inspired swarm intelligence technique for optimization. Experimental results on two examples of medical images of melanomas show that this method is promising, as it outperforms the polynomial approach and can be applied to medical images without further pre/post-processing.
@inproceedings{galvez2019computing,title={{Computing Rational Border Curves of Melanoma and Other Skin Lesions from Medical Images with Bat Algorithm}},author={Galvez, Akemi and Fister Jr., Iztok and Osaba, Eneko and Fister, Iztok and Del Ser, Javier and Iglesias, Andres},booktitle={Genetic and Evolutionary Computation Conference Companion (GECCO)},year={2019},pages={1675--1682},doi={10.1145/3319619.3326873},}
International Conference on Swarm Intelligence (ICSI)
Cuckoo Search Algorithm for Border Reconstruction of Medical Images with Rational Curves
Akemi Galvez, Iztok Fister, Iztok Fister Jr., Eneko Osaba, Javier Del Ser, and Andres Iglesias
In International Conference on Swarm Intelligence (ICSI), 2019
@inproceedings{galvez2019cuckoo,title={{Cuckoo Search Algorithm for Border Reconstruction of Medical Images with Rational Curves}},author={Galvez, Akemi and Fister, Iztok and Fister Jr., Iztok and Osaba, Eneko and Del Ser, Javier and Iglesias, Andres},booktitle={International Conference on Swarm Intelligence (ICSI)},series={Lecture Notes in Computer Science},year={2019},pages={320--330},doi={10.1007/978-3-030-26369-0_30},}
IEEE Congress on Evolutionary Computation (IEEE CEC)
Hybrid Modified Firefly Algorithm for Border Detection of Skin Lesions in Medical Imaging
Akemi Galvez, Iztok Fister, Eneko Osaba, Iztok Fister Jr., Javier Del Ser, and Andres Iglesias
In IEEE Congress on Evolutionary Computation (IEEE CEC), 2019
Computerized analysis of skin lesions is an important issue in information retrieval for medical imaging, as it helps human specialists to improve their decision-making for prompt and accurate diagnosis of melanoma and other skin diseases. A relevant task in this regard is border detection, which gives valuable information about some clinical features of skin lesions. This task is typically carried out manually by the dermatologists, leading to errors inherent to subjective diagnosis. In this paper, we address this problem by applying a modification of a powerful evolutionary computation method, the firefly algorithm. The modified algorithm is hybridized with a local search procedure for better performance. Experimental results on a benchmark of medical images of skin lesions show that this method outperforms classical mathematical methods for the instances in the benchmark and is very competitive and often superior to state-of-the-art techniques in the field in terms of numerical accuracy. We conclude that the approach is very promising and can be useful in real-world medical applications where speed is not a critical factor.
@inproceedings{galvez2019hybrid,title={{Hybrid Modified Firefly Algorithm for Border Detection of Skin Lesions in Medical Imaging}},author={Galvez, Akemi and Fister, Iztok and Osaba, Eneko and Fister Jr., Iztok and Del Ser, Javier and Iglesias, Andres},booktitle={IEEE Congress on Evolutionary Computation (IEEE CEC)},year={2019},pages={111--118},doi={10.1109/cec.2019.8789954},}
Genetic and Evolutionary Computation Conference Companion (GECCO)
Hybridizing Differential Evolution and Novelty Search for Multimodal Optimization Problems
Aritz D. Martinez, Eneko Osaba, Izaskun Oregi, Iztok Fister, Iztok Fister, and Javier Del Ser
In Genetic and Evolutionary Computation Conference Companion (GECCO), 2019
Multimodal optimization has shown to be a complex paradigm underneath real-world problems arising in many practical applications, with particular prevalence in physics-related domains. Among them, a plethora of cases within the computational design of aerospace structures can be modeled as a multimodal optimization problem, such as aerodynamic optimization or airfoils and wings. This work aims at presenting a new research direction towards efficiently tackling this kind of optimization problems, which pursues the discovery of the multiple (at least locally optimal) solutions of a given optimization problem. Specifically, we propose to exploit the concept behind the so-called Novelty Search mechanism and embed it into the self-adaptive Differential Evolution algorithm so as to gain an increased level of controlled diversity during the search process. We assess the performance of the proposed solver over the well-known CEC’2013 suite of multimodal test functions. The obtained outcomes of the designed experimentation supports our claim that Novelty Search is a promising approach for heuristically addressed multimodal problems.
@inproceedings{martinez2019hybridizing,title={{Hybridizing Differential Evolution and Novelty Search for Multimodal Optimization Problems}},author={Martinez, Aritz D. and Osaba, Eneko and Oregi, Izaskun and Fister, Iztok and Fister, Iztok and Del Ser, Javier},booktitle={Genetic and Evolutionary Computation Conference Companion (GECCO)},year={2019},pages={1980--1989},doi={10.1145/3319619.3326799},}
Genetic and Evolutionary Computation Conference Companion (GECCO)
Nature-Inspired Metaheuristics for Optimizing Information Dissemination in Vehicular Networks
Antonio D. Masegosa, Eneko Osaba, Juan S. Angarita-Zapata, Ibai Laña, and Javier Del Ser
In Genetic and Evolutionary Computation Conference Companion (GECCO), 2019
Connected vehicles are revolutionizing the way in which transport and mobility are conceived. The main technology behind is the so-called Vehicular Ad-Hoc Networks (VANETs), which are communication networks that connect vehicles and facilitate various services. Usually these services require a centralized architecture where the main server collects and disseminates information from/to vehicles. In this paper, we focus on improving the downlink information dissemination in VANETs with this centralized architecture. With this aim, we model the problem as a Vertex Covering optimization problem and we propose four new nature-inspired methods to solve it: Bat Algorithm (BA), Firefly Algorithm (FA), Particle Swarm Optimization (PSO), and Cuckoo Search (CS). The new methods are tested over data from a real scenario. Results show that these metaheuristics, especially BA, FA and PSO, can be considered as powerful solvers for this optimization problem.
@inproceedings{masegosa2019nature,title={{Nature-Inspired Metaheuristics for Optimizing Information Dissemination in Vehicular Networks}},author={Masegosa, Antonio D. and Osaba, Eneko and Angarita-Zapata, Juan S. and Laña, Ibai and Del Ser, Javier},booktitle={Genetic and Evolutionary Computation Conference Companion (GECCO)},year={2019},pages={1312--1320},doi={10.1145/3319619.3326847},}
Genetic and Evolutionary Computation Conference Companion (GECCO)
Combining Bio-Inspired Meta-Heuristics and Novelty Search for Community Detection over Evolving Graph Streams
Eneko Osaba, Javier Del Ser, Angel Panizo, David Camacho, Akemi Galvez, and Andres Iglesias
In Genetic and Evolutionary Computation Conference Companion (GECCO), 2019
Finding communities of interrelated nodes is a learning task that often holds in problems that can be modeled as a graph. In any case, detecting an optimal partition in a graph is highly time-consuming and complex. For this reason, the implementation of search-based metaheuristics arises as an alternative for addressing these problems. This manuscript focuses on optimally partitioning dynamic network instances, in which the connections between vertices change dynamically along time. Specifically, the application of Novelty Search mechanism for solving the problem of finding communities in dynamic networks is studied in this paper. For this goal, this procedure has been embedded in the search process undertaken by three different bio-inspired meta-heuristic schemes: Bat Algorithm, Firefly Algorithm and Particle Swarm Optimization. All these methods have been properly adapted for dealing with this discrete and dynamic problem, using a reformulated expression of the modularity coefficient as its fitness function. A thorough experimentation has been conducted using a benchmark composed by 12 synthetically created instances, with the main objective of analyzing the performance of the proposed Novelty Search mechanism when facing this problem. In light of the outperforming behavior of our approach and its relevance dictated by two different statistical tests, we conclude that Novelty Search is a promising procedure for finding communities in evolving graph data.
@inproceedings{osaba2019combining,title={{Combining Bio-Inspired Meta-Heuristics and Novelty Search for Community Detection over Evolving Graph Streams}},author={Osaba, Eneko and Del Ser, Javier and Panizo, Angel and Camacho, David and Galvez, Akemi and Iglesias, Andres},booktitle={Genetic and Evolutionary Computation Conference Companion (GECCO)},year={2019},pages={1329--1335},doi={10.1145/3319619.3326831},}
International Conference on Computational Science
Dynamic Partitioning of Evolving Graph Streams Using Nature-Inspired Heuristics
Eneko Osaba, Miren Nekane Bilbao, Andres Iglesias, Javier Del Ser, Akemi Galvez, Iztok Fister Jr., and 1 more author
In International Conference on Computational Science, 2019
@inproceedings{osaba2019dynamic,title={{Dynamic Partitioning of Evolving Graph Streams Using Nature-Inspired Heuristics}},author={Osaba, Eneko and Bilbao, Miren Nekane and Iglesias, Andres and Del Ser, Javier and Galvez, Akemi and Fister Jr., Iztok and Fister, Iztok},booktitle={International Conference on Computational Science},series={Lecture Notes in Computer Science},year={2019},pages={367--380},doi={10.1007/978-3-030-22744-9_29},}
IntechOpen
Swarm Intelligence – New Perspectives and Applications
@book{delser2019swarm,title={{Swarm Intelligence – New Perspectives and Applications}},editor={Del Ser, Javier and Villar-Rodriguez, Esther and Osaba, Eneko},publisher={IntechOpen},year={2019},}
2018
Applied Soft Computing
A Discrete Water Cycle Algorithm for Solving the Symmetric and Asymmetric Traveling Salesman Problem
Eneko Osaba, Javier Del Ser, Ali Sadollah, Miren Nekane Bilbao, and David Camacho
The water cycle algorithm (WCA) is a nature-inspired meta-heuristic recently contributed to the community in 2012, which finds its motivation in the natural surface runoff phase in water cycle process and on how streams and rivers flow into the sea. This method has been so far successfully applied to many engineering applications, spread over a wide variety of application fields. In this paper an enhanced discrete version of the WCA (coined as DWCA) is proposed for solving the Symmetric and Asymmetric Traveling Salesman Problem. Aimed at proving that the developed approach is a promising approximation method for solving this family of optimization problems, the designed solver has been tested over 33 problem datasets, comparing the obtained outcomes with the ones got by six different algorithmic counterparts from the related literature: genetic algorithm, island-based genetic algorithm, evolutionary simulated annealing, bat algorithm, firefly algorithm and imperialist competitive algorithm. Furthermore, the statistical significance of the performance gaps found in this benchmark is validated based on the results from non-parametric tests, not only in terms of optimality but also in regards to convergence speed. We conclude that the proposed DWCA approach outperforms – with statistical significance – any other optimization technique in the benchmark in terms of both computation metrics.
@article{osaba2018discrete,title={{A Discrete Water Cycle Algorithm for Solving the Symmetric and Asymmetric Traveling Salesman Problem}},author={Osaba, Eneko and Del Ser, Javier and Sadollah, Ali and Bilbao, Miren Nekane and Camacho, David},journal={Applied Soft Computing},volume={71},pages={277--290},year={2018},doi={10.1016/j.asoc.2018.06.047},}
International Conference on Parallel Problem Solving from Nature (PPSN)
Extending the Speed-Constrained Multi-Objective PSO (SMPSO) with Reference Point Based Preference Articulation
Antonio J. Nebro, Juan J. Durillo, José García-Nieto, Cristóbal Barba-González, Javier Del Ser, Carlos A. Coello Coello, and 2 more authors
In International Conference on Parallel Problem Solving from Nature (PPSN), 2018
@inproceedings{nebro2018extending,title={{Extending the Speed-Constrained Multi-Objective PSO (SMPSO) with Reference Point Based Preference Articulation}},author={Nebro, Antonio J. and Durillo, Juan J. and García-Nieto, José and Barba-González, Cristóbal and Del Ser, Javier and Coello Coello, Carlos A. and Benítez-Hidalgo, Antonio and Aldana-Montes, José F.},booktitle={International Conference on Parallel Problem Solving from Nature (PPSN)},series={Lecture Notes in Computer Science},pages={298--310},year={2018},doi={10.1007/978-3-319-99253-2_24},}
Neurocomputing
Cost-Efficient Deployment of Multi-Hop Wireless Networks over Disaster Areas Using Multi-Objective Meta-Heuristics
Miren Nekane Bilbao, Javier Del Ser, Cristina Perfecto, Sancho Salcedo-Sanz, and Jose A. Portilla-Figueras
@article{bilbao2018costefficient,title={{Cost-Efficient Deployment of Multi-Hop Wireless Networks over Disaster Areas Using Multi-Objective Meta-Heuristics}},author={Bilbao, Miren Nekane and Del Ser, Javier and Perfecto, Cristina and Salcedo-Sanz, Sancho and Portilla-Figueras, Jose A.},journal={Neurocomputing},volume={271},pages={18--27},year={2018},doi={10.1016/j.neucom.2016.11.097},}
International Conference on Practical Applications of Agents and Multi-Agent Systems
Using Novelty Search in Differential Evolution
Iztok Fister, Andres Iglesias, Akemi Galvez, Javier Del Ser, Eneko Osaba, and Iztok Fister Jr.
In International Conference on Practical Applications of Agents and Multi-Agent Systems, 2018
@inproceedings{fister2019adaptive,title={{Using Novelty Search in Differential Evolution}},author={Fister, Iztok and Iglesias, Andres and Galvez, Akemi and Del Ser, Javier and Osaba, Eneko and Fister Jr., Iztok},booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems},series={Communications in Computer and Information Science},year={2018},pages={534--542},doi={10.1007/978-3-319-94779-2_46},}
Expert Systems
A Heuristic Approach to the Multicriteria Design of IaaS Cloud Infrastructures for Big Data Applications
Maria Arostegi, Ana Torre-Bastida, Miren Nekane Bilbao, and Javier Del Ser
The rapid growth of new computing paradigms such as Cloud Computing and Big Data has unleashed great opportunities for companies to shift their business model towards a fully digital strategy. A major obstacle in this matter is the requirement of highly specialized ICT infrastructures that are expensive and difficult to manage. It is at this point that the IaaS (infrastructure as a service) model offers an efficient and cost‐affordable solution to supply companies with their required computing resources. In the Big Data context, it is often a hard task to design an optimal IaaS solution that meets user requirements. In this context, we propose a methodology to optimize the definition of IaaS cloud models for hosting Big Data platforms, following a threefold criterion: cost, reliability, and computing capacity. Specifically, the proposed methodology hinges on evolutionary heuristics in order to find IaaS configurations in the cloud that optimally balance such objectives. We also define measures to quantify the aforementioned metrics over a Big Data platform hosted within an IaaS cloud model. The proposed method is validated by using real information from three IaaS providers and three Big Data platforms. The obtained results provide an insightful input for system managers when initially designing cloud infrastructures for Big Data applications.
@article{arostegi2018heuristic,title={{A Heuristic Approach to the Multicriteria Design of IaaS Cloud Infrastructures for Big Data Applications}},author={Arostegi, Maria and Torre-Bastida, Ana and Bilbao, Miren Nekane and Del Ser, Javier},journal={Expert Systems},volume={35},number={5},pages={e12259},year={2018},doi={10.1111/exsy.12259},}
Future Generation Computer Systems
Let Nature Decide Its Nature: On the Design of Collaborative Hyperheuristics for Decentralized Ephemeral Environments
Aritz Martinez, Eneko Osaba, Miren Nekane Bilbao, and Javier Del Ser
The research community has traditionally aimed at the derivation and development of metaheuristic solvers, suited to deal with problems of very diverse characteristics. Unfortunately, it is often the case that new metaheuristic techniques are presented and assessed in a reduced set of cases, mostly due to the lack of computational resources to undertake extensive performance studies over a sufficiently diverse set of optimization benchmarks. This manuscript explores how ephemeral environments could be exploited to efficiently construct metaheuristic algorithms by virtue of a collaborative, distributed nature-inspired hyperheuristic framework specifically designed to be deployed over unreliable, uncoordinated computation nodes. To this end, the designed framework defines two types of nodes (trackers and peers, similarly to peer-to-peer networks), both reacting resiliently to unexpected disconnections of nodes disregarding their type. Peer nodes exchange their populations (i.e. constructed algorithms) asynchronously, so that local optima are avoided at every peer thanks to the contribution by other nodes. Furthermore, the overall platform is fully scalable, allowing its users to implement and share newly derived operators and fitness functions so as to enrich the diversity and universality of the heuristic algorithms found by the framework. Results obtained from in-lab experiments with a reduced number of nodes are discussed to shed light on the evolution of the best solution of the framework with the number of connected peers and the tolerance of the network to node disconnections.
@article{martinez2018let,title={{Let Nature Decide Its Nature: On the Design of Collaborative Hyperheuristics for Decentralized Ephemeral Environments}},author={Martinez, Aritz and Osaba, Eneko and Bilbao, Miren Nekane and Del Ser, Javier},journal={Future Generation Computer Systems},volume={88},pages={792--805},year={2018},doi={10.1016/j.future.2018.06.014},}
8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA)
A Bio-Inspired Approach for Collaborative Exploration with Mobile Battery Recharging in Swarm Robotics
Maria Carrillo, Ian Gallardo, Javier Del Ser, Eneko Osaba, Javier Sanchez Cubillo, Miren Nekane Bilbao, and 2 more authors
In 8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA), 2018
@inproceedings{carrillo2018bioinspired,title={{A Bio-Inspired Approach for Collaborative Exploration with Mobile Battery Recharging in Swarm Robotics}},author={Carrillo, Maria and Gallardo, Ian and Del Ser, Javier and Osaba, Eneko and Sanchez Cubillo, Javier and Bilbao, Miren Nekane and Galvez, Akemi and Iglesias, Andres},booktitle={8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA)},series={Lecture Notes in Computer Science},year={2018},pages={75--87},doi={10.1007/978-3-319-91641-5_7},}
International Conference on Intelligent Data Engineering and Automated Learning
Differential Evolution for Association Rule Mining Using Categorical and Numerical Attributes
Iztok Fister Jr., Andres Iglesias, Akemi Galvez, Javier Del Ser, Eneko Osaba, and Iztok Fister
In International Conference on Intelligent Data Engineering and Automated Learning, 2018
@inproceedings{fister2018differential,title={{Differential Evolution for Association Rule Mining Using Categorical and Numerical Attributes}},author={Fister Jr., Iztok and Iglesias, Andres and Galvez, Akemi and Del Ser, Javier and Osaba, Eneko and Fister, Iztok},booktitle={International Conference on Intelligent Data Engineering and Automated Learning},series={Lecture Notes in Computer Science},pages={79--88},year={2018},doi={10.1007/978-3-030-03493-1_9},}
International Symposium on Intelligent and Distributed Computing
Automatic Fitting of Feature Points for Border Detection of Skin Lesions in Medical Images with Bat Algorithm
Akemi Galvez, Iztok Fister, Iztok Fister Jr., Eneko Osaba, Javier Del Ser, and Andres Iglesias
In International Symposium on Intelligent and Distributed Computing, 2018
@inproceedings{galvez2018automatic,title={{Automatic Fitting of Feature Points for Border Detection of Skin Lesions in Medical Images with Bat Algorithm}},author={Galvez, Akemi and Fister, Iztok and Fister Jr., Iztok and Osaba, Eneko and Del Ser, Javier and Iglesias, Andres},booktitle={International Symposium on Intelligent and Distributed Computing},series={Studies in Computational Intelligence},pages={357--368},year={2018},doi={10.1007/978-3-319-99626-4_31},}
International Conference on Hybrid Artificial Intelligence Systems
Memetic Modified Cuckoo Search Algorithm with ASSRS for the SSCF Problem in Self-Similar Fractal Image Reconstruction
Akemi Gálvez, Andrés Iglesias, Iztok Fister, Iztok Fister Jr., Eneko Osaba, and Javier Del Ser
In International Conference on Hybrid Artificial Intelligence Systems, 2018
@inproceedings{galvez2018memetic,title={{Memetic Modified Cuckoo Search Algorithm with ASSRS for the SSCF Problem in Self-Similar Fractal Image Reconstruction}},author={Gálvez, Akemi and Iglesias, Andrés and Fister, Iztok and Fister Jr., Iztok and Osaba, Eneko and Del Ser, Javier},booktitle={International Conference on Hybrid Artificial Intelligence Systems},series={Lecture Notes in Computer Science},pages={658--670},year={2018},doi={10.1007/978-3-319-92639-1_55},}
International Symposium on Intelligent and Distributed Computing
Multi-Objective Metaheuristics for a Flexible Ligand-Macromolecule Docking Problem in Computational Biology
Esteban López Camacho, María Jesús García-Godoy, Javier Del Ser, Antonio J. Nebro, and José F. Aldana-Montes
In International Symposium on Intelligent and Distributed Computing, 2018
@inproceedings{lopezcamacho2018multiobjective,title={{Multi-Objective Metaheuristics for a Flexible Ligand-Macromolecule Docking Problem in Computational Biology}},author={López Camacho, Esteban and García-Godoy, María Jesús and Del Ser, Javier and Nebro, Antonio J. and Aldana-Montes, José F.},booktitle={International Symposium on Intelligent and Distributed Computing},series={Studies in Computational Intelligence},pages={369--379},year={2018},doi={10.1007/978-3-319-99626-4_32},}
International Conference on Intelligent Data Engineering and Automated Learning
Community Detection in Weighted Directed Networks Using Nature-Inspired Heuristics
Eneko Osaba, Javier Del Ser, David Camacho, Akemi Galvez, Andres Iglesias, Iztok Fister Jr., and 1 more author
In International Conference on Intelligent Data Engineering and Automated Learning, 2018
@inproceedings{osaba2018community,title={{Community Detection in Weighted Directed Networks Using Nature-Inspired Heuristics}},author={Osaba, Eneko and Del Ser, Javier and Camacho, David and Galvez, Akemi and Iglesias, Andres and Fister Jr., Iztok and Fister, Iztok},booktitle={International Conference on Intelligent Data Engineering and Automated Learning},series={Lecture Notes in Computer Science},pages={325--335},year={2018},doi={10.1007/978-3-030-03496-2_36},}
8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA)
Multi-Objective Design of Time-Constrained Bike Routes Using Bio-Inspired Meta-Heuristics
Eneko Osaba, Javier Del Ser, Miren Nekane Bilbao, Pedro Lopez-Garcia, and Antonio J. Nebro
In 8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA), 2018
@inproceedings{osaba2018multiobjective,title={{Multi-Objective Design of Time-Constrained Bike Routes Using Bio-Inspired Meta-Heuristics}},author={Osaba, Eneko and Del Ser, Javier and Bilbao, Miren Nekane and Lopez-Garcia, Pedro and Nebro, Antonio J.},booktitle={8th International Conference on Bioinspired Optimization Methods and their Applications (BIOMA)},series={Lecture Notes in Computer Science},year={2018},pages={197--210},doi={10.1007/978-3-319-91641-5_17},}
International Symposium on Intelligent and Distributed Computing
Solving the Open-Path Asymmetric Green Traveling Salesman Problem in a Realistic Urban Environment
Eneko Osaba, Javier Del Ser, Andrés Iglesias, Miren Nekane Bilbao, Iztok Fister Jr., Iztok Fister, and 1 more author
In International Symposium on Intelligent and Distributed Computing, 2018
@inproceedings{osaba2018solving,title={{Solving the Open-Path Asymmetric Green Traveling Salesman Problem in a Realistic Urban Environment}},author={Osaba, Eneko and Del Ser, Javier and Iglesias, Andrés and Bilbao, Miren Nekane and Fister Jr., Iztok and Fister, Iztok and Galvez, Akemi},booktitle={International Symposium on Intelligent and Distributed Computing},series={Studies in Computational Intelligence},pages={181--191},year={2018},doi={10.1007/978-3-319-99626-4_16},}
International Conference on Intelligent Data Engineering and Automated Learning
Bat Algorithm Swarm Robotics Approach for Dual Non-Cooperative Search with Self-Centered Mode
Patricia Suárez, Akemi Gálvez, Iztok Fister, Iztok Fister Jr., Eneko Osaba, Javier Del Ser, and 1 more author
In International Conference on Intelligent Data Engineering and Automated Learning, 2018
@inproceedings{suarez2018bat,title={{Bat Algorithm Swarm Robotics Approach for Dual Non-Cooperative Search with Self-Centered Mode}},author={Suárez, Patricia and Gálvez, Akemi and Fister, Iztok and Fister Jr., Iztok and Osaba, Eneko and Del Ser, Javier and Iglesias, Andrés},booktitle={International Conference on Intelligent Data Engineering and Automated Learning},series={Lecture Notes in Computer Science},pages={201--209},year={2018},doi={10.1007/978-3-030-03496-2_23},}
International Conference on Practical Applications of Agents and Multi-Agent Systems
Interplay of Two Bat Algorithm Robotic Swarms in Non-Cooperative Target Point Search
Patricia Suárez, Akemi Gálvez, Iztok Fister, Iztok Fister Jr., Eneko Osaba, Javier Del Ser, and 1 more author
In International Conference on Practical Applications of Agents and Multi-Agent Systems, 2018
@inproceedings{suarez2018interplay,title={{Interplay of Two Bat Algorithm Robotic Swarms in Non-Cooperative Target Point Search}},author={Suárez, Patricia and Gálvez, Akemi and Fister, Iztok and Fister Jr., Iztok and Osaba, Eneko and Del Ser, Javier and Iglesias, Andrés},booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems},series={Communications in Computer and Information Science},pages={543--550},year={2018},doi={10.1007/978-3-319-94779-2_47},}
Nature-Inspired Algorithms and Applied Optimization
On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators
Eneko Osaba, Roberto Carballedo, Xin-She Yang, Iztok Fister, Pedro Lopez Garcia, and Javier Del Ser
In Nature-Inspired Algorithms and Applied Optimization, 2018
@incollection{osaba2018efficiently,title={{On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators}},author={Osaba, Eneko and Carballedo, Roberto and Yang, Xin-She and Fister, Iztok and Lopez Garcia, Pedro and Del Ser, Javier},booktitle={Nature-Inspired Algorithms and Applied Optimization},series={Studies in Computational Intelligence},pages={69--89},publisher={Springer Cham},year={2018},doi={10.1007/978-3-319-67669-2_4},}
IntechOpen
Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization
@book{delser2018nature,title={{Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization}},editor={Del Ser, Javier and Osaba, Eneko},publisher={IntechOpen},year={2018},}
2017
IEEE Congress on Evolutionary Computation (CEC)
A Novel Fireworks Algorithm with Wind Inertia Dynamics and Its Application to Traffic Forecasting
Ibai Laña, Javier Del Ser, and Manuel Velez
In IEEE Congress on Evolutionary Computation (CEC), 2017
Fireworks Algorithm (FWA) is a recently contributed heuristic optimization method that has shown a promising performance in applications stemming from different domains. Improvements to the original algorithm have been designed and tested in the related literature. Nonetheless, in most of such previous works FWA has been tested with standard test functions, hence its performance when applied to real application cases has been scarcely assessed. In this manuscript a mechanism for accelerating the convergence of this meta-heuristic is proposed based on observed wind inertia dynamics (WID) among fireworks in practice. The resulting enhanced algorithm will be described algorithmically and evaluated in terms of convergence speed by means of test functions. As an additional novel contribution of this work FWA and FWA-WID are used in a practical application where such heuristics are used as wrappers for optimizing the parameters of a road traffic short-term predictive model. The exhaustive performance analysis of the FWA and FWA-ID in this practical setup has revealed that the relatively high computational complexity of this solver with respect to other heuristics makes it critical to speed up their convergence (specially in cases with a costly fitness evaluation as the one tackled in this work), observation that buttresses the utility of the proposed modifications to the naive FWA solver.
@inproceedings{lana2017novel,title={{A Novel Fireworks Algorithm with Wind Inertia Dynamics and Its Application to Traffic Forecasting}},author={Laña, Ibai and Del Ser, Javier and Velez, Manuel},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2017},pages={706--713},doi={10.1109/cec.2017.7969379},}
Applied Soft Computing
Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems
Andoni Elola, Javier Del Ser, Miren Nekane Bilbao, Cristina Perfecto, Enrique Alexandre, and Sancho Salcedo-Sanz
@article{elola2017hybridizing,title={{Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems}},author={Elola, Andoni and Del Ser, Javier and Bilbao, Miren Nekane and Perfecto, Cristina and Alexandre, Enrique and Salcedo-Sanz, Sancho},journal={Applied Soft Computing},volume={52},pages={760--770},year={2017},doi={10.1016/j.asoc.2016.09.049},}
Applied Soft Computing
Comparative Study of Pheromone Control Heuristics in ACO Algorithms for Solving RCPSP Problems
Antonio Gonzalez-Pardo, Javier Del Ser, and David Camacho
@article{gonzalezpardo2017comparative,title={{Comparative Study of Pheromone Control Heuristics in ACO Algorithms for Solving RCPSP Problems}},author={Gonzalez-Pardo, Antonio and Del Ser, Javier and Camacho, David},journal={Applied Soft Computing},volume={60},pages={241--255},year={2017},doi={10.1016/j.asoc.2017.06.042},}
International Journal of Bioinspired Computation
Solving Strategy Board Games Using a CSP-Based ACO Approach
Antonio Gonzalez-Pardo, Javier Del Ser, and David Camacho
International Journal of Bioinspired Computation, 2017
In the last years, there have been a huge increase in the number of research contributions that use games and video-games as an application domain for testing different artificial intelligence algorithms. Some of these problems can be represented as a constraint satisfaction problem (CSP), and heuristics algorithms (such as ant colony optimisation) can be used due to the complexity of the modelled problems. This paper presents a comparative study of the performance of a novel ACO model for CSP-based board games. In this work, two different oblivion rate meta-heuristics for controlling the number of pheromones created in the model have been created. Experimental results reveal that both meta-heuristics reduce considerably the number of pheromones produced in the system without affecting the quality of the solutions in terms of average optimality.
@article{gonzalezpardo2017solving,title={{Solving Strategy Board Games Using a CSP-Based ACO Approach}},author={Gonzalez-Pardo, Antonio and Del Ser, Javier and Camacho, David},journal={International Journal of Bioinspired Computation},volume={10},number={2},pages={136--144},year={2017},doi={10.1504/ijbic.2017.10004320},}
Sensors
Underwater Robot Task Planning Using Multi-Objective Meta-Heuristics
Itziar Landa-Torres, Diana Manjarres, Sonia Bilbao, and Javier Del Ser
Robotics deployed in the underwater medium are subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this context the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by devising three heuristic solvers aimed at efficiently scheduling tasks in robotic swarms, which collaborate together to accomplish a mission, and by presenting experimental results obtained over realistic scenarios in the underwater environment. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks and the relative execution order of such tasks within the schedule of certain robots. The obtained results reveal interesting differences in terms of Pareto optimality and spread between the algorithms considered in the benchmark, which are insightful for the selection of a proper task scheduler in real underwater campaigns.
@article{landatorres2017underwater,title={{Underwater Robot Task Planning Using Multi-Objective Meta-Heuristics}},author={Landa-Torres, Itziar and Manjarres, Diana and Bilbao, Sonia and Del Ser, Javier},journal={Sensors},volume={17},number={4},pages={762},year={2017},doi={10.3390/s17040762},}
Soft Computing
A Simulation-Based Quantitative Analysis on the Topological Heritability of Dandelion-Encoded Meta-Heuristics for Tree Optimization Problems
Cristina Perfecto, Miren Nekane Bilbao, Javier Del Ser, and Armando Ferro
@article{perfecto2017simulation,title={{A Simulation-Based Quantitative Analysis on the Topological Heritability of Dandelion-Encoded Meta-Heuristics for Tree Optimization Problems}},author={Perfecto, Cristina and Bilbao, Miren Nekane and Del Ser, Javier and Ferro, Armando},journal={Soft Computing},volume={21},number={17},pages={4939--4952},year={2017},doi={10.1007/s00500-016-2436-z},}
International Journal of Bioinspired Computation
A Meta-Heuristic Learning Approach for the Non-Intrusive Detection of Impersonation Attacks in Social Networks
Esther Villar-Rodriguez, Javier Del Ser, Sergio Gil-Lopez, Miren Nekane Bilbao, and Sancho Salcedo-Sanz
International Journal of Bioinspired Computation, 2017
Cyber attacks have recently gained momentum in the research community as a sharply concerning phenomenon further ignited by the proliferation of social networks, which unfold a variety of ways for cybercriminals to access compromised information of their users. This paper gravitates on impersonation attacks, whose motivation may go beyond economic interests of the attacker towards getting unauthorised access to information and contacts, as often occurs between teenagers and early users of social platforms. This manuscript proposes a meta-heuristically optimised learning model as the algorithmic core of a non-intrusive detection system that relies exclusively on connection time features to detect evidences of an impersonation attack. The proposed scheme hinges on the K-Means clustering approach applied to a set of time features specially tailored to characterise the usage of users, which are weighted prior to the clustering under detection performance maximisation criteria. The obtained results shed light on the potentiality of the proposed methodology for its practical application to real social networks.
@article{villarrodriguez2017meta,title={{A Meta-Heuristic Learning Approach for the Non-Intrusive Detection of Impersonation Attacks in Social Networks}},author={Villar-Rodriguez, Esther and Del Ser, Javier and Gil-Lopez, Sergio and Bilbao, Miren Nekane and Salcedo-Sanz, Sancho},journal={International Journal of Bioinspired Computation},volume={10},number={2},pages={109--118},year={2017},doi={10.1504/ijbic.2017.085891},}
3rd International Conference on the Harmony Search Algorithm
A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
Adrian Aybar Ruiz, Lucas Cuadra, Javier Del Ser, Jose A. Portilla Figueras, and Sancho Salcedo-Sanz
In 3rd International Conference on the Harmony Search Algorithm, 2017
This paper explores the feasibility of a particular implementation of a Grouping Harmony Search (GHS) algorithm to assign resources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem formulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the assignment to be done. The GHS algorithm aims at minimizing a weighted cost function, which is composed of not only the detailed load factors but also resource utilization ratios (for aggregate capacity, codes, power), and the fraction of users without service. The proposed GHS is based on a particular encoding scheme (suitable for the problem formulation) and tailored Harmony Memory Considering Rate and Pitch Adjusting Rate processes. The experimental work shows that the proposed GHS algorithm exhibits a superior performance than that of the conventional approach, which minimizes only the load factors.
@inproceedings{aybarruiz2017grouping,title={{A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks}},author={Aybar Ruiz, Adrian and Cuadra, Lucas and Del Ser, Javier and Portilla Figueras, Jose A. and Salcedo-Sanz, Sancho},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={190--199},doi={10.1007/978-981-10-3728-3_19},}
3rd International Conference on the Harmony Search Algorithm
Cost-Efficient Selective Network Caching in Large-Area Vehicular Networks Using Multi-Objective Heuristics
Miren Nekane Bilbao, Cristina Perfecto, and Javier Del Ser
In 3rd International Conference on the Harmony Search Algorithm, 2017
In the last decade the interest around network caching techniques has augmented notably for alleviating the ever-growing demand of resources by end users in mobile networks. This gained momentum stems from the fact that even though the overall volume of traffic retrieved from Internet has increased at an exponential pace over the last years, several studies have unveiled that a large fraction of this traffic is usually accessed by multiple end users at nearby locations, i.e. content demands are often local and redundant across terminals close to each other, even in mobility. In this context this manuscript explores the application of multi-objective heuristics to optimally allocate cache profiles over urban scenarios with mobile receivers (e.g. vehicles). To this end we formulate two conflicting objectives: the utility of the cache allocation strategy, which roughly depends on the traffic offloaded from the network and the number of users demanding contents; and its cost, given by an cost per unit of stored data and the rate demanded by the cached profile. Simulations are performed and discussed over a realistic vehicular scenario modeled over the city of Cologne (Germany), from which it is concluded that the proposed heuristic solver excels at finding caching solutions differently balancing the aforementioned objectives.
@inproceedings{bilbao2017costefficient,title={{Cost-Efficient Selective Network Caching in Large-Area Vehicular Networks Using Multi-Objective Heuristics}},author={Bilbao, Miren Nekane and Perfecto, Cristina and Del Ser, Javier},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={168--178},doi={10.1007/978-981-10-3728-3_17},}
3rd International Conference on the Harmony Search Algorithm
An Analysis of Coalition-Competition Pricing Strategies for Multi-Operator Mobile Traffic Offloading Using Bi-Objective Heuristics
Jone Consul, Cristina Perfecto, Miren Nekane Bilbao, and Javier Del Ser
In 3rd International Conference on the Harmony Search Algorithm, 2017
In a competitive market relationships between telecommunications operators serving simultaneously over a certain geographical area are diverse and motivated by very different business strategies and goals. Such relationships ultimately yield distinct pricing portfolios depending on the contractual affiliation of the user being served. Furthermore a key role in the last decade is the concept of tethering (connection sharing) which, when controlled by the operator, may help alleviating the consumption of network resources in densely populated scenarios. In this work we investigate the application of bi-objective heuristics for the design of Pareto-optimal network topologies leading to an optimal Pareto between the revenue of the incumbent operators in the scenario and the quality of service degradation experienced by the end users as a result of tethering. Based on computer simulation this work unveils that such a Pareto-optimal set of topologies is strongly determined by the market relationships between such operators.
@inproceedings{consul2017analysis,title={{An Analysis of Coalition-Competition Pricing Strategies for Multi-Operator Mobile Traffic Offloading Using Bi-Objective Heuristics}},author={Consul, Jone and Perfecto, Cristina and Bilbao, Miren Nekane and Del Ser, Javier},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={157--167},doi={10.1007/978-981-10-3728-3_16},}
IEEE Congress on Evolutionary Computation (CEC)
Nature-Inspired Heuristics for the Multiple-Vehicle Selective Pickup and Delivery Problem Under Maximum Profit and Incentive Fairness Criteria
Javier Del Ser, Ana I. Torre-Bastida, Ibai Laña, Miren Nekane Bilbao, and Cristina Perfecto
In IEEE Congress on Evolutionary Computation (CEC), 2017
This work focuses on wide-scale freight transportation logistics motivated by the sharp increase of on-line shopping stores and the upsurge of Internet as the most frequently utilized selling channel during the last decade. This huge ecosystem of one-click-away catalogs has ultimately unleashed the need for efficient algorithms aimed at properly scheduling the underlying transportation resources in an efficient fashion, especially over the so-called last mile of the distribution chain. In this context the selective pickup and delivery problem focuses on determining the optimal subset of packets that should be picked from its origin city and delivered to their corresponding destination within a given time frame, often driven by the maximization of the total profit of the courier service company. This manuscript tackles a realistic variant of this problem where the transportation fleet is composed by more than one vehicle, which further complicates the selection of packets due to the subsequent need for coordinating the delivery service from the command center. In particular the addressed problem includes a second optimization metric aimed at reflecting a fair share of the net benefit among the company staff based on their driven distance. To efficiently solve this optimization problem, several nature-inspired metaheuristic solvers are analyzed and statistically compared to each other under different parameters of the problem setup. Finally, results obtained over a realistic scenario over the province of Bizkaia (Spain) using emulated data will be explored so as to shed light on the practical applicability of the analyzed heuristics.
@inproceedings{delser2017natureinspired,title={{Nature-Inspired Heuristics for the Multiple-Vehicle Selective Pickup and Delivery Problem Under Maximum Profit and Incentive Fairness Criteria}},author={Del Ser, Javier and Torre-Bastida, Ana I. and Laña, Ibai and Bilbao, Miren Nekane and Perfecto, Cristina},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2017},pages={480--487},doi={10.1109/cec.2017.7969350},}
11th International Symposium on Intelligent Distributed Computing
Wind Power Production Forecasting Using Ant Colony Optimization and Extreme Learning Machines
Maria Carrillo, Javier Del Ser, Miren Nekane Bilbao, Cristina Perfecto, and David Camacho
In 11th International Symposium on Intelligent Distributed Computing, 2017
@inproceedings{delser2017wind,title={{Wind Power Production Forecasting Using Ant Colony Optimization and Extreme Learning Machines}},author={Carrillo, Maria and Del Ser, Javier and Bilbao, Miren Nekane and Perfecto, Cristina and Camacho, David},booktitle={11th International Symposium on Intelligent Distributed Computing},series={Studies in Computational Intelligence},year={2017},pages={175--184},doi={10.1007/978-3-319-66379-1_16},}
3rd International Conference on the Harmony Search Algorithm
Quantitative Analysis and Performance Study of Ant Colony Optimization Models Applied to Multi-Mode Resource Constraint Project Scheduling Problems
Antonio Gonzalez-Pardo, Javier Del Ser, and David Camacho
In 3rd International Conference on the Harmony Search Algorithm, 2017
Constraint Satisfaction Problems (CSP) belongs to this kind of traditional NP-hard problems with a high impact in both, research and industrial domains. However, due to the complexity that CSP problems exhibit, researchers are forced to use heuristic algorithms for solving the problems in a reasonable time. One of the most famous heuristic algorithms is Ant Colony Optimization (ACO) algorithm. The possible utilization of ACO algorithms to solve CSP problems requires the design of a decision graph where the ACO is executed. Nevertheless, the classical approaches build a graph where the nodes represent the variable/value pairs and the edges connect those nodes whose variables are different. In order to solve this problem, a novel ACO model have been recently designed. The goal of this paper is to analyze the performance of this novelty algorithm when solving Multi-Mode Resource-Constraint Satisfaction Problems. Experimental results reveals that the new ACO model provides competitive results whereas the number of pheromones created in the system is drastically reduced.
@inproceedings{gonzalezpardo2017quantitative,title={{Quantitative Analysis and Performance Study of Ant Colony Optimization Models Applied to Multi-Mode Resource Constraint Project Scheduling Problems}},author={Gonzalez-Pardo, Antonio and Del Ser, Javier and Camacho, David},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={145--154},doi={10.1007/978-981-10-3728-3_15},}
3rd International Conference on the Harmony Search Algorithm
Joint Feature Selection and Parameter Tuning for Short-Term Traffic Flow Forecasting Based on Heuristically Optimized Multi-Layer Neural Networks
Ibai Laña, Javier Del Ser, Manuel Velez, and Izaskun Oregi
In 3rd International Conference on the Harmony Search Algorithm, 2017
Short-term traffic flow forecasting is a vibrant research topic that has been growing in interest since the late 70’s. In the last decade this vibrant field has shifted its focus towards machine learning methods. These techniques often require fine-grained parameter tuning to obtain satisfactory performance scores, a process that usually relies on manual trial-and-error adjustment. This paper explores the use of Harmony Search optimization for tuning the parameters of neural network jointly with the selection of the input features from the dataset at hand. Results are discussed and compared to other tuning methods, from which it is concluded that neural predictors optimized via the proposed heuristic wrapper outperform those tuned by means of naive parametrized algorithms, thus allowing for longer-term predictions. These promising results unfold potential applications of this technique in multi-location neighbor-aware traffic prediction.
@inproceedings{lana2017joint,title={{Joint Feature Selection and Parameter Tuning for Short-Term Traffic Flow Forecasting Based on Heuristically Optimized Multi-Layer Neural Networks}},author={Laña, Ibai and Del Ser, Javier and Velez, Manuel and Oregi, Izaskun},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={91--100},doi={10.1007/978-981-10-3728-3_10},}
IEEE Congress on Evolutionary Computation (CEC)
Multi-Objective Heuristics Applied to Robot Task Planning for Inspection Plants
Itziar Landa-Torres, Jesus L. Lobo, Idoia Murua, Diana Manjarres, and Javier Del Ser
In IEEE Congress on Evolutionary Computation (CEC), 2017
Robotics are generally subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this regard the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by presenting experimental results obtained over realistic scenarios of two heuristic solvers (MOHS and NSGA-II) aimed at efficiently scheduling tasks in robotic swarms that collaborate together to accomplish a mission. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks whereas the relative execution order of such tasks within the schedule of certain robots is computed based on the Traveling Salesman Problem (TSP). Experimental results in three different deployment scenarios reveal the goodness of the proposed technique based on the Multi-objective Harmony Search algorithm (MOHS) in terms of Hypervolume (HV) and Coverage Rate (CR) performance indicators.
@inproceedings{landatorres2017multiobjective,title={{Multi-Objective Heuristics Applied to Robot Task Planning for Inspection Plants}},author={Landa-Torres, Itziar and Lobo, Jesus L. and Murua, Idoia and Manjarres, Diana and Del Ser, Javier},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2017},pages={1621--1628},doi={10.1109/cec.2017.7969496},}
3rd International Conference on the Harmony Search Algorithm
A Novel Grouping Harmony Search Algorithm for Clustering Problems
Itziar Landa-Torres, Diana Manjarres, Sergio Gil-Lopez, Javier Del Ser, and Sancho Salcedo-Sanz
In 3rd International Conference on the Harmony Search Algorithm, 2017
The problem of partitioning a data set into disjoint groups or clusters of related items plays a key role in data analytics, in particular when the information retrieval becomes crucial for further data analysis. In this context, clustering approaches aim at obtaining a good partition of the data based on multiple criteria. One of the most challenging aspects of clustering techniques is the inference of the optimal number of clusters. In this regard, a number of clustering methods from the literature assume that the number of clusters is known a priori and subsequently assign instances to clusters based on distance, density or any other criterion. This paper proposes to override any prior assumption on the number of clusters or groups in the data at hand by hybridizing the grouping encoding strategy and the Harmony Search (HS) algorithm. The resulting hybrid approach optimally infers the number of clusters by means of the tailored design of the HS operators, which estimates this important structural clustering parameter as an implicit byproduct of the instance-to-cluster mapping performed by the algorithm. Apart from inferring the optimal number of clusters, simulation results verify that the proposed scheme achieves a better performance than other naive clustering techniques in synthetic scenarios and widely known data repositories.
@inproceedings{landatorres2017novel,title={{A Novel Grouping Harmony Search Algorithm for Clustering Problems}},author={Landa-Torres, Itziar and Manjarres, Diana and Gil-Lopez, Sergio and Del Ser, Javier and Salcedo-Sanz, Sancho},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={78--90},doi={10.1007/978-981-10-3728-3_9},}
3rd International Conference on the Harmony Search Algorithm
On the Creation of Diverse Ensembles for Nonstationary Environments Using Bio-Inspired Heuristics
Jesus L. Lobo, Javier Del Ser, Esther Villar-Rodriguez, Miren Nekane Bilbao, and Sancho Salcedo-Sanz
In 3rd International Conference on the Harmony Search Algorithm, 2017
Recently the relevance of adaptive models for dynamic data environments has turned into a hot topic due to the vast number of scenarios generating nonstationary data streams. When a change (concept drift) in data distribution occurs, the ensembles of models trained over these data sources are obsolete and do not adapt suitably to the new distribution of the data. Although most of the research on the field is focused on the detection of this drift to re-train the ensemble, it is widely known the importance of the diversity in the ensemble shortly after the drift in order to reduce the initial drop in accuracy. In a Big Data scenario in which data can be huge (and also the number of past models), achieving the most diverse ensemble implies the calculus of all possible combinations of models, which is not an easy task to carry out quickly in the long term. This challenge can be formulated as an optimization problem, for which bio-inspired algorithms can play one of the key roles in these adaptive algorithms. Precisely this is the goal of this manuscript: to validate the relevance of the diversity right after drifts, and to unveil how to achieve a highly diverse ensemble by using a self-learning optimization technique.
@inproceedings{lobo2017creation,title={{On the Creation of Diverse Ensembles for Nonstationary Environments Using Bio-Inspired Heuristics}},author={Lobo, Jesus L. and Del Ser, Javier and Villar-Rodriguez, Esther and Bilbao, Miren Nekane and Salcedo-Sanz, Sancho},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={67--77},doi={10.1007/978-981-10-3728-3_8},}
IEEE Congress on Evolutionary Computation (CEC)
A Local Search Method for Graph Clustering Heuristics Based on Partitional Distribution Learning
Diana Manjarres, Itziar Landa-Torres, and Javier Del Ser
In IEEE Congress on Evolutionary Computation (CEC), 2017
The community structure of complex networks reveals hidden relationships in the organization of their constituent nodes. Indeed, many practical problems stemming from different fields of knowledge such as Biology, Sociology, Chemistry and Computer Science can be modeled as a graph. Therefore, graph analysis and community detection have become a key component for understanding the inherent relational characteristics underlying different systems and processes. In this regard, distinct unsupervised quality metrics such as conductance, coverage and modularity, have upsurged in order to evaluate the clustering arrangements based on structural and topological characteristics of the cluster space. In this regard graph clustering can be formulated as an optimization problem based on the maximization of one of such metrics, for which a number of nature-inspired heuristic solvers has been proposed in the literature. This paper elaborates on a novel local search method that allows boosting the convergence of such heuristics by estimating and sampling the cluster arrangement distribution from the set of intermediate produced solutions of the algorithm at hand. Simulation results reveal a generalized better performance compared towards other community detection algorithms in synthetic and real datasets.
@inproceedings{manjarres2017local,title={{A Local Search Method for Graph Clustering Heuristics Based on Partitional Distribution Learning}},author={Manjarres, Diana and Landa-Torres, Itziar and Del Ser, Javier},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2017},pages={1972--1977},doi={10.1109/cec.2017.7969542},}
3rd International Conference on the Harmony Search Algorithm
Optimal Phase Swapping in Low Voltage Distribution Networks Based on Smart Meter Data and Optimization Heuristics
Izaskun Mendia, Sergio Gil-Lopez, Javier Del Ser, Ana Gonzalez-Bordagaray, Jesus Garcia-Prado, and Manuel Velez
In 3rd International Conference on the Harmony Search Algorithm, 2017
In this paper a modified version of the Harmony Search algorithm is proposed as a novel tool for phase swapping in Low Voltage Distribution Networks where the objective is to determine to which phase each load should be connected in order to reduce the unbalance when all phases are added into the neutral conductor. Unbalanced loads deteriorate power quality and increase costs of investment and operation. A correct assignment is a direct, effective alternative to prevent voltage peaks and network outages. The main contribution of this paper is the proposal of an optimization model for allocating phases consumers according to their individual consumption in the network of low-voltage distribution considering mono and bi-phase connections using real hourly load patterns, which implies that the computational complexity of the defined combinatorial optimization problem is heavily increased. For this purpose a novel metric function is defined in the proposed scheme. The performance of the HS algorithm has been compared with classical Genetic Algorithm. Presented results show that HS outperforms GA not only on terms of quality but on the convergence rate, reducing the computational complexity of the proposed scheme while provide mono and bi phase connections.
@inproceedings{mendia2017optimal,title={{Optimal Phase Swapping in Low Voltage Distribution Networks Based on Smart Meter Data and Optimization Heuristics}},author={Mendia, Izaskun and Gil-Lopez, Sergio and Del Ser, Javier and Gonzalez-Bordagaray, Ana and Garcia-Prado, Jesus and Velez, Manuel},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={283--293},doi={10.1007/978-981-10-3728-3_28},}
IEEE Congress on Evolutionary Computation (CEC)
Nature-Inspired Approaches for Distance Metric Learning in Multivariate Time Series Classification
Izaskun Oregi, Javier Del Ser, Aritz Perez, and Jose Antonio Lozano
In IEEE Congress on Evolutionary Computation (CEC), 2017
The applicability of time series data mining in many different fields has motivated the scientific community to focus on the development of new methods towards improving the performance of the classifiers over this particular class of data. In this context the related literature has extensively shown that dynamic time warping is the similarity measure of choice when univariate time series are considered. However, possible statistical coupling among different dimensions make the generalization of this metric to the multivariate case all but obvious. This has ignited the interest of the community in new distance definitions capable of capturing such inter-dimension dependences. In this paper we propose a simple dynamic time warping based distance that finds the best weighted combination between the dependent - where multivariate time series are treated as whole - and independent approaches - where multivariate time series are just a collection of unrelated univariate time series - of the time series to be classified. A benchmark of four heuristic wrappers, namely, simulated annealing, particle swarm optimization, estimation of distribution algorithms and genetic algorithms are used to evolve the set of weighting coefficients towards maximizing the cross-validated predictive score of the classifiers. In this context one of the most recurring classifiers is nearest neighbor. This classifier is couple with a distance that as afore mentioned, in most cases, have been dynamic time warping. The performance of the proposed approach is validated over datasets widely utilized in the related literature, from which it is concluded that the obtained performance gains can be enlarged by properly decoupling the influence of each dimension in the definition of the dependent dynamic time warping distance.
@inproceedings{oregi2017natureinspired,title={{Nature-Inspired Approaches for Distance Metric Learning in Multivariate Time Series Classification}},author={Oregi, Izaskun and Del Ser, Javier and Perez, Aritz and Lozano, Jose Antonio},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2017},pages={1992--1998},doi={10.1109/cec.2017.7969545},}
3rd International Conference on the Harmony Search Algorithm
Wireless Network Optimization for Massive V2I Data Collection Using Multiobjective Harmony Search Heuristics
Iker Sobron, Borja Alonso, Manuel Velez, and Javier Del Ser
In 3rd International Conference on the Harmony Search Algorithm, 2017
This paper proposes to improve the efficiency of the deployment of wireless network infrastructure for massive data collection from vehicles over regional areas. The increase in the devices that are carried by vehicles makes it especially interesting being able to gain access to that data. From a decisional point of view, this collection strategy requires defining a wireless Vehicular-to-Infrastructure (V2I) network that jointly optimizes the level of service and overall CAPEX/OPEX costs of its deployment. Unfortunately, it can be intuitively noted that both optimization objectives are connecting with one another: adding more equipment will certainly increase the level of service (i.e. coverage) of the network, but costs of the deployment will rise accordingly. A decision making tool blending together both objectives and inferring therefrom a set of Pareto-optimal deployments would be of utmost utility for stakeholders in their process of provisioning budgetary resources for the deployment. This work will explore the extent to which a multi-objective Harmony Search algorithm can be used to compute the aforementioned Pareto-optimal set of deployment by operating on two different optimization variables: the geographical position on which wireless receivers are to be deployed and their type, which determines not only their coverage range but also their bandwidth and cost. In particular we will utilize a non-dominated sorting strategy criterion to select the harmonies (solution vectors) evolved by Harmony Search heuristics.
@inproceedings{sobron2017wireless,title={{Wireless Network Optimization for Massive V2I Data Collection Using Multiobjective Harmony Search Heuristics}},author={Sobron, Iker and Alonso, Borja and Velez, Manuel and Del Ser, Javier},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={200--209},doi={10.1007/978-981-10-3728-3_20},}
3rd International Conference on the Harmony Search Algorithm
A Heuristically Optimized Complex Event Processing Engine for Big Data Stream Analytics
Ignacio Olabarrieta, Ana I. Torre-Bastida, Ibai Laña, Sergio Campos-Cordobes, and Javier Del Ser
In 3rd International Conference on the Harmony Search Algorithm, 2017
This paper describes a Big Data stream analytics platform developed within the DEWI project for processing upcoming events from wireless sensors installed in a truck. The platform consists of a Complex Event Processing (CEP) engine capable of triggering alarms from a predefined set of rules. In general these rules are characterized by multiple parameters, for which finding their optimal value usually yields a challenging task. In this paper we explain a methodology based on a meta-heuristic solver that is used as a wrapper to obtain optimal parametric rules for the CEP engine. In particular this approach optimizes CEP rules through the refinement of the parameters controlling their behavior based on an alarm detection improvement criterion. As a result the proposed scheme retrieves the rules parameterized in a detection-optimal fashion. Results for a certain use case – i.e. fuel level of the vehicle – are discussed towards assessing the performance gains provided by our method.
@inproceedings{torrebastida2017heuristically,title={{A Heuristically Optimized Complex Event Processing Engine for Big Data Stream Analytics}},author={Olabarrieta, Ignacio and Torre-Bastida, Ana I. and Laña, Ibai and Campos-Cordobes, Sergio and Del Ser, Javier},booktitle={3rd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2017},pages={101--111},doi={10.1007/978-981-10-3728-3_11},}
IntechOpen
Heuristics and Hyper-Heuristics - Principles and Applications
@book{delser2017heuristics,title={{Heuristics and Hyper-Heuristics - Principles and Applications}},editor={Del Ser, Javier},publisher={IntechOpen},year={2017},}
2016
Expert Systems with Applications
A Novel Grouping Coral Reefs Optimization Algorithm for Optimal Mobile Network Deployment Problems Under Electromagnetic Pollution and Capacity Control Criteria
Sancho Salcedo-Sanz, Pilar Garcia-Diaz, Javier Del Ser, Miren Nekane Bilbao, and Jose Antonio Portilla-Figueras
A new grouping Coral Reefs Optimization algorithm is presented.A problem of mobile network deployment with pollution control is tackled.A real case-study in Alcala de Henares (Madrid) is discussed.Comparison with state of the art algorithms shows excellent performance of the proposed algorithm. This paper proposes a novel optimization algorithm for grouping problems, the Grouping Coral Reefs Optimization algorithm, and describes its application to a Mobile Network Deployment Problem (MNDP) under four optimization criteria. These criteria include economical cost and coverage, and also electromagnetic pollution control and capacity constraints imposed at the base stations controllers, which are novel in this study. The Coral Reefs Optimization algorithm (CRO) is a recently-proposed bio-inspired approach for optimization, based on the simulation of the processes that occur in coral reefs, including reproduction, fight for space or depredation. This paper presents a grouping version of the CRO, which has not previously evaluated before. Grouping meta-heuristics are characterized by variable-length encoding solutions, and have been successfully applied to a number of different optimization and assignment problems. The GCRO proposed is a novel contribution to the intelligent systems field, which is able to improve results obtained by two alternative grouping algorithms such as grouping genetic algorithms and grouping Harmony Search. The performance of the proposed GCRO and the algorithms for comparison has been tested with real data in a case study of a MNDP in Alcala de Henares, Madrid, Spain.
@article{garciadiaz2016novel,title={{A Novel Grouping Coral Reefs Optimization Algorithm for Optimal Mobile Network Deployment Problems Under Electromagnetic Pollution and Capacity Control Criteria}},author={Salcedo-Sanz, Sancho and Garcia-Diaz, Pilar and Del Ser, Javier and Bilbao, Miren Nekane and Portilla-Figueras, Jose Antonio},journal={Expert Systems with Applications},volume={55},pages={388--402},year={2016},doi={10.1016/j.eswa.2016.02.032},}
Soft Computing
A Novel Coral Reefs Optimization Algorithm with Substrate Layers for Optimal Battery Scheduling Optimization in Micro-Grids
Sancho Salcedo-Sanz, Carlos Camacho-Gomez, Ricardo Mallol-Poyato, Silvia Jimenez-Fernandez, and Javier Del Ser
@article{salcedosanz2016novel,title={{A Novel Coral Reefs Optimization Algorithm with Substrate Layers for Optimal Battery Scheduling Optimization in Micro-Grids}},author={Salcedo-Sanz, Sancho and Camacho-Gomez, Carlos and Mallol-Poyato, Ricardo and Jimenez-Fernandez, Silvia and Del Ser, Javier},journal={Soft Computing},volume={20},number={11},pages={4287--4300},year={2016},doi={10.1007/s00500-016-2295-7},}
10th International Symposium on Intelligent Distributed Computing (IDC)
On the Application of Bio-Inspired Heuristics for Network Routing with Multiple QoS Constraints
Miren Nekane Bilbao, Cristina Perfecto, Javier Del Ser, and Xabier Landa
In 10th International Symposium on Intelligent Distributed Computing (IDC), 2016
@inproceedings{bilbao2016application,title={{On the Application of Bio-Inspired Heuristics for Network Routing with Multiple QoS Constraints}},author={Bilbao, Miren Nekane and Perfecto, Cristina and Del Ser, Javier and Landa, Xabier},booktitle={10th International Symposium on Intelligent Distributed Computing (IDC)},series={Studies in Computational Intelligence},year={2016},pages={195--204},doi={10.1007/978-3-319-48829-5_19},}
IEEE Congress on Evolutionary Computation (CEC)
Community Detection in Graphs Based on Surprise Maximization Using Firefly Heuristics
Javier Del Ser, Jesus L. Lobo, Esther Villar-Rodriguez, Miren Nekane Bilbao, and Cristina Perfecto
In IEEE Congress on Evolutionary Computation (CEC), 2016
The detection of node clusters (communities) in graphs has been at the core of many modeling paradigms emerging in different fields and disciplines such as Social Sciences, Biology, Chemistry, Telecommunications and Linguistics. When evaluating the quality of a clustering arrangement unsupervised metrics can be utilized (e.g. modularity), which all rely on structural and topological characteristics of the cluster space rather than on an observed ground of truth that should be achieved. One of such metrics is the recently published Surprise, which evaluates how statistically unlikely a given clustering arrangement is with respect to a random network featuring the same distribution of nodes per cluster. To maximize this metric, a number of algorithms have been proposed in the literature, but their comparative performance varies significantly between networks of different shape and size. In this article a novel heuristic community detection approach is proposed as a means to achieve a universally well-performing tool for graph clustering based on Surprise maximization. The heuristic scheme relies on the search procedure of the so-called Firefly Algorithm, a nature-inspired meta-heuristic solver based on the collective behavior, mutual attractiveness and random yet controlled movement of these insects. The proposed technique emulates these observed behavioral patterns of fireflies in the genotype of the graph clustering problem rather than on an encoded representation of its search space (phenotype). Simulation results evince that the performance of our community detection scheme generalizes better than other schemes when applied over synthetically generated graphs with varying properties.
@inproceedings{delser2016community,title={{Community Detection in Graphs Based on Surprise Maximization Using Firefly Heuristics}},author={Del Ser, Javier and Lobo, Jesus L. and Villar-Rodriguez, Esther and Bilbao, Miren Nekane and Perfecto, Cristina},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2016},pages={2233--2239},doi={10.1109/cec.2016.7744064},}
2nd International Conference on the Harmony Search Algorithm
A Harmony Search Approach for the Selective Pick-up and Delivery Problem with Delayed Drop-Off
Javier Del Ser, Miren Nekane Bilbao, Cristina Perfecto, and Sancho Salcedo-Sanz
In 2nd International Conference on the Harmony Search Algorithm, 2016
@inproceedings{delser2016harmony,title={{A Harmony Search Approach for the Selective Pick-up and Delivery Problem with Delayed Drop-Off}},author={Del Ser, Javier and Bilbao, Miren Nekane and Perfecto, Cristina and Salcedo-Sanz, Sancho},booktitle={2nd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2016},pages={121--131},doi={10.1007/978-3-662-47926-1_13},}
European Conference on the Applications of Evolutionary Computation (EvoApplications)
Joint Topology Optimization, Power Control and Spectrum Allocation for Intra-Vehicular Multi-Hop Sensor Networks Using Dandelion-Encoded Heuristics
Javier Del Ser, Miren Nekane Bilbao, Cristina Perfecto, Antonio Gonzalez-Pardo, and Sergio Campos-Cordobes
In European Conference on the Applications of Evolutionary Computation (EvoApplications), 2016
In the last years the interest in multi-hop communications has gained momentum within the research community due to the challenging characteristics of the intra-vehicular radio environment and the stringent robustness imposed on critical sensors within the vehicle. As opposed to point-to-point network topologies, multi-hop networking allows for an enhanced communication reliability at the cost of an additional processing overhead. In this context this manuscript poses a novel bi-objective optimization problem aimed at jointly minimizing (1) the average Bit Error Rate (BER) of sensing nodes under a majority fusion rule at the central data collection unit; and (2) the mean delay experienced by packets forwarded by such nodes due to multi-hop networking, frequency channel switching time multiplexing at intermediate nodes. The formulated paradigm is shown to be computationally tractable via a combination of evolutionary meta-heuristic algorithms and Dandelion codes, the latter capable of representing tree-like structures like those modeling the multi-hop routing approach. Simulations are carried out for realistic values of intra-vehicular radio channels and co-channel interference due to nearby IEEE 802.11 signals. The obtained results are promising and pave the way towards assessing the practical performance of the proposed scheme in real setups.
@inproceedings{delser2016joint,title={{Joint Topology Optimization, Power Control and Spectrum Allocation for Intra-Vehicular Multi-Hop Sensor Networks Using Dandelion-Encoded Heuristics}},author={Del Ser, Javier and Bilbao, Miren Nekane and Perfecto, Cristina and Gonzalez-Pardo, Antonio and Campos-Cordobes, Sergio},booktitle={European Conference on the Applications of Evolutionary Computation (EvoApplications)},series={Lecture Notes in Computer Science},year={2016},pages={235--250},doi={10.1007/978-3-319-31204-0_16},}
European Wireless
Beamwidth Optimization in Millimeter Wave Small Cell Networks with Relay Nodes: A Swarm Intelligence Approach
Cristina Perfecto, Javier Del Ser, Muhammad Ikram Ashraf, Miren Nekane Bilbao, and Mehdi Bennis
Millimeter wave (mmWave) communications have been postulated as one of the most disruptive technologies for future 5G systems. Among mmWave bands the 60-GHz radio technology is specially suited for ultradense small cells and mobile data offloading scenarios. Many challenges remain to be addressed in mmWave communications but among them deafness, or misalignment between transmitter and receivers beams, and interference management lie among the most prominent ones. In the recent years, scenarios considering negligible interference on mmWave resource allocation have been rather common in literature. To this end, interestingly, many open issues still need to be addressed such as the applicability of noise-limited regime for mmWave. Furthermore, in mmWave the beam-steering mechanism imposes a forced silence period, in the course of which no data can be conveyed, that should not be neglected in throughput/delay calculations. This paper introduces mmWave enabled Small Cell Networks (SCNs) with relaying capabilities where as a result of a coordinated meta-heuristically optimized beamwidth/alignment-delay approach overall system throughput is optimized. Simulations have been conveyed for three transmitter densities under TDMA and naive ’all-on’ scheduling producing average per node throughput increments of up to 248%. The paper further elaborates on the off-balancing impact of alignment delay and time-multiplexing strategies by illustrating how the foreseen transition that increasing the number of transmitters produces in the regime of a fixed-node size SCN in downlink operation fades out by a poor choice in the scheduling strategy.
@inproceedings{perfecto2016beamwidth,title={{Beamwidth Optimization in Millimeter Wave Small Cell Networks with Relay Nodes: A Swarm Intelligence Approach}},author={Perfecto, Cristina and Del Ser, Javier and Ashraf, Muhammad Ikram and Bilbao, Miren Nekane and Bennis, Mehdi},booktitle={European Wireless},year={2016},doi={10.48550/arxiv.1605.05522},}
2nd International Conference on the Harmony Search Algorithm
Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled Mobile Networks
Cristina Perfecto, Miren Nekane Bilbao, Javier Del Ser, Armando Ferro, and Sancho Salcedo-Sanz
In 2nd International Conference on the Harmony Search Algorithm, 2016
@inproceedings{perfecto2016dandelionencoded,title={{Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled Mobile Networks}},author={Perfecto, Cristina and Bilbao, Miren Nekane and Del Ser, Javier and Ferro, Armando and Salcedo-Sanz, Sancho},booktitle={2nd International Conference on the Harmony Search Algorithm},series={Advances in Intelligent Systems and Computing},year={2016},pages={133--145},doi={10.1007/978-3-662-47926-1_14},}
IEEE Congress on Evolutionary Computation (CEC)
A Novel Adaptive Density-Based ACO Algorithm with Minimal Encoding Redundancy for Clustering Problems
Esther Villar-Rodriguez, Antonio Gonzalez-Pardo, Javier Del Ser, Miren Nekane Bilbao, and Sancho Salcedo-Sanz
In IEEE Congress on Evolutionary Computation (CEC), 2016
In the so-called Big Data paradigm descriptive analytics are widely conceived as techniques and models aimed at discovering knowledge within unlabeled datasets (e.g. patterns, similarities, etc) of utmost help for subsequent predictive and prescriptive methods. One of these techniques is clustering, which hinges on different multi-dimensional measures of similarity between unsupervised data instances so as to blindly collect them in groups of clusters. Among the myriad of clustering approaches reported in the literature this manuscript focuses on those relying on bio-inspired meta-heuristics, which have been lately shown to outperform traditional clustering schemes in terms of convergence, adaptability and parallelization. Specifically this work presents a new clustering approach based on the processing fundamentals of the Ant Colony Optimization (ACO) algorithm, i.e. stigmergy via pheromone trails and progressive construction of solutions through a graph. The novelty of the proposed scheme beyond previous research on ACO-based clustering lies on a significantly pruned graph that not only minimizes the representation redundancy of the problem at hand, but also allows for an embedded estimation of the number of clusters within the data. However, this approach imposes a modified ant behavior so as to account for the optimality of entire paths rather than that of single steps within the graph. Simulation results over conventional datasets will evince the promising performance of our approach and motivate further research aimed at its applicability to real scenarios.
@inproceedings{villarrodriguez2016novel,title={{A Novel Adaptive Density-Based ACO Algorithm with Minimal Encoding Redundancy for Clustering Problems}},author={Villar-Rodriguez, Esther and Gonzalez-Pardo, Antonio and Del Ser, Javier and Bilbao, Miren Nekane and Salcedo-Sanz, Sancho},booktitle={IEEE Congress on Evolutionary Computation (CEC)},year={2016},pages={3139--3145},doi={10.1109/cec.2016.7744186},}
2015
International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)
On the Heritability of Dandelion-Encoded Harmony Search Heuristics for Tree Optimization Problems
Cristina Perfecto, Miren Nekane Bilbao, Javier Del Ser, and Armando Ferro
In International Symposium on Innovations in Intelligent SysTems and Applications (INISTA), 2015
Tree based optimization problems stand for those paradigms where solutions can be arranged within a tree-like graph whose nodes represent the optimization variables of the problem at hand and their interconnecting edges topological and/or hierarchical relationships between such variables. In this context, a research line of increasing interest during the last decade focuses on the derivation of intelligent solution encoding strategies capable of 1) capturing all topological constraints of this particular class of graphs; and 2) preserving their connectivity properties when they undergo combination/mutation operations within approximative evolutionary solvers. This manuscript takes a step over the state of the art by shedding light on the heri-tability properties of the Dandelion tree encoding approach under avant-garde stochastically-controlled evolutionary operators. In particular we elaborate on the topological heritability of the so-called Harmony Memory Considering Rate (HMCR) exploitative operator of the Harmony Search algorithm, a population-based meta-heuristic algorithm that has so far shown to outperform other evolutionary schemes in a wide range of optimization scenarios. Results from extensive Monte Carlo simulations are discussed in terms of the preserved structural properties of the newly produced solutions with respect to the initial Dandelion-encoded population.
@inproceedings{perfecto2015heritability,title={{On the Heritability of Dandelion-Encoded Harmony Search Heuristics for Tree Optimization Problems}},author={Perfecto, Cristina and Bilbao, Miren Nekane and Del Ser, Javier and Ferro, Armando},booktitle={International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)},year={2015},pages={1--8},doi={10.1109/inista.2015.7276763},}
Conference of the Spanish Association for Artificial Intelligence (CAEPIA 2016)
On the Applicability of Ant Colony Optimization to Non-Intrusive Load Monitoring in Smart Grids
Antonio Gonzalez-Pardo, Javier Del Ser, and David Camacho
In Conference of the Spanish Association for Artificial Intelligence (CAEPIA 2016), 2015
Along with the proliferation of the Smart Grid, power load disaggregation is a research area that is lately gaining a lot of popularity due to the interest of energy distribution companies and customers in identifying consumption patterns towards improving the way the energy is produced and consumed via e.g. demand side management strategies. Such data can be extracted by using smart meters, but the expensive cost of incorporating a monitoring device for each appliance jeopardizes significantly the massive implementation of any straightforward approach. When resorting to a single meter to monitor the global consumption of the house at hand, the identification of the different appliances giving rise to the recorded consumption profile renders a particular instance of the so-called source separation problem, for which a number of algorithmic proposals have been reported in the literature. This paper gravitates on the applicability of the Ant Colony Optimization ACO algorithm to perform this power disaggregation treating the problem as a Constraint Satisfaction Problem CSP. The discussed experimental results utilize data contained in the REDD dataset, which corresponds to real power consumption traces of different households. Although the experiments carried out in this work reveal that the ACO solver can be successfully applied to the Non-Intrusive Load Monitoring problems, further work is needed towards assessing its performance when tackling more diverse appliance models and noisy power load traces.
@inproceedings{gonzalezpardo2016applicability,title={{On the Applicability of Ant Colony Optimization to Non-Intrusive Load Monitoring in Smart Grids}},author={Gonzalez-Pardo, Antonio and Del Ser, Javier and Camacho, David},booktitle={Conference of the Spanish Association for Artificial Intelligence (CAEPIA 2016)},series={Lecture Notes in Computer Science},year={2015},pages={312--321},doi={10.1007/978-3-319-24598-0_28},}
International Journal of Bioinspired Computation
On the Application of Multi-Objective Harmony Search Heuristics to the Predictive Deployment of Firefighting Aircrafts: A Realistic Case Study
Miren Nekane Bilbao, Javier Del Ser, Sancho Salcedo-Sanz, and Carlos Casanova-Mateo
International Journal of Bioinspired Computation, 2015
This manuscript focuses on the increasing frequency and scales of worldwide wildfires and the need for enhancing the effectiveness of firefighting resources. The scope is focused on optimally deploying firefighting aircrafts on aerodromes and airports existing over an area based on fire risk predictions. This scenario is formulated as a capacity-constrained multi-objective optimisation problem where the utility of the deployed resources with respect to fire forest risk predictions is to be maximised, and expenditures associated with the reallocation of aircrafts must be minimised. This formulation is further complemented by including the impact of the distance from the wildfire to water sources in the firefighting utility function. To efficiently tackle this problem a multi-objective harmony search solver is designed and tested in synthetically generated and real scenarios for the Iberian Peninsula. The results obtained pave the way towards the utilisation of this tool by decision makers when outlining their firefighting logistics.
@article{bilbao2015application,title={{On the Application of Multi-Objective Harmony Search Heuristics to the Predictive Deployment of Firefighting Aircrafts: A Realistic Case Study}},author={Bilbao, Miren Nekane and Del Ser, Javier and Salcedo-Sanz, Sancho and Casanova-Mateo, Carlos},journal={International Journal of Bioinspired Computation},volume={7},number={5},pages={270--284},year={2015},doi={10.1504/ijbic.2015.072257},}
Engineering Optimization
A Random-Key Encoded Harmony Search Approach for Energy-Efficient Production Scheduling with Shared Resources
Carlos Alberto Garcia-Santiago, Javier Del Ser, Connor Upton, Fergus Quilligan, Sergio Gil-Lopez, and Sancho Salcedo-Sanz
When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.
@article{garciasantiago2015random,title={{A Random-Key Encoded Harmony Search Approach for Energy-Efficient Production Scheduling with Shared Resources}},author={Garcia-Santiago, Carlos Alberto and Del Ser, Javier and Upton, Connor and Quilligan, Fergus and Gil-Lopez, Sergio and Salcedo-Sanz, Sancho},journal={Engineering Optimization},volume={47},number={11},pages={1481--1496},year={2015},doi={10.1080/0305215x.2014.971778},}
Renewable Energy
A Coral Reefs Optimization Algorithm with Harmony Search Operators for Accurate Wind Speed Prediction
Sancho Salcedo-Sanz, Alvaro Pastor-Sanchez, Javier Del Ser, Luis Prieto, and Zong Woo Geem
@article{salcedosanz2015coral,title={{A Coral Reefs Optimization Algorithm with Harmony Search Operators for Accurate Wind Speed Prediction}},author={Salcedo-Sanz, Sancho and Pastor-Sanchez, Alvaro and Del Ser, Javier and Prieto, Luis and Geem, Zong Woo},journal={Renewable Energy},volume={75},pages={93--101},year={2015},doi={10.1016/j.renene.2014.09.027},}
Energy Conversion and Management
One-Year-Ahead Energy Demand Estimation from Macroeconomic Variables Using Computational Intelligence Algorithms
Sancho Salcedo-Sanz, Jesus Muñoz-Bulnes, Jose Antonio Portilla-Figueras, and Javier Del Ser
@article{salcedosanz2015one,title={{One-Year-Ahead Energy Demand Estimation from Macroeconomic Variables Using Computational Intelligence Algorithms}},author={Salcedo-Sanz, Sancho and Muñoz-Bulnes, Jesus and Portilla-Figueras, Jose Antonio and Del Ser, Javier},journal={Energy Conversion and Management},volume={99},pages={62--71},year={2015},doi={10.1016/j.enconman.2015.03.109},}
2014
The Scientific World Journal
The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems
Sancho Salcedo-Sanz, Javier Del Ser, Itziar Landa-Torres, Sergio Gil-Lopez, and Jose Antonio Portilla-Figueras
This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals’ reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems.
@article{salcedosanz2014coral,title={{The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems}},author={Salcedo-Sanz, Sancho and Del Ser, Javier and Landa-Torres, Itziar and Gil-Lopez, Sergio and Portilla-Figueras, Jose Antonio},journal={The Scientific World Journal},volume={2014},pages={739768},year={2014},doi={10.1155/2014/739768},}
TOP
Novel Hybrid Heuristics for an Extension of the Dynamic Relay Deployment Problem over Disaster Areas
Miren Nekane Bilbao, Sergio Gil-Lopez, Javier Del Ser, Sancho Salcedo-Sanz, Mikel Sanchez-Ponte, and Antonio Arana-Castro
@article{bilbao2014novel,title={{Novel Hybrid Heuristics for an Extension of the Dynamic Relay Deployment Problem over Disaster Areas}},author={Bilbao, Miren Nekane and Gil-Lopez, Sergio and Del Ser, Javier and Salcedo-Sanz, Sancho and Sanchez-Ponte, Mikel and Arana-Castro, Antonio},journal={TOP},volume={22},number={3},pages={997--1016},year={2014},doi={10.1007/s11750-013-0308-6},}
Applied Soft Computing
A Coral Reefs Optimization Algorithm for Optimal Mobile Network Deployment with Electromagnetic Pollution Control Criterion
Sancho Salcedo-Sanz, Pilar Garcia-Diaz, Jose Antonio Portilla-Figueras, Javier Del Ser, and Sergio Gil-Lopez
@article{garciadiaz2014coral,title={{A Coral Reefs Optimization Algorithm for Optimal Mobile Network Deployment with Electromagnetic Pollution Control Criterion}},author={Salcedo-Sanz, Sancho and Garcia-Diaz, Pilar and Portilla-Figueras, Jose Antonio and Del Ser, Javier and Gil-Lopez, Sergio},journal={Applied Soft Computing},volume={24},pages={239--248},year={2014},doi={10.1016/j.asoc.2014.07.007},}
The Scientific World Journal
An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems
Sancho Salcedo-Sanz, Javier Del Ser, and Zong Woo Geem
This paper presents a novel fuzzy clustering technique based on grouping genetic algorithms (GGAs), which are a class of evolutionary algorithms especially modified to tackle grouping problems. Our approach hinges on a GGA devised for fuzzy clustering by means of a novel encoding of individuals (containing elements and clusters sections), a new fitness function (a superior modification of the Davies Bouldin index), specially tailored crossover and mutation operators, and the use of a scheme based on a local search and a parallelization process, inspired from an island-based model of evolution. The overall performance of our approach has been assessed over a number of synthetic and real fuzzy clustering problems with different objective functions and distance measures, from which it is concluded that the proposed approach shows excellent performance in all cases.
@article{salcedosanz2014island,title={{An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems}},author={Salcedo-Sanz, Sancho and Del Ser, Javier and Geem, Zong Woo},journal={The Scientific World Journal},volume={2014},pages={916371},publisher={Hindawi},year={2014},doi={10.1155/2014/916371},}
9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO)
A Bi-Objective Harmony Search Approach for Deploying Cost-Effective Multi-Hop Communications over Large-Area Wildfires
Miren Nekane Bilbao, Javier Del Ser, Sancho Salcedo-Sanz, Sergio Gil-Lopez, and José A. Portilla Figueras
In 9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO), 2014
@inproceedings{bilbao2014biobjective,title={{A Bi-Objective Harmony Search Approach for Deploying Cost-Effective Multi-Hop Communications over Large-Area Wildfires}},author={Bilbao, Miren Nekane and Del Ser, Javier and Salcedo-Sanz, Sancho and Gil-Lopez, Sergio and Portilla Figueras, José A.},booktitle={9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO)},series={Advances in Intelligent Systems and Computing},year={2014},pages={93--103},doi={10.1007/978-3-319-07995-0_10},}
4th International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)
A Meta-Heuristically Optimized Fuzzy Approach Towards Multi-Metric Security Risk Assessment in Heterogeneous System of Systems
Iñaki Eguia and Javier Del Ser
In 4th International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS), 2014
Security measurement of complex systems is a challenging task since devices deployed over the so-called System of Systems (SoS) are extremely heterogeneous and hence imply an interoperability effort in order to enable a common resilient security measurement language. Moreover, systems demand more features beyond security concept, require to preserve privacy and claim for dependable structures in order to seek a holistic and aggregated security and safety view. This paper addresses this need by capitalizing the availability of multiple security metrics through an hybrid meta-heuristic fuzzy aggregation and composition approach that takes into account the expertise compiled by the security manager, towards the generation of visual dashboards reflecting the SPD (Security, Privacy and Dependability) risk status of the system at hand.
@inproceedings{eguia2014metaheuristically,title={{A Meta-Heuristically Optimized Fuzzy Approach Towards Multi-Metric Security Risk Assessment in Heterogeneous System of Systems}},author={Eguia, Iñaki and Del Ser, Javier},booktitle={4th International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)},year={2014},pages={231--236},doi={10.5220/0004876802310236},}
5th International Renewable Energy Congress (IREC)
A Novel Multi-Objective Algorithm for the Optimal Placement of Wind Turbines with Cost and Yield Production Criteria
Diana Manjarres, Valentin Sanchez, Javier Del Ser, Itziar Landa-Torres, Sergio Gil-Lopez, Naima Vande Walle, and 1 more author
In 5th International Renewable Energy Congress (IREC), 2014
During the last years wind energy has experimented a significant growth in comparison with other types of renewable energy sources. Accordingly, the number of wind farms has increased sharply to become one of the most developed worldwide infrastructures. Unfortunately, the high number of constraints and restrictions that must be considered nowadays when designing a wind farm deployment (e.g. protected environmental areas or geographical unfeasibility) calls for tools aimed at the cost-effective optimal placement of wind farms, along with an optimized micro-siting of their compounding wind turbines. In this paper a novel multi-objective adaptation of the Harmony Search meta-heuristic algorithm is developed and tested for efficiently solving the problem of optimally deploying wind turbines in wind farms, which is accomplished by simultaneously addressing two conflicting objectives: the yield production and the capital cost of the deployment. Experimental simulation results over a certain region of the Basque Country (northern Spain) will be presented and discussed so as to shed light on the practical applicability of the derived solver.
@inproceedings{manjarres2014novel,title={{A Novel Multi-Objective Algorithm for the Optimal Placement of Wind Turbines with Cost and Yield Production Criteria}},author={Manjarres, Diana and Sanchez, Valentin and Del Ser, Javier and Landa-Torres, Itziar and Gil-Lopez, Sergio and Vande Walle, Naima and Guidon, Nicolaz},booktitle={5th International Renewable Energy Congress (IREC)},year={2014},pages={1--6},doi={10.1109/irec.2014.6827038},}
9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO)
A Novel Harmony Search Algorithm for One-Year-Ahead Energy Demand Estimation Using Macroeconomic Variables
Sancho Salcedo-Sanz, José Antonio Portilla Figueras, Jesus Muñoz Bulnes, Javier Del Ser, and Miren Nekane Bilbao
In 9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO), 2014
@inproceedings{salcedosanz2014novel,title={{A Novel Harmony Search Algorithm for One-Year-Ahead Energy Demand Estimation Using Macroeconomic Variables}},author={Salcedo-Sanz, Sancho and Portilla Figueras, José Antonio and Muñoz Bulnes, Jesus and Del Ser, Javier and Bilbao, Miren Nekane},booktitle={9th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO)},series={Advances in Intelligent Systems and Computing},year={2014},pages={251--258},doi={10.1007/978-3-319-07995-0_25},}
2013
Engineering Applications of Artificial Intelligence
A Survey on Applications of the Harmony Search Algorithm
Diana Manjarres, Itziar Landa-Torres, Sergio Gil-Lopez, Javier Del Ser, Miren Nekane Bilbao, Sancho Salcedo-Sanz, and 1 more author
Engineering Applications of Artificial Intelligence, 2013
@article{manjarres2013survey,title={{A Survey on Applications of the Harmony Search Algorithm}},author={Manjarres, Diana and Landa-Torres, Itziar and Gil-Lopez, Sergio and Del Ser, Javier and Bilbao, Miren Nekane and Salcedo-Sanz, Sancho and Geem, Zong Woo},journal={Engineering Applications of Artificial Intelligence},volume={26},number={8},pages={1818--1831},publisher={Pergamon},year={2013},doi={10.1016/j.engappai.2013.05.008},}
Engineering Applications of Artificial Intelligence
Efficient Citywide Planning of Open WiFi Access Networks Using Novel Grouping Harmony Search Heuristics
I. Landa-Torres, S. Gil-Lopez, Javier Del Ser, S. Salcedo-Sanz, D. Manjarres, and J. A. Portilla-Figueras
Engineering Applications of Artificial Intelligence, 2013
@article{landatorres2013efficient,title={{Efficient Citywide Planning of Open WiFi Access Networks Using Novel Grouping Harmony Search Heuristics}},author={Landa-Torres, I. and Gil-Lopez, S. and Del Ser, Javier and Salcedo-Sanz, S. and Manjarres, D. and Portilla-Figueras, J. A.},journal={Engineering Applications of Artificial Intelligence},volume={26},number={3},pages={1124--1130},year={2013},doi={10.1016/j.engappai.2012.05.020},}
Expert Systems with Applications
A Multi-Objective Grouping Harmony Search Algorithm for the Optimal Distribution of 24-Hour Medical Emergency Units
I. Landa-Torres, D. Manjarres, S. Salcedo-Sanz, Javier Del Ser, and S. Gil-Lopez
@article{landatorres2013multi,title={{A Multi-Objective Grouping Harmony Search Algorithm for the Optimal Distribution of 24-Hour Medical Emergency Units}},author={Landa-Torres, I. and Manjarres, D. and Salcedo-Sanz, S. and Del Ser, Javier and Gil-Lopez, S.},journal={Expert Systems with Applications},volume={40},number={6},pages={2343--2349},year={2013},doi={10.1016/j.eswa.2012.10.051},}
Engineering Applications of Artificial Intelligence
On the Design of a Novel Two-Objective Harmony Search Approach for Distance- and Connectivity-Based Localization in Wireless Sensor Networks
D. Manjarres, Javier Del Ser, S. Gil-Lopez, M. Vecchio, I. Landa-Torres, S. Salcedo-Sanz, and 1 more author
Engineering Applications of Artificial Intelligence, 2013
@article{manjarres2013design,title={{On the Design of a Novel Two-Objective Harmony Search Approach for Distance- and Connectivity-Based Localization in Wireless Sensor Networks}},author={Manjarres, D. and Del Ser, Javier and Gil-Lopez, S. and Vecchio, M. and Landa-Torres, I. and Salcedo-Sanz, S. and Lopez-Valcarce, R.},journal={Engineering Applications of Artificial Intelligence},volume={26},number={2},pages={669--676},year={2013},doi={10.1016/j.engappai.2012.06.002},}
Soft Computing
A Novel Heuristic Approach for Distance- and Connectivity-Based Multihop Node Localization in Wireless Sensor Networks
D. Manjarres, Javier Del Ser, S. Gil-Lopez, M. Vecchio, I. Landa-Torres, and R. Lopez-Valcarce
@article{manjarres2013novel,title={{A Novel Heuristic Approach for Distance- and Connectivity-Based Multihop Node Localization in Wireless Sensor Networks}},author={Manjarres, D. and Del Ser, Javier and Gil-Lopez, S. and Vecchio, M. and Landa-Torres, I. and Lopez-Valcarce, R.},journal={Soft Computing},volume={17},number={1},pages={17--28},year={2013},doi={10.1007/s00500-012-0897-2},}
Expert Systems with Applications
One-Way Urban Traffic Reconfiguration Using a Multi-Objective Harmony Search Approach
S. Salcedo-Sanz, D. Manjarrés, Á. Pastor-Sánchez, Javier Del Ser, J. A. Portilla-Figueras, and S. Gil-López
@article{salcedosanz2013one,title={{One-Way Urban Traffic Reconfiguration Using a Multi-Objective Harmony Search Approach}},author={Salcedo-Sanz, S. and Manjarrés, D. and Pastor-Sánchez, Á. and Del Ser, Javier and Portilla-Figueras, J. A. and Gil-López, S.},journal={Expert Systems with Applications},volume={40},number={9},pages={3341--3350},year={2013},doi={10.1016/j.eswa.2012.12.043},}
15th Applied Stochastic Models and Data Analysis (ASMDA 2013)
A Meta-Heuristic Approach for the Optimal Deployment of Aerial Firefighting Fleets Based on Predictive Fire Weather Risk Estimations
Miren Nekane Bilbao, Daniel Gallo, Sancho Salcedo-Sanz, Javier Del Ser, and Carlos Casanova-Mateo
In 15th Applied Stochastic Models and Data Analysis (ASMDA 2013), 2013
@inproceedings{bilbao2013metaheuristic,title={{A Meta-Heuristic Approach for the Optimal Deployment of Aerial Firefighting Fleets Based on Predictive Fire Weather Risk Estimations}},author={Bilbao, Miren Nekane and Gallo, Daniel and Salcedo-Sanz, Sancho and Del Ser, Javier and Casanova-Mateo, Carlos},booktitle={15th Applied Stochastic Models and Data Analysis (ASMDA 2013)},year={2013},}
15th Applied Stochastic Models and Data Analysis (ASMDA)
On the Application of an Evolutionary Algorithm for the Optimization of Kitting Areas in Car Manufacturing Production Chains
Carlos Alberto Garcia Santiago, Asier Gonzalez-Gonzalez, Itziar Landa-Torres, Javier Del Ser, Sergio Gil-Lopez, Isabel Diaz-Iriberri, and 2 more authors
In 15th Applied Stochastic Models and Data Analysis (ASMDA), 2013
@inproceedings{garciasantiago2013application,title={{On the Application of an Evolutionary Algorithm for the Optimization of Kitting Areas in Car Manufacturing Production Chains}},author={Garcia Santiago, Carlos Alberto and Gonzalez-Gonzalez, Asier and Landa-Torres, Itziar and Del Ser, Javier and Gil-Lopez, Sergio and Diaz-Iriberri, Isabel and Duran Limon, Fernando and Salcedo-Sanz, Sancho},booktitle={15th Applied Stochastic Models and Data Analysis (ASMDA)},year={2013},}
15th Applied Stochastic Models and Data Analysis (ASMDA)
The Coral Reefs Optimization Algorithm: An Efficient Meta-Heuristic for Solving Hard Optimization Problems
Sancho Salcedo-Sanz, Javier Del Ser, Itziar Landa-Torres, Sergio Gil-Lopez, and José A. Portilla Figueras
In 15th Applied Stochastic Models and Data Analysis (ASMDA), 2013
@inproceedings{salcedosanz2013coral,title={{The Coral Reefs Optimization Algorithm: An Efficient Meta-Heuristic for Solving Hard Optimization Problems}},author={Salcedo-Sanz, Sancho and Del Ser, Javier and Landa-Torres, Itziar and Gil-Lopez, Sergio and Portilla Figueras, José A.},booktitle={15th Applied Stochastic Models and Data Analysis (ASMDA)},year={2013},}
IntechOpen
Recent Advances on Meta-Heuristics and Their Application to Real Scenarios
@book{delser2013recent,title={{Recent Advances on Meta-Heuristics and Their Application to Real Scenarios}},editor={Del Ser, Javier},publisher={IntechOpen},year={2013},}
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
Efficient Design of a Double-Band Coplanar Hybrid Antenna Using Multi-Objective Evolutionary Programming
R. Sánchez-Montero, P. López-Espí, D. Manjarres, I. Landa-Torres, S. Salcedo-Sanz, and Javier Del Ser
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 2013
SUMMARY In this paper, we propose the optimization of the parameters of a hybrid antenna for wireless applications by using a multi‐objective evolutionary programming (EP). Specifically, the antenna proposed is formed by a planar inverted‐F antenna and a coplanar patch, in the same structure. The objective functions to carry out the optimization process are related to the antenna’s bandwidth and the gain requirements in the wireless applications considered. In fact, the antenna is intended to be used in mobile and WIFI applications simultaneously. To be concise, we have utilized an improved fast EP optimization approach that includes a selection mechanism based on nondominated ranking procedure with crowding distance to maintain diversity in the population. In the experimental part of the paper, we show that the multi‐objective EP–improved fast EP is able to obtain excellent results in the parameters’ design of this hybrid device, with reasonable values of both bandwidth and gain values. Copyright
@article{sanchezmontero2012efficient,title={{Efficient Design of a Double-Band Coplanar Hybrid Antenna Using Multi-Objective Evolutionary Programming}},author={Sánchez-Montero, R. and López-Espí, P. and Manjarres, D. and Landa-Torres, I. and Salcedo-Sanz, S. and Del Ser, Javier},journal={International Journal of Numerical Modelling: Electronic Networks, Devices and Fields},year={2013},pages={620--629},number={6},volume={26},doi={10.1002/jnm.1869},}
2012
Expert Systems with Applications
A Novel Grouping Harmony Search Algorithm for the Multiple-Type Access Node Location Problem
I. Landa-Torres, S. Gil-Lopez, S. Salcedo-Sanz, Javier Del Ser, and J. A. Portilla-Figueras
@article{landatorres2012novel,title={{A Novel Grouping Harmony Search Algorithm for the Multiple-Type Access Node Location Problem}},author={Landa-Torres, I. and Gil-Lopez, S. and Salcedo-Sanz, S. and Del Ser, Javier and Portilla-Figueras, J. A.},journal={Expert Systems with Applications},volume={39},number={5},pages={5262--5270},year={2012},doi={10.1016/j.eswa.2011.11.013},}
Applied Soft Computing Journal
Centralized and Distributed Spectrum Channel Assignment in Cognitive Wireless Networks: A Harmony Search Approach
Javier Del Ser, M. Matinmikko, S. Gil-López, and M. Mustonen
@article{delser2012centralized,title={{Centralized and Distributed Spectrum Channel Assignment in Cognitive Wireless Networks: A Harmony Search Approach}},author={Del Ser, Javier and Matinmikko, M. and Gil-López, S. and Mustonen, M.},journal={Applied Soft Computing Journal},volume={12},number={2},pages={921--930},year={2012},doi={10.1016/j.asoc.2011.10.001},}
Expert Systems with Applications
A New Grouping Genetic Algorithm for Clustering Problems
L. E. Agustín-Blas, S. Salcedo-Sanz, S. Jiménez-Fernández, L. Carro-Calvo, Javier Del Ser, and J. A. Portilla-Figueras
@article{agustinblas2012new,title={{A New Grouping Genetic Algorithm for Clustering Problems}},author={Agustín-Blas, L. E. and Salcedo-Sanz, S. and Jiménez-Fernández, S. and Carro-Calvo, L. and Del Ser, Javier and Portilla-Figueras, J. A.},journal={Expert Systems with Applications},volume={39},number={10},pages={9695--9703},year={2012},doi={10.1016/j.eswa.2012.02.149},}
Expert Systems with Applications
A Hybrid Harmony Search Algorithm for the Spread Spectrum Radar Polyphase Codes Design Problem
S. Gil-López, Javier Del Ser, S. Salcedo-Sanz, Á. M. Pérez-Bellido, J. M. Cabero, and J. A. Portilla-Figueras
@article{gillopez2012hybrid,title={{A Hybrid Harmony Search Algorithm for the Spread Spectrum Radar Polyphase Codes Design Problem}},author={Gil-López, S. and Del Ser, Javier and Salcedo-Sanz, S. and Pérez-Bellido, Á. M. and Cabero, J. M. and Portilla-Figueras, J. A.},journal={Expert Systems with Applications},volume={39},number={12},pages={11089--11093},year={2012},doi={10.1016/j.eswa.2012.03.063},}
Computers and Operations Research
A Comparative Study of Two Hybrid Grouping Evolutionary Techniques for the Capacitated P-Median Problem
I. Landa-Torres, Javier Del Ser, S. Salcedo-Sanz, S. Gil-Lopez, J. A. Portilla-Figueras, and O. Alonso-Garrido
@article{landatorres2012comparative,title={{A Comparative Study of Two Hybrid Grouping Evolutionary Techniques for the Capacitated P-Median Problem}},author={Landa-Torres, I. and Del Ser, Javier and Salcedo-Sanz, S. and Gil-Lopez, S. and Portilla-Figueras, J. A. and Alonso-Garrido, O.},journal={Computers and Operations Research},volume={39},number={9},pages={2214--2222},year={2012},doi={10.1016/j.cor.2011.11.004},}
IEEE Journal on Selected Topics in Signal Processing
Evaluating the Internationalization Success of Companies Through a Hybrid Grouping Harmony Search-Extreme Learning Machine Approach
I. Landa-Torres, E. G. Ortiz-García, S. Salcedo-Sanz, M. J. Segovia-Vargas, S. Gil-López, M. Miranda, and 2 more authors
IEEE Journal on Selected Topics in Signal Processing, 2012
The internationalization of a company is widely understood as the corporative strategy for growing through external markets. It usually embodies a hard process, which affects diverse activities of the value chain and impacts on the organizational structure of the company. There is not a general model for a successful international company, so the success of an internationalization procedure must be estimated based on different variables addressing the status, strategy and market characteristics of the company at hand. This paper presents a novel hybrid soft-computing approach for evaluating the internationalization success of a company based on existing past data. Specifically, we propose a hybrid algorithm composed by a grouping-based harmony search (HS) approach and an extreme learning machine (ELM) ensemble. The proposed hybrid scheme further incorporates a feature selection method, which is obtained by means of a given group in the HS encoding format, whereas the ELM ensemble renders the final accuracy metric of the model. Practical results for the proposed hybrid technique are obtained in a real application based on the exporting success of Spanish manufacturing companies, which are shown to be satisfactory in comparison with alternative state-of-the-art techniques.
@article{landatorres2012evaluating,title={{Evaluating the Internationalization Success of Companies Through a Hybrid Grouping Harmony Search-Extreme Learning Machine Approach}},author={Landa-Torres, I. and Ortiz-García, E. G. and Salcedo-Sanz, S. and Segovia-Vargas, M. J. and Gil-López, S. and Miranda, M. and Leiva-Murillo, J. M. and Del Ser, Javier},journal={IEEE Journal on Selected Topics in Signal Processing},volume={6},number={4},pages={388--398},year={2012},doi={10.1109/jstsp.2012.2199463},}
IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
On the Design of an Heuristically Optimized Multiband Spectrum Sensing Approach for Cognitive Radio Systems
Javier Del Ser, Asier Alonso, Sergio Gil-Lopez, Mikel Garay, Uli Kretzschmar, and Asier Astarloa
In IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2012
This extended abstract outlines a novel optimization approach for multi-band linear collaborative spectrum (LCS) sensing based on harmony search heuristics. Besides, the description of a centralized system architecture is also included in this manuscript, which is capable of processing the captured spectrum measurements from several nodes in a LCS fashion and storing the decisions made on the spectrum occupancy. In particular, the value of the coefficients participating in the LSC sensing technique are optimized based on a maximum throughput criteria. The performance rendered by the heuristics utilized in this work are assessed and compared, through extensive simulations, to those of a state-of-the-art layout instead resorting to a genetically-inspired solver for the aforementioned optimization. This work is currently under development under the funded FP7 project CREW (Cognitive Radio Experimentation World).
@inproceedings{delser2012design,title={{On the Design of an Heuristically Optimized Multiband Spectrum Sensing Approach for Cognitive Radio Systems}},author={Del Ser, Javier and Alonso, Asier and Gil-Lopez, Sergio and Garay, Mikel and Kretzschmar, Uli and Astarloa, Asier},booktitle={IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)},year={2012},pages={168--169},doi={10.1109/camad.2012.6335323},}
IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
A Discrete Particle Swarm Optimization Algorithm for Mobile Network Deployment Problems
Pilar Garcia, Sancho Salcedo-Sanz, Javier Plaza, Jose A. Portilla Figueras, and Javier Del Ser
In IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2012
In this paper we present a hybrid discrete Particle Swarm Optimization (PSO) algorithm for the Mobile Network Deployment Problem (MNDP). First, we fully describe the MNDP, including a term for taking into account the Electromagnetic field produced by new locations of BTSs. We also describe the proposed PSO algorithm and some variations incorporated in order to cope with discrete search spaces, such as the one in the MNDP. We finally show the performance of the proposed discrete PSO in a real MNDP in a Spanish city near Madrid: Alcalá de Henares.
@inproceedings{garcia2012discrete,title={{A Discrete Particle Swarm Optimization Algorithm for Mobile Network Deployment Problems}},author={Garcia, Pilar and Salcedo-Sanz, Sancho and Plaza, Javier and Portilla Figueras, Jose A. and Del Ser, Javier},booktitle={IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)},year={2012},pages={61--65},doi={10.1109/camad.2012.6335379},}
IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
A Preliminary Approach to Near-Optimal Multi-Hop Capacitated Network Design Using Grouping-Dandelion Encoded Heuristics
Itziar Landa-Torres, Diana Manjarres, Sergio Gil-Lopez, Javier Del Ser, and Sancho Salcedo-Sanz
In IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2012
In this paper we outline a novel global heuristic tool to deal with a combination of the Capacitated P-Median (CPMP) and the Capacitated Minimum Spanning Tree (CMST) problems. This preliminary approach provides an efficient (in terms of power consumption due to emission or signal interferences) traffic-flow design for a setup consisting of a number of spatially distributed nodes transmitting information to a common destination or sink node. Our proposal relies on gathering the information from the whole network through a fixed number of cluster heads or concentrators (CPMP), and then on routing the clustered traffic through these selected cluster-heads taking into account the accumulated capacity constraints (i.e. by seeking a capacitated minimum spanning tree). The proposed heuristic scheme is evaluated over nine synthetic scenarios of increasing complexity, from where it is concluded that by sequentially applying grouping- and dandelion-encoded stochastic optimization techniques, capacity-compliant minimum spanning trees can be generated. These preliminary results pave the way for future research aimed at adapting the proposed heuristics to resource-constrained wireless communication scenarios (e.g. cognitive radio), as well as at evaluating alternative procedures not necessarily based on a sequential treatment of the aforementioned problems.
@inproceedings{landatorres2012preliminary,title={{A Preliminary Approach to Near-Optimal Multi-Hop Capacitated Network Design Using Grouping-Dandelion Encoded Heuristics}},author={Landa-Torres, Itziar and Manjarres, Diana and Gil-Lopez, Sergio and Del Ser, Javier and Salcedo-Sanz, Sancho},booktitle={IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)},year={2012},pages={85--89},doi={10.1109/camad.2012.6335385},}
IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
A Heuristically-Driven Multi-Criteria Tool for the Design of Efficient Open WiFi Access Networks
Diana Manjarres, Itziar Landa-Torres, Sergio Gil-Lopez, Javier Del Ser, and Sancho Salcedo-Sanz
In IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2012
This paper presents a novel heuristic multi-criteria tool capable of generating open-access wireless network deployments by exploiting the existing broadband infrastructure. Specifically, an external user dynamically selects, by virtue of our proposed scheme, a certain network layout depending on the target percentage of non-covered users and cost of the deployment. Network layouts differently balancing the trade-off between these two conflicting objectives are produced by two multi-objective heuristics based on genetic algorithm and harmony search, which are compared to each other through a number of Monte Carlo simulations. In light of the obtained results we conclude that the multi-objective harmony search scheme outperforms its genetically-inspired counterpart in terms of multi-objective quality metrics (hypervolume, epsilon indicator and R-metric). Therefore this tool, further improved by means of ad-hoc designed local search operators, is shown to embody an computationally efficient framework supporting operators in their open access network planning design processes.
@inproceedings{manjarres2012heuristicallydriven,title={{A Heuristically-Driven Multi-Criteria Tool for the Design of Efficient Open WiFi Access Networks}},author={Manjarres, Diana and Landa-Torres, Itziar and Gil-Lopez, Sergio and Del Ser, Javier and Salcedo-Sanz, Sancho},booktitle={IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)},year={2012},pages={80--84},doi={10.1109/camad.2012.6335384},}
2011
Engineering Applications of Artificial Intelligence
Iterative Power and Subcarrier Allocation in Rate-Constrained Orthogonal Multi-Carrier Downlink Systems Based on Hybrid Harmony Search Heuristics
Javier Del Ser, M. N. Bilbao, S. Gil-López, M. Matinmikko, and S. Salcedo-Sanz
Engineering Applications of Artificial Intelligence, 2011
@article{delser2011iterativeb,title={{Iterative Power and Subcarrier Allocation in Rate-Constrained Orthogonal Multi-Carrier Downlink Systems Based on Hybrid Harmony Search Heuristics}},author={Del Ser, Javier and Bilbao, M. N. and Gil-López, S. and Matinmikko, M. and Salcedo-Sanz, S.},journal={Engineering Applications of Artificial Intelligence},volume={24},number={5},pages={748--756},year={2011},doi={10.1016/j.engappai.2011.02.005},}
XXVI Simposio de la Unión Científica Internacional de Radio
Algoritmo de Detección y Decodificación Turbo Bio-Inspirado para Escenarios CDMA de Secuencia Directa
Esther Achalandabaso-Ayerbe, Sergio Gil-Lopez, Javier Del Ser, Gorka Prieto, and Naiara Errondosoro
In XXVI Simposio de la Unión Científica Internacional de Radio, 2011
@inproceedings{achalandabasoayerbe2011algoritmo,title={{Algoritmo de Detección y Decodificación Turbo Bio-Inspirado para Escenarios CDMA de Secuencia Directa}},author={Achalandabaso-Ayerbe, Esther and Gil-Lopez, Sergio and Del Ser, Javier and Prieto, Gorka and Errondosoro, Naiara},booktitle={XXVI Simposio de la Unión Científica Internacional de Radio},year={2011},}
International ITG Workshop on Smart Antennas (WSA)
Resource Allocation in Rate-Limited OFDMA Systems: A Hybrid Heuristic Approach
Javier Del Ser, Miren Nekane Bilbao, Sergio Gil-Lopez, Marja Matinmikko, and Sancho Salcedo-Sanz
In International ITG Workshop on Smart Antennas (WSA), 2011
This paper presents a novel resource allocation procedure for OFDMA downlinks, which stems from an hybridization of the Harmony Search and the Differential Evolution heuristic algorithms. In this setup it is known that optimum subcarrier and power allocation is achieved through 1) assigning each subcarrier to the user with highest channel gain at the given frequency, and 2) a Water-Filling procedure over the set of considered channel gains. This work addresses the scenario where stringent rate constraints are imposed for each user at the transmitter, scenario where the previous optimum resource allocation procedure no longer holds. The proposed iterative technique hinges on the aforementioned combinatorial heuristics, jointly with an iterative greedy subcarrier shifting procedure that accounts for the fulfillment of the established rate restrictions. Preliminary simulation results are provided for the extended vehicular ITU channel model, which shed light on the performance of the proposed allocation procedure.
@inproceedings{delser2011resource,title={{Resource Allocation in Rate-Limited OFDMA Systems: A Hybrid Heuristic Approach}},author={Del Ser, Javier and Bilbao, Miren Nekane and Gil-Lopez, Sergio and Matinmikko, Marja and Salcedo-Sanz, Sancho},booktitle={International ITG Workshop on Smart Antennas (WSA)},year={2011},pages={1--5},doi={10.1109/wsa.2011.5741947},}
Polyphase codes are widely used in radar systems as a pulse compression approach due to the fact that they produce lower side-lobes in the compressed signal than other methods. Unfortunately, the efficient design of such codes comprises by itself a non-linear n-dimensional NP-hard optimization problem, which has been so far tackled by using evolutionary techniques. In this paper we present a novel heuristic approach consisting of a Harmony Search algorithm hybridized with both a dynamic-step gradient-guided and a random walk local search procedures. The second procedure is applied when the gradient of the underlying fitness function is zero, i.e. when facing a flat region during the search process over the solution space. A simulation-based comparison study with the best results found in the literature is presented, from where it is concluded that our proposed algorithm outperforms other existing approaches in the literature for n=1,...,15.
@inproceedings{gillopez2011application,title={{On the Application of a Novel Hybrid Harmony Search Algorithm to the Radar Polyphase Code Design Problem}},author={Gil-Lopez, Sergio and Del Ser, Javier and Perez-Bellido, Angel and Salcedo-Sanz, Sancho and Portilla-Figueras, Jose A.},booktitle={IEEE 73rd Vehicular Technology Conference (VTC Spring)},year={2011},pages={1--5},doi={10.1109/vetecs.2011.5956286},}
International Work-Conference on Artificial Neural Networks (IWANN’11)
A Novel Grouping Heuristic Algorithm for the Switch Location Problem Based on a Hybrid Dual Harmony Search Technique
Sergio Gil-Lopez, Itziar Landa-Torres, Javier Del Ser, Sancho Salcedo-Sanz, Diana Manjarres, and Jose A. Portilla-Figueras
In International Work-Conference on Artificial Neural Networks (IWANN’11), 2011
@inproceedings{gillopez2011novel,title={{A Novel Grouping Heuristic Algorithm for the Switch Location Problem Based on a Hybrid Dual Harmony Search Technique}},author={Gil-Lopez, Sergio and Landa-Torres, Itziar and Del Ser, Javier and Salcedo-Sanz, Sancho and Manjarres, Diana and Portilla-Figueras, Jose A.},booktitle={International Work-Conference on Artificial Neural Networks (IWANN'11)},series={Lecture Notes in Computer Science},year={2011},pages={17--24},doi={10.1007/978-3-642-21501-8_3},}
11th International Conference on Intelligent Systems Design and Applications (ISDA)
A Grouping Harmony Search Approach for the Citywide WiFi Deployment Problem
I. Landa-Torres, Sergio Gil-Lopez, Javier Del Ser, Sancho Salcedo-Sanz, Diana Manjarres, and José A. Portilla Figueras
In 11th International Conference on Intelligent Systems Design and Applications (ISDA), 2011
This paper presents a novel Grouping Harmony Search (GHS) algorithm for the Citywide Ubiquitous WiFi Network Design problem (WIFIDP). The WIFIDP is a NP-hard problem where private customers owning wireless access points connected to Internet share bandwidth with third parties. Aspects such as allocated budget and router capacities (coverage radius, capacity, price, etc) are taken into account in order to obtain the optimal network deployment (in terms of cost-effectiveness) when applying the GHS algorithm. The approach to tackle the aforementioned WIFIDP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Furthermore, the presented GHS algorithm is differential, since each proposed harmony is produced (improvised) based on the same harmony in the previous iteration. This differential scheme employs the grouping concept based on the connectivity between nomadic users and routers, which increases significantly its searching capability. Preliminary Monte Carlo simulations show that this proposed technique statistically outperforms genetically-inspired algorithms previously presented for the WIFIDP, with an emphasis in scenarios with stringent capacity and budget constraints. This first approach paves the way for future research aimed at applying the proposed algorithm to real scenarios.
@inproceedings{landatorres2011grouping,title={{A Grouping Harmony Search Approach for the Citywide WiFi Deployment Problem}},author={Landa-Torres, I. and Gil-Lopez, Sergio and Del Ser, Javier and Salcedo-Sanz, Sancho and Manjarres, Diana and Portilla Figueras, José A.},booktitle={11th International Conference on Intelligent Systems Design and Applications (ISDA)},year={2011},pages={1026--1031},doi={10.1109/isda.2011.6121793},}
11th International Conference on Intelligent Systems Design and Applications (ISDA)
On the Application of a Hybrid Harmony Search Algorithm to Node Localization in Anchor-Based Wireless Sensor Networks
Diana Manjarres, Javier Del Ser, Sergio Gil-Lopez, Massimo Vecchio, Itziar Landa-Torres, and Roberto Valcarce
In 11th International Conference on Intelligent Systems Design and Applications (ISDA), 2011
In many applications based on Wireless Sensor Networks (WSNs) with static sensor nodes, the availability of accurate location information of the network nodes may become essential. The node localization problem is to estimate all the unknown node positions, based on noisy pairwise distance measurements of nodes within range of each other. Maximum Likelihood (ML) estimation results in a non-convex problem, which is further complicated by the fact that sufficient conditions for the solution to be unique are not easily identified, especially when dealing with sparse networks. Thereby, different node configurations can provide equally good fitness results, with only one of them corresponding to the real network geometry. This paper presents a novel soft-computing localization technique based on hybridizing a Harmony Search (HS) algorithm with a local search procedure whose aim is to identify the localizability issues and mitigate its effects during the iterative process. Moreover, certain connectivity-based geometrical constraints are exploited to further reduce the areas where each sensor node can be located. Simulation results show that our approach outperforms a previously proposed meta-heuristic localization scheme based on the Simulated Annealing (SA) algorithm, in terms of both localization error and computational cost.
@inproceedings{manjarres2011application,title={{On the Application of a Hybrid Harmony Search Algorithm to Node Localization in Anchor-Based Wireless Sensor Networks}},author={Manjarres, Diana and Del Ser, Javier and Gil-Lopez, Sergio and Vecchio, Massimo and Landa-Torres, Itziar and Valcarce, Roberto},booktitle={11th International Conference on Intelligent Systems Design and Applications (ISDA)},year={2011},pages={1014--1019},doi={10.1109/isda.2011.6121791},}
2010
7th International Symposium on Wireless Communication Systems (ISWCS)
A Novel Harmony Search Based Spectrum Allocation Technique for Cognitive Radio Networks
Javier Del Ser, Marja Matinmikko, Sergio Gil-Lopez, and Miia Mustonen
In 7th International Symposium on Wireless Communication Systems (ISWCS), 2010
This paper outlines the application of the heuristic Harmony Search (HS) algorithm for efficient spectrum allocation in cognitive radio networks under a minimum Bit Error Rate (BER) criterion. Our proposed algorithm provides a higher degree of diversity in the search process by virtue of its particular improvisation procedure, as opposed to evolutionary computation techniques used so far for this optimization problem. In our work both centralized and distributed implementations of our approach are proposed and detailed. The first set of simulation results made for one single HS instance running over a fixed network show, on one hand, that our approach achieves near-optimum spectral channel assignments at a very low computational complexity. On the other hand, satisfactory results obtained for a distributed implementation of our algorithm pave the way for future research aimed at comparing our approach with avantgarde genetically-inspired spectrum allocation techniques.
@inproceedings{delser2010novel,title={{A Novel Harmony Search Based Spectrum Allocation Technique for Cognitive Radio Networks}},author={Del Ser, Javier and Matinmikko, Marja and Gil-Lopez, Sergio and Mustonen, Miia},booktitle={7th International Symposium on Wireless Communication Systems (ISWCS)},year={2010},pages={233--237},doi={10.1109/iswcs.2010.5624341},}
XXV Simposium Nacional de la Unión Científica Internacional de Radio
Optimización de Parámetros y Criterios de Salida de Algoritmos Genéticos para Detección CDMA
Laura Garcia-Padrones, Sergio Gil-Lopez, Javier Del Ser, and Gorka Prieto
In XXV Simposium Nacional de la Unión Científica Internacional de Radio, 2010
@inproceedings{garciapadrones2010optimizacion,title={{Optimización de Parámetros y Criterios de Salida de Algoritmos Genéticos para Detección CDMA}},author={Garcia-Padrones, Laura and Gil-Lopez, Sergio and Del Ser, Javier and Prieto, Gorka},booktitle={XXV Simposium Nacional de la Unión Científica Internacional de Radio},year={2010},}
2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT)
On the Application of a Novel Grouping Harmony Search Algorithm to the Switch Location Problem
Sergio Gil-Lopez, Javier Del Ser, Itziar Landa-Torres, Laura Garcia-Padrones, Sancho Salcedo-Sanz, and Jose A. Portilla-Figueras
In 2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT), 2010
@inproceedings{gillopez2010application,title={{On the Application of a Novel Grouping Harmony Search Algorithm to the Switch Location Problem}},author={Gil-Lopez, Sergio and Del Ser, Javier and Landa-Torres, Itziar and Garcia-Padrones, Laura and Salcedo-Sanz, Sancho and Portilla-Figueras, Jose A.},booktitle={2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT)},series={Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},year={2010},pages={662--672},doi={10.1007/978-3-642-16644-0_57},}
2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT)
Harmony Search Heuristics for Quasi-Asynchronous CDMA Detection with M-PAM Signaling
Sergio Gil-Lopez, Javier Del Ser, and Laura Garcia-Padrones
In 2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT), 2010
@inproceedings{gillopez2010harmony,title={{Harmony Search Heuristics for Quasi-Asynchronous CDMA Detection with M-PAM Signaling}},author={Gil-Lopez, Sergio and Del Ser, Javier and Garcia-Padrones, Laura},booktitle={2nd International Conference on Mobile Lightweight Wireless Systems (MOBILIGHT)},series={Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},year={2010},pages={626--637},doi={10.1007/978-3-642-16644-0_54},}
2009
International Conference on Ultra-Modern Telecommunications & Workshops (ICUMT)
A Novel Heuristic Algorithm for Multiuser Detection in Synchronous CDMA Wireless Sensor Networks
Sergio Gil-Lopez, Javier Del Ser, and Ignacio Olabarrieta
In International Conference on Ultra-Modern Telecommunications & Workshops (ICUMT), 2009
This paper introduces a novel heuristic algorithm for N-user detection in synchronous CDMA multiple access networks. In such systems, the performance of the conventional single-user detection technique (i.e. a rake receiver compounded by a set of matched filters) is clearly bounded by the well-known multiple access interference (MAI). To avoid this limitation, the optimum maximum likelihood (ML) detection scheme seeks the best solution by performing an exhaustive search over the entire set of N-dimensional information vectors, which entails a computational complexity exponentially increasing with the number of nodes N. The heuristic procedure presented in this manuscript provides a set of near-optimum candidate vectors at a dramatically lower computational complexity. Intensive computer simulations show that our heuristic proposal outperforms the conventional single-user rake receiver, while getting close to the optimum albeit complex ML detector.
@inproceedings{gillopez2009novel,title={{A Novel Heuristic Algorithm for Multiuser Detection in Synchronous CDMA Wireless Sensor Networks}},author={Gil-Lopez, Sergio and Del Ser, Javier and Olabarrieta, Ignacio},booktitle={International Conference on Ultra-Modern Telecommunications & Workshops (ICUMT)},year={2009},pages={1--6},doi={10.1109/icumt.2009.5345659},}