A metaheuristic algorithm for large maximum weight independent set problems

被引:0
|
作者
Dong, Yuanyuan [1 ]
Goldberg, Andrew V. [2 ]
Noe, Alexander [3 ]
Parotsidis, Nikos [4 ]
Resende, Mauricio G. C. [5 ,6 ]
Spaen, Quico [2 ]
机构
[1] Southern Methodist University, Dallas,TX, United States
[2] Amazon.com, East Palo Alto,CA, United States
[3] Amazon.com, Bellevue,WA, United States
[4] Google, Zurich, Switzerland
[5] Amazon.com, Seattle,WA, United States
[6] Industrial & Systems Engineering, University of Washington, Seattle,WA, United States
关键词
Consensus algorithm - Graph theory - Heuristic algorithms - Local search (optimization);
D O I
10.1002/net.22247
中图分类号
学科分类号
摘要
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 airsing in this 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 in the greedy randomized adaptive search framework. This algorithm, which we call 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 openly available code on public benchmark sets, including some large instances with hundreds of millions of vertices. Our algorithm is, in general, competitive and outperforms this openly available code on large vehicle routing instances. We hope that our results will lead to even better MWIS algorithms. © 2024 Wiley Periodicals LLC.
引用
收藏
页码:91 / 112
相关论文
共 50 条
  • [1] A METAHEURISTIC ALGORITHM FOR LARGE MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS
    Dong, Yuanyuan
    Goldberg, Andrew V.
    Noe, Alexander
    Parotsidis, Nikos
    Resende, Mauricio G.C.
    Spaen, Quico
    [J]. arXiv, 2022,
  • [2] A genetic algorithm for maximum independent set problems
    Liu, XZ
    Sakamoto, A
    Shimamoto, T
    [J]. INFORMATION INTELLIGENCE AND SYSTEMS, VOLS 1-4, 1996, : 1916 - 1921
  • [3] A Modified Genetic Algorithm for Maximum Independent Set Problems
    刘兴钊
    坂本明雄
    岛本隆
    [J]. Journal of Harbin Institute of Technology(New series), 1999, (02) : 5 - 10
  • [4] An algorithm for the maximum weight independent set problem on outerstring graphs
    Keil, J. Mark
    Mitchell, Joseph S. B.
    Pradhan, Dinabandhu
    Vatshelle, Martin
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2017, 60 : 19 - 25
  • [5] EFFICIENT ALGORITHMS FOR THE MAXIMUM WEIGHT CLIQUE AND MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS ON PERMUTATION GRAPHS
    CHANG, MS
    WANG, FH
    [J]. INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 293 - 295
  • [6] AN OPTIMAL TIME ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET IN A TREE
    CHEN, GH
    KUO, MT
    SHEU, JP
    [J]. BIT, 1988, 28 (02): : 353 - 356
  • [7] AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH
    GOLDSCHMIDT, O
    TAKVORIAN, A
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (10) : 1672 - 1674
  • [8] A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem
    Du, Peng
    Zhang, Yuan
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [9] Graphs Without Large Apples and the Maximum Weight Independent Set Problem
    Vadim V. Lozin
    Martin Milanič
    Christopher Purcell
    [J]. Graphs and Combinatorics, 2014, 30 : 395 - 410
  • [10] Graphs Without Large Apples and the Maximum Weight Independent Set Problem
    Lozin, Vadim V.
    Milanic, Martin
    Purcell, Christopher
    [J]. GRAPHS AND COMBINATORICS, 2014, 30 (02) : 395 - 410