☆ 4.7 Article

Efficient iterated greedy for the two-dimensional bandwidth minimization problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

A general variable neighborhood search for the cyclic antibandwidth problem

Sergio Cavero et al.

Summary: This paper addresses the Cyclic Antibandwidth Problem and proposes a General Variable Neighborhood Search method. The method combines efficient Variable Neighborhood Descent with a novel destruction-reconstruction shaking procedure, and takes advantage of two new exploration strategies and two new neighborhood reduction strategies. The experimental results demonstrate that the introduced algorithm performs the best on instances with unknown optimal solutions.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A variable neighborhood search approach for cyclic bandwidth sum problem

Sergio Cavero et al.

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)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Multistart search for the Cyclic Cutwidth Minimization Problem

Sergio Cavero et al.

Summary: In this paper, a new lower bound and a property for reducing neighborhood size during the search process in the Cyclic Cutwidth Minimization Problem (CCMP) are identified. The use of an alternative objective function for min-max optimization problems in the context of CCMP is proposed for the first time. The proposed method is compared with existing state of the art techniques for CCMP and statistical tests indicate its superiority.

COMPUTERS & OPERATIONS RESEARCH (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

A fast variable neighborhood search approach for multi-objective community detection

Sergio Perez-Pelo et al.

Summary: Community detection in social networks is a key task in social network analysis, helping analyze groups of users with similar interests. This paper proposes a metaheuristic approach based on VNS, combining quality and diversity for detecting communities in social networks. The results outperform the state-of-the-art method in terms of quality and computing time.

APPLIED SOFT COMPUTING (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Two-dimensional bandwidth minimization problem: Exact and heuristic approaches

Miguel Angel Rodriguez-Garcia et al.

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)

Add to Collection

Article Computer Science, Artificial Intelligence

Basic variable neighborhood search for the minimum sitting arrangement problem

Eduardo G. Pardo et al.

JOURNAL OF HEURISTICS (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

A new iterated local search algorithm for the cyclic bandwidth problem

Jintong Ren et al.

KNOWLEDGE-BASED SYSTEMS (2020)

Add to Collection

Article Computer Science, Interdisciplinary Applications

GRASP and VNS for solving the p-next center problem

A. D. Lopez-Sanchez et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

Add to Collection

Article Computer Science, Information Systems

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

Jintong Ren et al.

IEEE ACCESS (2019)

Add to Collection

Article Computer Science, Information Systems

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

Eduardo Rodriguez-Tello et al.

IEEE ACCESS (2019)

Add to Collection

Article Management

An iterated greedy heuristic for a market segmentation problem with multiple attributes

Diana L. Huerta-Munoz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Add to Collection

Article Operations Research & Management Science

Variable neighborhood search: basics and variants

Pierre Hansen et al.

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2017)

Add to Collection

Article Computer Science, Artificial Intelligence

Variable Formulation Search for the Cutwidth Minimization Problem

Eduardo G. ' Pardo et al.

APPLIED SOFT COMPUTING (2013)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Branch and bound for the cutwidth minimization problem

Rafael Marti et al.

COMPUTERS & OPERATIONS RESEARCH (2013)

Add to Collection

Article Computer Science, Theory & Methods

SQUARE-ROOT RULE OF TWO-DIMENSIONAL BANDWIDTH PROBLEM

Lan Lin et al.

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS (2011)

Add to Collection

Article Management

Variable neighbourhood search for bandwidth reduction

Nenad Mladenovic et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

Add to Collection

Article Computer Science, Information Systems

Two models of two-dimensional bandwidth problems

Lan Lin et al.

INFORMATION PROCESSING LETTERS (2010)

Add to Collection

Article Computer Science, Interdisciplinary Applications

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Eduardo Rodriguez-Tello et al.

COMPUTERS & OPERATIONS RESEARCH (2008)

Add to Collection

Article Management

An improved simulated annealing algorithm for bandwidth minimization

Eduardo Rodriguez-Tello et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)

Add to Collection

Article Management

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Ruben Ruiz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Add to Collection

Article Mathematics, Applied

First vs. best improvement: An empirical study

P Hansen et al.

DISCRETE APPLIED MATHEMATICS (2006)

Add to Collection

Review Computer Science, Theory & Methods

A survey of graph layout problems

J Díaz et al.

ACM COMPUTING SURVEYS (2002)

Add to Collection

Article Engineering, Industrial

Tabu search based heuristics for multi-floor facility layout

S Abdinnour-Helm et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2000)

Add to Collection

© Peeref 2019-2024. All rights reserved.