Probability learning based tabu search for the budgeted maximum coverage problem

•We are the first to address the NP-hard Budgeted Maximum Coverage Problem.•We propose an algorithm that combines reinforcement learning with local search.•We introduce the first set of benchmark instances for the problem.•The proposed algorithm outperforms the comparison algorithms and the CPLEX so...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications 2021-11, Vol.183, p.115310, Article 115310
Hauptverfasser:	Li, Liwen, Wei, Zequn, Hao, Jin-Kao, He, Kun
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Budgeted maximum coverage problem Budgets Combinatorial optimization Comparative studies Computer Science Genetic algorithms Learning-based optimization Machine learning Perturbation Tabu search
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!