PATRIZIA BERALDI | University of Calabria (original) (raw)
Uploads
Papers by PATRIZIA BERALDI
International Journal of Production Economics, Mar 1, 2023
Journal of Optimization Theory and Applications, Dec 1, 1997
In this paper, we propose efficient parallel implementations of the auction/sequential shortest p... more In this paper, we propose efficient parallel implementations of the auction/sequential shortest path and the e-relaxation algorithms for solving the linear minimum cost flow problem. In the parallel auction algorithm, several augmenting paths can be found simultaneously, each of them starting from a different node with positive surplus. Convergence results of an asynchronous version of the algorithm are also given. For the e-relaxation method, there exist already parallel versions implemented on CM-5 and CM-2; our implementation is the first on a shared memory multiprocessor. We have obtained significant speedup values for the algorithms considered; it turns out that our implementations are effective and efficient.
Parallel Computing, Aug 1, 1997
In this paper we present a parallel asynchronous implementation of the e-relaxation method for so... more In this paper we present a parallel asynchronous implementation of the e-relaxation method for solving the linear minimum cost flow problem on distributed memory message-passing multiprocessor systems. The general structure of the method is well suited to efficient parallelization, since a single iteration can be performed on several nodes simultaneously. We describe the implementation details of the parallel version on both a Fujitsu APlOOO and a cluster of Digital Alpha workstations connected via FDDI links. The results obtained demonstrate that our implementation is capable of substantial speedups.
HAL (Le Centre pour la Communication Scientifique Directe), Aug 3, 2016
AIRO Springer series, 2023
Soft Computing, Apr 26, 2022
This paper addresses the electricity pricing problem with demand-side flexibility. The interactio... more This paper addresses the electricity pricing problem with demand-side flexibility. The interaction between an aggregator and the prosumers within a coalition is modeled by a Stackelberg game and formulated as a mathematical bi-level program where the aggregator and the prosumer, respectively, play the role of upper and lower decision makers with conflicting goals. The aggregator establishes the pricing scheme by optimizing the supply strategy with the aim of maximizing the profit, prosumers react to the price signals by scheduling the flexible loads and managing the home energy system to minimize the electricity bill. The problem is solved by a heuristic approach which exploits the specific model structure. Some numerical experiments have been carried out on a real test case. The results provide the stakeholders with informative managerial insights underlining the prominent roles of aggregator and prosumers.
Procedia Computer Science
6TH IMA Int. Conf. on Quantitative Modelling in the Management of Healthcare, 2010
Int. Workshop on “Large Scale Nonlinear Optimization”, Int. School of Mathematics “G. Stampacchia”, Ettore Majorana Centre for Scientific Culture, 2004
AIRO 2011 - Operational Research in Transportation and Logistics, 2011
AIRO Winter 2013 Conference Decennial of AIRO Winter Conferences Operational Research for Development, Sustainability and Local Economies, 2013
Dottorato di Ricerca in Matematica e Informatica (Ricerca Operativa). Ciclo XXXI
Special issue of the IMA Journal of Management Mathematics that includes selected papers presente... more Special issue of the IMA Journal of Management Mathematics that includes selected papers presented at the XIII International Conference on Stochastic Programming held in Bergamo in 2013 and the First Euro mini conference on Stochastic Programming held in Paris in 2014.
Omega, 2019
This is a PDF file of an article that has undergone enhancements after acceptance, such as the ad... more This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
AIRO 2004 - 35th Conference of the Italian Association of Operations Research, 2004
AIRO Springer Series, 2019
Delivering perishable food as soon as possible has been always a challenge for producers, amplifi... more Delivering perishable food as soon as possible has been always a challenge for producers, amplified in recent years, by a more and more competitive global market. The problem can be tackled as a routing problem with consideration of the arrival time at the customers’ location, taking into account the perishability of the products planned to be delivered. Since in real-world applications customers’ requests dynamically arrive during the execution of the transportation process, building vehicle routes in an on-going fashion is a challenge to be addressed. This paper describes a mobile solution that heavily relies on the use of mobile phones and integrates a well known heuristic method for the problem at hand. A case concerning the delivery of perishable food to a set of restaurants will serve as a base for illustrating the potential benefits of such a system.
Data Envelopment Analysis (DEA) is one of the most widely used technique for evaluating the relat... more Data Envelopment Analysis (DEA) is one of the most widely used technique for evaluating the relative efficiency of a set of homogeneous decision making units. Traditionally, it assumes that input and output variables are known in advance, ignoring the critical issue of data uncertainty. In this paper, we deal with the problem of efficiency evaluation under uncertain conditions by adopting the general framework of the stochastic programming. We assume that output parameters are represented by discretely distributed random variables and we propose two different models defined according to a neutral and risk-averse perspective. The models have been validated by considering a real case study concerning the evaluation of the technical efficiency of a sample of individual firms operating in the Italian leather manufacturing industry. Our findings show the validity of the proposed approach as ex-ante evaluation technique by providing the decision maker with useful insights depending on his...
International Journal of Production Economics, Mar 1, 2023
Journal of Optimization Theory and Applications, Dec 1, 1997
In this paper, we propose efficient parallel implementations of the auction/sequential shortest p... more In this paper, we propose efficient parallel implementations of the auction/sequential shortest path and the e-relaxation algorithms for solving the linear minimum cost flow problem. In the parallel auction algorithm, several augmenting paths can be found simultaneously, each of them starting from a different node with positive surplus. Convergence results of an asynchronous version of the algorithm are also given. For the e-relaxation method, there exist already parallel versions implemented on CM-5 and CM-2; our implementation is the first on a shared memory multiprocessor. We have obtained significant speedup values for the algorithms considered; it turns out that our implementations are effective and efficient.
Parallel Computing, Aug 1, 1997
In this paper we present a parallel asynchronous implementation of the e-relaxation method for so... more In this paper we present a parallel asynchronous implementation of the e-relaxation method for solving the linear minimum cost flow problem on distributed memory message-passing multiprocessor systems. The general structure of the method is well suited to efficient parallelization, since a single iteration can be performed on several nodes simultaneously. We describe the implementation details of the parallel version on both a Fujitsu APlOOO and a cluster of Digital Alpha workstations connected via FDDI links. The results obtained demonstrate that our implementation is capable of substantial speedups.
HAL (Le Centre pour la Communication Scientifique Directe), Aug 3, 2016
AIRO Springer series, 2023
Soft Computing, Apr 26, 2022
This paper addresses the electricity pricing problem with demand-side flexibility. The interactio... more This paper addresses the electricity pricing problem with demand-side flexibility. The interaction between an aggregator and the prosumers within a coalition is modeled by a Stackelberg game and formulated as a mathematical bi-level program where the aggregator and the prosumer, respectively, play the role of upper and lower decision makers with conflicting goals. The aggregator establishes the pricing scheme by optimizing the supply strategy with the aim of maximizing the profit, prosumers react to the price signals by scheduling the flexible loads and managing the home energy system to minimize the electricity bill. The problem is solved by a heuristic approach which exploits the specific model structure. Some numerical experiments have been carried out on a real test case. The results provide the stakeholders with informative managerial insights underlining the prominent roles of aggregator and prosumers.
Procedia Computer Science
6TH IMA Int. Conf. on Quantitative Modelling in the Management of Healthcare, 2010
Int. Workshop on “Large Scale Nonlinear Optimization”, Int. School of Mathematics “G. Stampacchia”, Ettore Majorana Centre for Scientific Culture, 2004
AIRO 2011 - Operational Research in Transportation and Logistics, 2011
AIRO Winter 2013 Conference Decennial of AIRO Winter Conferences Operational Research for Development, Sustainability and Local Economies, 2013
Dottorato di Ricerca in Matematica e Informatica (Ricerca Operativa). Ciclo XXXI
Special issue of the IMA Journal of Management Mathematics that includes selected papers presente... more Special issue of the IMA Journal of Management Mathematics that includes selected papers presented at the XIII International Conference on Stochastic Programming held in Bergamo in 2013 and the First Euro mini conference on Stochastic Programming held in Paris in 2014.
Omega, 2019
This is a PDF file of an article that has undergone enhancements after acceptance, such as the ad... more This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
AIRO 2004 - 35th Conference of the Italian Association of Operations Research, 2004
AIRO Springer Series, 2019
Delivering perishable food as soon as possible has been always a challenge for producers, amplifi... more Delivering perishable food as soon as possible has been always a challenge for producers, amplified in recent years, by a more and more competitive global market. The problem can be tackled as a routing problem with consideration of the arrival time at the customers’ location, taking into account the perishability of the products planned to be delivered. Since in real-world applications customers’ requests dynamically arrive during the execution of the transportation process, building vehicle routes in an on-going fashion is a challenge to be addressed. This paper describes a mobile solution that heavily relies on the use of mobile phones and integrates a well known heuristic method for the problem at hand. A case concerning the delivery of perishable food to a set of restaurants will serve as a base for illustrating the potential benefits of such a system.
Data Envelopment Analysis (DEA) is one of the most widely used technique for evaluating the relat... more Data Envelopment Analysis (DEA) is one of the most widely used technique for evaluating the relative efficiency of a set of homogeneous decision making units. Traditionally, it assumes that input and output variables are known in advance, ignoring the critical issue of data uncertainty. In this paper, we deal with the problem of efficiency evaluation under uncertain conditions by adopting the general framework of the stochastic programming. We assume that output parameters are represented by discretely distributed random variables and we propose two different models defined according to a neutral and risk-averse perspective. The models have been validated by considering a real case study concerning the evaluation of the technical efficiency of a sample of individual firms operating in the Italian leather manufacturing industry. Our findings show the validity of the proposed approach as ex-ante evaluation technique by providing the decision maker with useful insights depending on his...