Fixed Set Search Applied to the Maximum Disjoint Dominating Sets Problem

Raka Jovanovic, Stefan Voss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper the fixed set search (FSS), a population-based metaheuristic, is applied to the Maximum Disjoint Dominating Sets Problem (MDDSP). Initially, a greedy randomized adaptive search procedure (GRASP) is developed to solve the MDDSP. Subsequently, the FSS enhances GRASP by incorporating a learning mechanism that identifies common elements in high-quality solutions. Computational experiments show that the proposed method significantly outperforms current state-of-the-art methods.
Original languageEnglish
Title of host publicationMetaheuristics, Mic 2024, Pt Ii
EditorsM Sevaux, AL Olteanu, EG Pardo, A Sifaleras, S Makboul, Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo, Angelo Sifaleras, Salma Makboul
PublisherSpringer Nature
Pages347-353
Number of pages7
Volume14754
ISBN (Electronic)978-3-031-62922-8
ISBN (Print)978-3-031-62921-1, 9783031629211
DOIs
Publication statusPublished - 18 Jun 2024
Event15th International Conference of the Metaheuristics International Conference (MIC) - Lorient, France
Duration: 4 Jun 20247 Jun 2024

Publication series

NameLecture Notes In Computer Science

Conference

Conference15th International Conference of the Metaheuristics International Conference (MIC)
Country/TerritoryFrance
CityLorient
Period4/06/247/06/24

Keywords

  • Dominating Set
  • Fixed Set Search
  • Metaheuristic

Fingerprint

Dive into the research topics of 'Fixed Set Search Applied to the Maximum Disjoint Dominating Sets Problem'. Together they form a unique fingerprint.

Cite this