License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2022.45
URN: urn:nbn:de:0030-drops-169839
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16983/
Dong, Yuanyuan ;
Goldberg, Andrew V. ;
Noe, Alexander ;
Parotsidis, Nikos ;
Resende, Mauricio G.C. ;
Spaen, Quico
A Local Search Algorithm for Large Maximum Weight Independent Set Problems
Abstract
Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs arising in the vehicle routing application are large, having hundreds of thousands of nodes and hundreds of millions of edges.
To solve instances of this size, we develop a new local search algorithm, which is a metaheuristic based on the greedy randomized adaptive search (GRASP) framework. This algorithm, named METAMIS, uses a wider range of simple local search operations than previously described in the literature. We introduce data structures that make these operations efficient. A new variant of path-relinking is introduced to escape local optima and so is a new alternating augmenting-path local search move that improves algorithm performance.
We compare an implementation of our algorithm with a state-of-the-art publicly available code on public benchmark sets, including some large instances. Our algorithm is, in general, competitive and outperforms this openly available code on large vehicle routing instances of the maximum weight independent set problem. We hope that our results will lead to even better maximum-weight independent set algorithms.
BibTeX - Entry
@InProceedings{dong_et_al:LIPIcs.ESA.2022.45,
author = {Dong, Yuanyuan and Goldberg, Andrew V. and Noe, Alexander and Parotsidis, Nikos and Resende, Mauricio G.C. and Spaen, Quico},
title = {{A Local Search Algorithm for Large Maximum Weight Independent Set Problems}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16983},
URN = {urn:nbn:de:0030-drops-169839},
doi = {10.4230/LIPIcs.ESA.2022.45},
annote = {Keywords: GRASP, local search, maximum-weight independent set, path-relinking, heuristic, metaheuristic}
}
Keywords: |
|
GRASP, local search, maximum-weight independent set, path-relinking, heuristic, metaheuristic |
Collection: |
|
30th Annual European Symposium on Algorithms (ESA 2022) |
Issue Date: |
|
2022 |
Date of publication: |
|
01.09.2022 |