4.7 Article

Iterated hyperplane search for the budgeted maximum coverage problem

Journal

EXPERT SYSTEMS WITH APPLICATIONS
Volume 214, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2022.119078

Keywords

Budgeted maximum coverage; Knapsack; Heuristics; Iterated local search; Hyperplane search

Ask authors/readers for more resources

This paper presents an iterated hyperplane search approach for the budgeted maximum coverage problem. The algorithm searches on specific areas identified by cardinality-constrained hyperplanes. It combines three procedures - tabu search, hyperplane search, and perturbation - to ensure diversification of the search. The competitiveness of the algorithm is demonstrated on 30 benchmark instances.
We present an iterated hyperplane search approach for the budgeted maximum coverage problem. Our algorithm relies on the idea of searching on specific areas identified by cardinality-constrained hyperplanes. It combines three complementary procedures: a tabu search procedure to identify a promising hyperplane, a hyperplane search procedure to examine candidate solutions on cardinality-constrained hyperplanes and a dedicated perturbation procedure to ensure the diversification of the search. We show the competitiveness of the algorithm on 30 benchmark instances and present experiments to study the key components of the algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available