Stefano Giordani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Stefano Giordani has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Massimiliano Caramia
Dipartimento di Ingegneria dell’Impresa, University of Rome Tor Vergata, Rome, Italy
21 shared publications - Marin Lujak
University Rey Juan Carlos
12 shared publications Lucio Bianco
8 shared publications- Paolo Dell’olmo
Universita di Roma “La Sapienza
8 shared publications - Giuseppe Confessore
Consiglio Nazionale delle Ricerche
6 shared publications Pasquale Carotenuto
6 shared publications
Latest Publications
- Open Access
- 3 May 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 192
On the concept of criticality on GPRs project network with variable activity durations
- 3 May 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 192
Open AccessOn the concept of criticality on GPRs project network with variable activity durations
- Open Access
- 27 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 416
A Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem
Planning petrol station replenishment is an important logistics activity for all the major oil companies. The studied Multi-Depot Periodic Petrol Station Replenishment problem derives from a real case in which the company must replenish a set of petrol stations from a set of depots, during a weekly planning horizon. The company must ensure refuelling according to available visiting patterns, which can be different from customer to customer. A visiting pattern predefines how many times (days) the replenishment occurs during a week and in which visiting days a certain amount of fuel must be delivered. To fulfill the weekly demand of each petrol station, one of the available replenishment plans must be selected among a given set of visiting patterns. The aim is to minimize the total distance travelled by the fleet of tank trucks during the entire planning horizon. A matheuristic approach is proposed, based on the cluster-first route-second paradigm, to solve it. The proposed approach is thoroughly tested on a set of realistic random instances. Finally, a weekly large real instance is considered with 194 petrol stations and two depots.
- 27 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 416
Open AccessA Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem
Planning petrol station replenishment is an important logistics activity for all the major oil companies. The studied Multi-Depot Periodic Petrol Station Replenishment problem derives from a real case in which the company must replenish a set of petrol stations from a set of depots, during a weekly planning horizon. The company must ensure refuelling according to available visiting patterns, which can be different from customer to customer. A visiting pattern predefines how many times (days) the replenishment occurs during a week and in which visiting days a certain amount of fuel must be delivered. To fulfill the weekly demand of each petrol station, one of the available replenishment plans must be selected among a given set of visiting patterns. The aim is to minimize the total distance travelled by the fleet of tank trucks during the entire planning horizon. A matheuristic approach is proposed, based on the cluster-first route-second paradigm, to solve it. The proposed approach is thoroughly tested on a set of realistic random instances. Finally, a weekly large real instance is considered with 194 petrol stations and two depots.
- Open Access
- 1 January 2024
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 21 (1) , 269-289
How to fairly and efficiently assign tasks in individually rational agents’ coalitions? Models and fairness measures
An individually rational agent will participate in a multiagent coalition if the participation, given available information and knowledge, brings a payoff that is at least as high as the one achieved by not participating. Since agents’ performance and skills may vary from task to task, the decisions about individual agent-task assignment will determine the overall performance of the coalition. Maximising the efficiency of the one-on-one assignment of tasks to agents corresponds to the conventional linear sum assignment problem, which considers efficiency as the sum of the costs or benefits of individual agent-task assignments obtained by the coalition as a whole. This approach may be unfair since it does not explicitly consider fairness and, thus, is unsuitable for individually rational agents’ coalitions. In this paper, we propose two new assignment models that balance efficiency and fairness in task assignment and study the utilitarian, egalitarian, and Nash social welfare for task assignment in individually rational agents’ coalitions. Since fairness is a relatively abstract term that can be difficult to quantify, we propose three new fairness measures based on equity and equality and use them to compare the newly proposed models. Through functional examples, we show that a reasonable trade-off between efficiency and fairness in task assignment is possible through the use of the proposed models.
- 1 January 2024
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 21 (1) , 269-289
Open AccessHow to fairly and efficiently assign tasks in individually rational agents’ coalitions? Models and fairness measures
An individually rational agent will participate in a multiagent coalition if the participation, given available information and knowledge, brings a payoff that is at least as high as the one achieved by not participating. Since agents’ performance and skills may vary from task to task, the decisions about individual agent-task assignment will determine the overall performance of the coalition. Maximising the efficiency of the one-on-one assignment of tasks to agents corresponds to the conventional linear sum assignment problem, which considers efficiency as the sum of the costs or benefits of individual agent-task assignments obtained by the coalition as a whole. This approach may be unfair since it does not explicitly consider fairness and, thus, is unsuitable for individually rational agents’ coalitions. In this paper, we propose two new assignment models that balance efficiency and fairness in task assignment and study the utilitarian, egalitarian, and Nash social welfare for task assignment in individually rational agents’ coalitions. Since fairness is a relatively abstract term that can be difficult to quantify, we propose three new fairness measures based on equity and equality and use them to compare the newly proposed models. Through functional examples, we show that a reasonable trade-off between efficiency and fairness in task assignment is possible through the use of the proposed models.
- Open Access
- 22 July 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 193-224
Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm
In some production processes, the effort associated with a certain activity for its execution can vary over time. In this case, the amount of work per time unit devoted to each activity, so as its duration, is not univocally determined. This kind of problem can be represented by an activity project network with the so-called feeding precedence relations, and activity variable execution intensity. In this paper, we propose a forward recursion algorithm able to find the earliest start and finish times of each activity, in $$O(m \log n)$$ time, with n and m being the number of activities and the number of precedence relations, respectively. In particular, this requires the calculation of the (optimal) execution intensity profile, for each activity, that warrants the earliest start schedule and the minimum completion time of the project.- 22 July 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 193-224
Open AccessScheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm
In some production processes, the effort associated with a certain activity for its execution can vary over time. In this case, the amount of work per time unit devoted to each activity, so as its duration, is not univocally determined. This kind of problem can be represented by an activity project network with the so-called feeding precedence relations, and activity variable execution intensity. In this paper, we propose a forward recursion algorithm able to find the earliest start and finish times of each activity, in $$O(m \log n)$$ time, with n and m being the number of activities and the number of precedence relations, respectively. In particular, this requires the calculation of the (optimal) execution intensity profile, for each activity, that warrants the earliest start schedule and the minimum completion time of the project. - 13 October 2022
- Published by Springer Nature
- p. 95-107
On Balancing Fairness and Efficiency of Task Assignment in Agent Societies
- 13 October 2022
- Published by Springer Nature
- p. 95-107
On Balancing Fairness and Efficiency of Task Assignment in Agent Societies
- 1 April 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 298 (2) , 451-462
Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities
- 1 April 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 298 (2) , 451-462
Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities
- Open Access
- 31 July 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-3
Scalable Distributed Decision-Making and Coordination in Large and Complex Systems: Methods, Techniques, and Models
Human society, global economy, and Internet are becoming ever more decentralized, while millions of computers connected to the Internet facilitate the engineering of systems whose scale goes beyond spatial and computational boundaries of individual organizations.
- 31 July 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-3
Open AccessScalable Distributed Decision-Making and Coordination in Large and Complex Systems: Methods, Techniques, and Models
Human society, global economy, and Internet are becoming ever more decentralized, while millions of computers connected to the Internet facilitate the engineering of systems whose scale goes beyond spatial and computational boundaries of individual organizations.
- Open Access
- 16 July 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-21
Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, -assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest.- 16 July 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-21
Open AccessDecentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, -assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest. - Open Access
- 29 April 2020
- Published by Springer Nature in Operations Research Forum
- Vol. 1 (2) , 1-21
Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study
- 29 April 2020
- Published by Springer Nature in Operations Research Forum
- Vol. 1 (2) , 1-21
Open AccessCurriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study
- 15 October 2019
- Published by Springer Nature in Optimization Letters
- Vol. 14 (1) , 85-99
Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach
- 15 October 2019
- Published by Springer Nature in Optimization Letters
- Vol. 14 (1) , 85-99
Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach