Lorenzo Moreschini
Research Interests
Lorenzo Moreschini has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Renata Mansini
Department of Information Engineering, University of Brescia, 25123 Brescia, Italy
3 shared publications - Domenico Serra
Department of Mathematics University of Salerno Fisciano Salerno Italy
2 shared publications Francesco Carrabs
1 shared publication- Francesco Carrabs
Department of Mathematics University of Salerno Fisciano Italy
1 shared publication - Mesut Sayin
Ozyegin University
1 shared publication Raffaele Cerulli
1 shared publication
Latest Publications
- Open Access
Optimizing election logistics: A multi-period routing problem embedding time-dependent reward functions
- Open Access
- 13 March 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 166
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP
- 13 March 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 166
Open AccessSolving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP
- Open Access
- 7 January 2023
- Published by Elsevier in SSRN Electronic Journal
Solving the Set Covering Problem with Conflicts on Sets: A New Parallel Grasp
In this paper, we analyze a new variant of the well-known NP-hard Set Covering Problem characterized by pairwise conflicts among subsets of items. Two subsets in conflict can belong to the same solution provided that a positive penalty is paid. The problem looks for the optimal collection of subsets representing a cover and minimizing the sum of covering and penalty costs. We introduce two mathematical formulations for the problem and provide a parallel GRASP (Greedy Randomized Adaptive Search Procedure) algorithm for its solution. To evaluate the performance of our algorithm, we conduct extensive experiments on a large set of new instances obtained by adapting existing instances for the Set Covering Problem. Computational results show that the proposed approach is extremely effective and efficient providing better results than Gurobi (tackling two alternative mathematical formulations of the problem) in less than 1/6 of the computational time.
- 7 January 2023
- Published by Elsevier in SSRN Electronic Journal
Open AccessSolving the Set Covering Problem with Conflicts on Sets: A New Parallel Grasp
In this paper, we analyze a new variant of the well-known NP-hard Set Covering Problem characterized by pairwise conflicts among subsets of items. Two subsets in conflict can belong to the same solution provided that a positive penalty is paid. The problem looks for the optimal collection of subsets representing a cover and minimizing the sum of covering and penalty costs. We introduce two mathematical formulations for the problem and provide a parallel GRASP (Greedy Randomized Adaptive Search Procedure) algorithm for its solution. To evaluate the performance of our algorithm, we conduct extensive experiments on a large set of new instances obtained by adapting existing instances for the Set Covering Problem. Computational results show that the proposed approach is extremely effective and efficient providing better results than Gurobi (tackling two alternative mathematical formulations of the problem) in less than 1/6 of the computational time.