4.3 Article Proceedings Paper

Migration policies in dynamic island models

期刊

NATURAL COMPUTING
卷 18, 期 1, 页码 163-179

出版社

SPRINGER
DOI: 10.1007/s11047-017-9660-z

关键词

Adaptive operator selection; Adaptive evolutionary algorithms; Dynamic island model; Island models; Migration policies

向作者/读者索取更多资源

Dynamic island models are population-based algorithms for solving optimization problems, where the individuals of the population are distributed on islands. These subpopulations of individuals are processed by search algorithms on each island. In order to share information within this distributed search process, the individuals migrate from their initial island to another destination island at regular steps. In dynamic island models, the migration process evolves during the search according to the observed performance on the different islands. The purpose of this dynamic/adaptive management of the migrations is to send the individuals to the most promising islands, with regards to their current states. Therefore, our approach is related to the adaptive management of search operators in evolutionary algorithms. In this work, our main purpose is thus to precisely analyze dynamic migration policies. We propose a testing process that assigns gains to the algorithms applied on the islands in order to assess the adaptive ability of the migration policies, with regards to various scenarios. Instead of having one dynamic migration policy that is applied to the whole search process, as it has already been studied, we propose to associate a migration policy to each individual, which allows us to combine simultaneously different migration policies.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

Migration policies in dynamic island models

Frederic Lardeux, Jorge Maturana, Eduardo Rodriguez-Tello, Frederic Saubion

NATURAL COMPUTING (2019)

Article Computer Science, Artificial Intelligence

Solving complex problems using model transformations: from set constraint modeling to SAT instance solving

Frederic Lardeux, Eric Monfroy, Eduardo Rodriguez-Tello, Broderick Crawford, Ricardo Soto

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

A new iterated local search algorithm for the cyclic bandwidth problem

Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello, Liwen Li, Kun He

KNOWLEDGE-BASED SYSTEMS (2020)

Article Mathematics

A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems

Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Cesar Carrasco, Eduardo Rodriguez-Tello, Carlos Castro, Fernando Paredes, Hanns de la Fuente-mella

MATHEMATICS (2020)

Article Computer Science, Artificial Intelligence

Two-dimensional bandwidth minimization problem: Exact and heuristic approaches

Miguel Angel Rodriguez-Garcia, Jesus Sanchez-Oro, Eduardo Rodriguez-Tello, Eric Monfroy, Abraham Duarte

Summary: The research focuses on the bandwidth optimization problem of embedding a graph in a two-dimensional grid, with CSP models showing remarkable performance in small to medium instances, while BVNS is capable of achieving equivalent or similar results in short run-time for small instances.

KNOWLEDGE-BASED SYSTEMS (2021)

Article Computer Science, Artificial Intelligence

A variable neighborhood search approach for cyclic bandwidth sum problem

Sergio Cavero, Eduardo G. Pardo, Abraham Duarte, Eduardo Rodriguez-Tello

Summary: In this paper, the authors tackle the Cyclic Bandwidth Sum Problem by proposing a multistart procedure that includes a new greedy constructive algorithm and an intensification strategy based on the Variable Neighborhood Search metaheuristic. The proposed algorithm is evaluated on previously studied instances as well as new instances, and the results show its effectiveness.

KNOWLEDGE-BASED SYSTEMS (2022)

Article Computer Science, Interdisciplinary Applications

Population-based iterated greedy algorithm for the S-labeling problem

Manuel Lozano, Eduardo Rodriguez-Tello

Summary: In this paper, a population-based iterated greedy algorithm is proposed to solve the S-labeling problem. In the construction phase, a novel greedy algorithm is used, while the destruction phase involves a strength that gradually decreases and a restart operator based on convergence detection. Experimental results demonstrate that the proposed algorithm achieves better solution quality compared to state-of-the-art optimizers and other competing algorithms for this problem.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Computer Science, Information Systems

Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem

Valentina Narvaez-Teran, Gabriela Ochoa, Eduardo Rodriguez-Tello

Summary: Search Trajectory Networks (STNs) are introduced as a tool for analyzing the behavior of metaheuristics in relation to their exploration ability, focusing on a specific combinatorial optimization problem. Two algorithms are analyzed using STNs for the cyclic bandwidth sum minimization problem, and a novel grouping method is proposed for both continuous and combinatorial spaces.

IEEE ACCESS (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Attributes for Understanding Groups of Binary Data

Arthur Chambon, Frederic Lardeux, Frederic Saubion, Tristan Boureau

PATTERN RECOGNITION APPLICATIONS AND METHODS (ICPRAM 2019) (2020)

Proceedings Paper Computer Science, Artificial Intelligence

A Study of Recombination Operators for the Cyclic Bandwidth Problem

Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello

ARTIFICIAL EVOLUTION, EA 2019 (2020)

Article Computer Science, Information Systems

An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem

Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello

IEEE ACCESS (2019)

Article Computer Science, Information Systems

Dynamic Multi-Armed Bandit Algorithm for the Cyclic Bandwidth Sum Problem

Eduardo Rodriguez-Tello, Valentina Narvaez-Teran, Frederic Lardeux

IEEE ACCESS (2019)

暂无数据