Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Raka Jovanovic, Stefan Voß

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Fixed set search (FSS) is a novel metaheuristic adding a learning mechanism to enhanced greedy approaches. In this paper we use FSS for solving the Minimum Weighted Vertex Cover Problem (MWVCP). First we define a Greedy Randomized Adaptive Search Procedure (GRASP) by randomizing the standard greedy constructive algorithm and combine it with a local search. The used local search is based on a simple downhill procedure. It checks if substituting a single or a pair of elements from a solution with ones that need to be added to keep the solution a vertex cover decreases the value of the objective function. The performance of the GRASP algorithm is improved by extending it towards FSS. Computational experiments performed on standard test instances from literature show that the proposed FSS algorithm for the MWVCP is highly competitive with state-of-the-art methods. Further, it is shown that the FSS manages to significantly improve the GRASP algorithm it is based on.

Original languageEnglish
Title of host publicationAnalysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers
EditorsIlias Kotsireas, Panos Pardalos, Arsenis Tsokas, Konstantinos E. Parsopoulos, Dimitris Souravlias
PublisherSpringer
Pages490-504
Number of pages15
ISBN (Print)9783030340285
DOIs
Publication statusPublished - 1 Jan 2019
EventSpecial Event on Analysis of Experimental Algorithms, SEA² 2019 - Kalamata, Greece
Duration: 24 Jun 201929 Jun 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11544 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSpecial Event on Analysis of Experimental Algorithms, SEA² 2019
CountryGreece
CityKalamata
Period24/6/1929/6/19

    Fingerprint

Keywords

  • Fixed set search
  • GRASP
  • Metaheuristics
  • Minimum Weighted Vertex Cover Problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jovanovic, R., & Voß, S. (2019). Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. In I. Kotsireas, P. Pardalos, A. Tsokas, K. E. Parsopoulos, & D. Souravlias (Eds.), Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers (pp. 490-504). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11544 LNCS). Springer. https://doi.org/10.1007/978-3-030-34029-2_31