Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Raka Jovanovic, Stefan Voß

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

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

Vertex Cover
Greedy Randomized Adaptive Search Procedure
Local Search
Metaheuristics
Computational Experiments
Search Algorithm
Objective function
Decrease
Experiments

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

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. / Jovanovic, Raka; Voß, Stefan.

Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. ed. / Ilias Kotsireas; Panos Pardalos; Arsenis Tsokas; Konstantinos E. Parsopoulos; Dimitris Souravlias. Springer, 2019. p. 490-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11544 LNCS).

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

Jovanovic, R & Voß, S 2019, Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. in I Kotsireas, P Pardalos, A Tsokas, KE Parsopoulos & D Souravlias (eds), Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11544 LNCS, Springer, pp. 490-504, Special Event on Analysis of Experimental Algorithms, SEA² 2019, Kalamata, Greece, 24/6/19. https://doi.org/10.1007/978-3-030-34029-2_31
Jovanovic R, Voß S. Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. In Kotsireas I, Pardalos P, Tsokas A, Parsopoulos KE, Souravlias D, editors, Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. Springer. 2019. p. 490-504. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-34029-2_31
Jovanovic, Raka ; Voß, Stefan. / Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. editor / Ilias Kotsireas ; Panos Pardalos ; Arsenis Tsokas ; Konstantinos E. Parsopoulos ; Dimitris Souravlias. Springer, 2019. pp. 490-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0bd7fb5c051643238f58e2de9c91bd63,
title = "Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem",
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.",
keywords = "Fixed set search, GRASP, Metaheuristics, Minimum Weighted Vertex Cover Problem",
author = "Raka Jovanovic and Stefan Vo{\ss}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-34029-2_31",
language = "English",
isbn = "9783030340285",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "490--504",
editor = "Ilias Kotsireas and Panos Pardalos and Arsenis Tsokas and Parsopoulos, {Konstantinos E.} and Dimitris Souravlias",
booktitle = "Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers",

}

TY - GEN

T1 - Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

AU - Jovanovic, Raka

AU - Voß, Stefan

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Fixed set search

KW - GRASP

KW - Metaheuristics

KW - Minimum Weighted Vertex Cover Problem

UR - http://www.scopus.com/inward/record.url?scp=85076416635&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85076416635&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-34029-2_31

DO - 10.1007/978-3-030-34029-2_31

M3 - Conference contribution

AN - SCOPUS:85076416635

SN - 9783030340285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 490

EP - 504

BT - Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers

A2 - Kotsireas, Ilias

A2 - Pardalos, Panos

A2 - Tsokas, Arsenis

A2 - Parsopoulos, Konstantinos E.

A2 - Souravlias, Dimitris

PB - Springer

ER -