Domenico Serra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Domenico Serra has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Carmine Sorgente
Department of Mathematics University of Salerno Fisciano Italy
7 shared publications - Raffaele Cerulli
Department of Mathematics University of Salerno Fisciano Salerno Italy
7 shared publications - Francesco Carrabs
Department of Mathematics University of Salerno Fisciano Italy
3 shared publications - Renata Mansini
Department of Information Engineering, University of Brescia, 25123 Brescia, Italy
3 shared publications - Lorenzo Moreschini2 shared publications
- Ciriaco D'Ambrosio
University of Salerno
1 shared publication
Latest Publications
- Open Access
- 3 October 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 54 (1)
The set covering problem with over-coverage penalties
- 3 October 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 54 (1)
Open AccessThe set covering problem with over-coverage penalties
- 4 February 2026
- Published by Springer Nature in Operations Research Forum
- Vol. 7 (1) , 22
Kidney Exchanges with Desensitization and Orphans: A Matheuristic Approach
- 4 February 2026
- Published by Springer Nature in Operations Research Forum
- Vol. 7 (1) , 22
Kidney Exchanges with Desensitization and Orphans: A Matheuristic Approach
- Open Access
- 1 July 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (13-14) , 5041-5069
Leveraging artificial intelligence and optimization for agile AGV scheduling in an edge-to-cloud manufacturing framework
Optimizing the scheduling of Automated Guided Vehicles (AGVs) is a critical task in the context of smart manufacturing, particularly in Industry 4.0, where operational efficiency, sustainability, and adaptability are key drivers of innovation. This paper introduces an innovative scheduling model incorporating real-time AGV battery status as a key parameter, using a machine learning algorithm to predict energy consumption and optimize task allocation accordingly. The primary objective is to extend AGV battery life, reduce energy consumption, and contribute to environmental sustainability, all while maintaining high operational efficiency. In addition to the scheduling algorithm, we present a comprehensive application framework designed to integrate this optimization model into real-world factory environments. This architecture leverages cloud-edge computing to process real-time data from AGVs, enabling dynamic scheduling adjustments and seamless execution of tasks. The proposed approach has been experimentally validated, demonstrating improvements in energy efficiency when compared to a conventional AGV scheduling strategy. This result demonstrates the effectiveness of our solution in improving energy efficiency while maintaining high performance in AGV operations. By providing the necessary infrastructure for data input, processing, and output implementation, the framework ensures that the algorithm can be effectively deployed and scaled in industrial settings. This research offers a robust solution for AGV scheduling, balancing operational efficiency with sustainability.
- 1 July 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (13-14) , 5041-5069
Open AccessLeveraging artificial intelligence and optimization for agile AGV scheduling in an edge-to-cloud manufacturing framework
Optimizing the scheduling of Automated Guided Vehicles (AGVs) is a critical task in the context of smart manufacturing, particularly in Industry 4.0, where operational efficiency, sustainability, and adaptability are key drivers of innovation. This paper introduces an innovative scheduling model incorporating real-time AGV battery status as a key parameter, using a machine learning algorithm to predict energy consumption and optimize task allocation accordingly. The primary objective is to extend AGV battery life, reduce energy consumption, and contribute to environmental sustainability, all while maintaining high operational efficiency. In addition to the scheduling algorithm, we present a comprehensive application framework designed to integrate this optimization model into real-world factory environments. This architecture leverages cloud-edge computing to process real-time data from AGVs, enabling dynamic scheduling adjustments and seamless execution of tasks. The proposed approach has been experimentally validated, demonstrating improvements in energy efficiency when compared to a conventional AGV scheduling strategy. This result demonstrates the effectiveness of our solution in improving energy efficiency while maintaining high performance in AGV operations. By providing the necessary infrastructure for data input, processing, and output implementation, the framework ensures that the algorithm can be effectively deployed and scaled in industrial settings. This research offers a robust solution for AGV scheduling, balancing operational efficiency with sustainability.
- Open Access
- 13 February 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (2) , 414-435
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints
- 13 February 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (2) , 414-435
Open AccessHybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints
- Open Access
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the largest subset of edges to be preserved. The problem finds application in many fields, including computational biology, bioinformatics, and wireless sensor networks, and it is known to be ‐hard on general graphs. In this work, we formulate the problem as an integer linear program, and we devise a heuristic approach based on edge contraction operations. We test the proposed approaches on both artificial instances and benchmark biological networks.
Open AccessExact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the largest subset of edges to be preserved. The problem finds application in many fields, including computational biology, bioinformatics, and wireless sensor networks, and it is known to be ‐hard on general graphs. In this work, we formulate the problem as an integer linear program, and we devise a heuristic approach based on edge contraction operations. We test the proposed approaches on both artificial instances and benchmark biological networks.
- 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
- 10 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (2) , 230
The Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs. The earliest setting addressed in the literature aims to minimize the number of different media types, i.e., distinct labels, used in the network. Despite being extensively addressed, such a setting completely ignores edge costs. This led to the definition of more realistic versions, where budgets for the total cost, or the number of distinct labels allowed, were introduced. In this paper, we introduce and prove the NP-hardness of the Budgeted Labeled Minimum Spanning Tree problem, consisting in minimizing the cost of a spanning tree while satisfying specified budget constraints for each label type. This problem combines the challenges of cost efficiency and label diversity within a fixed budgetary framework, providing a more realistic and practical approach to network design. We provide three distinct mathematical programming formulations of the problem and design a Lagrangian approach to derive tighter lower bounds for the optimal solution of the problem. The performances of the proposed methods are assessed by conducting a series of computational experiments on a variety of randomly generated instances, which showed how the complexity of the problem increases as the size of the network, as well as the number of labels, increase and the budget restrictions are tightened.
- 10 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (2) , 230
Open AccessThe Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs. The earliest setting addressed in the literature aims to minimize the number of different media types, i.e., distinct labels, used in the network. Despite being extensively addressed, such a setting completely ignores edge costs. This led to the definition of more realistic versions, where budgets for the total cost, or the number of distinct labels allowed, were introduced. In this paper, we introduce and prove the NP-hardness of the Budgeted Labeled Minimum Spanning Tree problem, consisting in minimizing the cost of a spanning tree while satisfying specified budget constraints for each label type. This problem combines the challenges of cost efficiency and label diversity within a fixed budgetary framework, providing a more realistic and practical approach to network design. We provide three distinct mathematical programming formulations of the problem and design a Lagrangian approach to derive tighter lower bounds for the optimal solution of the problem. The performances of the proposed methods are assessed by conducting a series of computational experiments on a variety of randomly generated instances, which showed how the complexity of the problem increases as the size of the network, as well as the number of labels, increase and the budget restrictions are tightened.
- Open Access
- 28 April 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 311 (1) , 56-72
Mathematical programming formulations for the Collapsed k-Core Problem
- 28 April 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 311 (1) , 56-72
Open AccessMathematical programming formulations for the Collapsed k-Core Problem
A genetic approach for the 2‐edge‐connected minimum branch vertices problem
This article addresses the 2‐edge‐connected minimum branch vertices problem, a variant of the minimum branch vertices problem in which the spanning subgraph is required to be 2‐edge‐connected for survivability reasons. The problem has been recently introduced and finds application in optical networks design scenarios, where branch vertices are associated to switch devices that allow to split the entering light signals and send them to several adjacent vertices. An exact approach to the problem has been proposed in the literature. In this paper, we formally prove its NP‐completeness and propose a genetic algorithm, which exploits some literature‐provided procedures for efficiently checking and restoring solutions feasibility, and makes use of novel ad‐hoc designed operators aiming to improve their values, reducing the number of branch vertices. The computational tests show that, on the benchmark instances, the genetic algorithm very often finds the optimal solution. Moreover, in order to further investigate the effectiveness and the performance of our algorithm, we generated a new set of random instances where the optimal solution is known a priori.
A genetic approach for the 2‐edge‐connected minimum branch vertices problem
This article addresses the 2‐edge‐connected minimum branch vertices problem, a variant of the minimum branch vertices problem in which the spanning subgraph is required to be 2‐edge‐connected for survivability reasons. The problem has been recently introduced and finds application in optical networks design scenarios, where branch vertices are associated to switch devices that allow to split the entering light signals and send them to several adjacent vertices. An exact approach to the problem has been proposed in the literature. In this paper, we formally prove its NP‐completeness and propose a genetic algorithm, which exploits some literature‐provided procedures for efficiently checking and restoring solutions feasibility, and makes use of novel ad‐hoc designed operators aiming to improve their values, reducing the number of branch vertices. The computational tests show that, on the benchmark instances, the genetic algorithm very often finds the optimal solution. Moreover, in order to further investigate the effectiveness and the performance of our algorithm, we generated a new set of random instances where the optimal solution is known a priori.
- 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.