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