COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary
Multitasking
- URL: http://arxiv.org/abs/2003.11628v1
- Date: Tue, 24 Mar 2020 13:37:43 GMT
- Title: COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary
Multitasking
- Authors: Eneko Osaba, Javier Del Ser, Xin-She Yang, Andres Iglesias and Akemi
Galvez
- Abstract summary: We propose a novel algorithmic scheme for dealing with multitasking environments.
The proposed approach, coined as Coevolutionary Bat Algorithm, finds its inspiration in concepts from both co-evolutionary strategies and the metaheuristic Bat Algorithm.
- Score: 9.54239662772307
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Multitasking optimization is an emerging research field which has attracted
lot of attention in the scientific community. The main purpose of this paradigm
is how to solve multiple optimization problems or tasks simultaneously by
conducting a single search process. The main catalyst for reaching this
objective is to exploit possible synergies and complementarities among the
tasks to be optimized, helping each other by virtue of the transfer of
knowledge among them (thereby being referred to as Transfer Optimization). In
this context, Evolutionary Multitasking addresses Transfer Optimization
problems by resorting to concepts from Evolutionary Computation for
simultaneous solving the tasks at hand. This work contributes to this trend by
proposing a novel algorithmic scheme for dealing with multitasking
environments. The proposed approach, coined as Coevolutionary Bat Algorithm,
finds its inspiration in concepts from both co-evolutionary strategies and the
metaheuristic Bat Algorithm. We compare the performance of our proposed method
with that of its Multifactorial Evolutionary Algorithm counterpart over 15
different multitasking setups, composed by eight reference instances of the
discrete Traveling Salesman Problem. The experimentation and results stemming
therefrom support the main hypothesis of this study: the proposed
Coevolutionary Bat Algorithm is a promising meta-heuristic for solving
Evolutionary Multitasking scenarios.
Related papers
- On the Convergence of Distributed Stochastic Bilevel Optimization
Algorithms over a Network [55.56019538079826]
Bilevel optimization has been applied to a wide variety of machine learning models.
Most existing algorithms restrict their single-machine setting so that they are incapable of handling distributed data.
We develop novel decentralized bilevel optimization algorithms based on a gradient tracking communication mechanism and two different gradients.
arXiv Detail & Related papers (2022-06-30T05:29:52Z) - In Defense of the Unitary Scalarization for Deep Multi-Task Learning [121.76421174107463]
We present a theoretical analysis suggesting that many specialized multi-tasks can be interpreted as forms of regularization.
We show that, when coupled with standard regularization and stabilization techniques, unitary scalarization matches or improves upon the performance of complex multitasks.
arXiv Detail & Related papers (2022-01-11T18:44:17Z) - A Two-stage Framework and Reinforcement Learning-based Optimization
Algorithms for Complex Scheduling Problems [54.61091936472494]
We develop a two-stage framework, in which reinforcement learning (RL) and traditional operations research (OR) algorithms are combined together.
The scheduling problem is solved in two stages, including a finite Markov decision process (MDP) and a mixed-integer programming process, respectively.
Results show that the proposed algorithms could stably and efficiently obtain satisfactory scheduling schemes for agile Earth observation satellite scheduling problems.
arXiv Detail & Related papers (2021-03-10T03:16:12Z) - Evolutionary Multitask Optimization: a Methodological Overview,
Challenges and Future Research Directions [8.14509634354919]
We consider multitasking in the context of solving multiple optimization problems simultaneously by conducting a single search process.
The emerging paradigm of Evolutionary Multitasking tackles multitask optimization scenarios by using as inspiration concepts drawn from Evolutionary Computation.
arXiv Detail & Related papers (2021-02-04T11:48:11Z) - Multi-task Supervised Learning via Cross-learning [102.64082402388192]
We consider a problem known as multi-task learning, consisting of fitting a set of regression functions intended for solving different tasks.
In our novel formulation, we couple the parameters of these functions, so that they learn in their task specific domains while staying close to each other.
This facilitates cross-fertilization in which data collected across different domains help improving the learning performance at each other task.
arXiv Detail & Related papers (2020-10-24T21:35:57Z) - A Coevolutionary Variable Neighborhood Search Algorithm for Discrete
Multitasking (CoVNS): Application to Community Detection over Graphs [8.525387045951776]
This paper is focused on Evolutionary Multitasking, which is a perspective for dealing with multitasking optimization scenarios.
We present a new multitasking approach named as Coevolutionary Variable Neighborhood Search Algorithm, which finds its inspiration on both the Variable Neighborhood Search metaheuristic and coevolutionary strategies.
Results obtained by our method are compared to those issued by a parallel Variable Neighborhood Search and independent executions of the basic Variable Neighborhood Search.
arXiv Detail & Related papers (2020-09-30T07:26:43Z) - Small Towers Make Big Differences [59.243296878666285]
Multi-task learning aims at solving multiple machine learning tasks at the same time.
A good solution to a multi-task learning problem should be generalizable in addition to being Pareto optimal.
We propose a method of under- parameterized self-auxiliaries for multi-task models to achieve the best of both worlds.
arXiv Detail & Related papers (2020-08-13T10:45:31Z) - On the Transferability of Knowledge among Vehicle Routing Problems by
using Cellular Evolutionary Multitasking [6.943742860591444]
This work is focused on the application of the recently proposed Multifactorial Cellular Genetic Algorithm (MFCGA) to the Capacitated Vehicle Routing Problem (CVRP)
The contribution of this research is twofold. On the one hand, it is the first application of the MFCGA to the Vehicle Routing Problem family of problems. On the other hand, equally interesting is the second contribution, which is focused on the quantitative analysis of the positive genetic transferability among the problem instances.
arXiv Detail & Related papers (2020-05-11T12:58:00Z) - dMFEA-II: An Adaptive Multifactorial Evolutionary Algorithm for
Permutation-based Discrete Optimization Problems [6.943742860591444]
We propose the first adaptation of the recently introduced Multifactorial Evolutionary Algorithm II (MFEA-II) to permutation-based discrete environments.
The performance of the proposed solver has been assessed over 5 different multitasking setups.
arXiv Detail & Related papers (2020-04-14T14:42:47Z) - Multifactorial Cellular Genetic Algorithm (MFCGA): Algorithmic Design,
Performance Comparison and Genetic Transferability Analysis [17.120962133525225]
Multiobjective optimization is an incipient research area which is lately gaining a notable research momentum.
In this work we propose a novel algorithmic scheme for Multifactorial Optimization scenarios.
The proposed MFCGA hinges on concepts from Cellular Automata to implement mechanisms for exchanging knowledge among problems.
arXiv Detail & Related papers (2020-03-24T11:03:55Z) - Pareto Multi-Task Learning [53.90732663046125]
Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously.
It is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other.
Recently, a novel method is proposed to find one single Pareto optimal solution with good trade-off among different tasks by casting multi-task learning as multiobjective optimization.
arXiv Detail & Related papers (2019-12-30T08:58:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.