District heating (DH) systems are an important component in the EU strategy to reach the emission goals, since they allow an efficient supply of heat while using the advantages of sector coupling between different ene...
详细信息
District heating (DH) systems are an important component in the EU strategy to reach the emission goals, since they allow an efficient supply of heat while using the advantages of sector coupling between different energy carriers such as power, heat, gas and biomass. Most DH systems use several different types of units to produce heat for hundreds or thousands of households (e.g. natural gas-fired boilers, electric boilers, biomass-fired units, waste heat from industry, solar thermal units). Furthermore, combined heat and power units units are often included to use the synergy effects of excess heat from electricity production. To address the challenge of providing optimization tools for a vast variety of different system configurations, we propose a generic mixed-integer linear programming formulation for the operational production optimization in DH systems. The model is based on a network structure that can represent different system setups while the underlying model formulation stays the same. Therefore, the model can be used for most DH systems although they might use different combinations of technologies in different system layouts. The mathematical formulation is based on stochastic programming to account for the uncertainty of energy prices and production from non-dispatchable units such as waste heat and solar heat. Furthermore, the model is easily adaptable to different application cases in DH systems such as operational planning, bidding to electricity markets and long-term evaluation. We present results from three real cases in Denmark with different requirements.
Operations planning is an important step in any activity as it aligns resources to achieve economic production value. In agriculture operations where uncertainty is present, planners must deal with biological and envi...
详细信息
Operations planning is an important step in any activity as it aligns resources to achieve economic production value. In agriculture operations where uncertainty is present, planners must deal with biological and environmental factors, among others, which add variability and complexity to the production planning process. In this work, we consider operations planning to harvest grapes for wine production where uncertainty in weather conditions will affect the quality of grapes and, consequently, the economic value of the product. In this setting, planners make decisions on labor allocation and harvesting schedules, considering uncertainty of future rain. Weather uncertainty is modeled following a Markov Chain approach, in which rain affects the quality of grapes and labor productivity. We compare an expected value with a multi-stage stochastic optimization approach using standard metrics such as Value of stochastic Solution and Expected Value of Perfect Information. We analyze the impact of grape quality over time, if they are not harvested on the optimal ripeness day, and also consider differences in ability between workers, which accounts for the impact of rain in their productivity. Results are presented for a small grape harvest instance and we compare the performance of both models under different scenarios of uncertainty, manpower ability, and product qualities. Results indicate that the multi-stage approach produces better results than the expected value approach, especially under high uncertainty and high grape quality scenarios. Worker ability is also a mechanism for dealing with uncertainty, and both models take advantage of this variable.
As the integration of microgrids (MG) and energy storage continues to grow, the need for efficient distributed cooperation between MGs and common energy storage (CES) becomes paramount. A robust optimisation model for...
详细信息
As the integration of microgrids (MG) and energy storage continues to grow, the need for efficient distributed cooperation between MGs and common energy storage (CES) becomes paramount. A robust optimisation model for the distributed cooperation of MG-CES is presented, taking into account distributed generation under uncertainty. The proposed model follows a two-stage, four-layer 'min-min-max-min' structure. In the first stage, the initial layer 'min' addresses the distributed cooperation problem between MG and CES, while the second stage employs 'min-max-min' to optimise the scheduling of MG. To enhance the solution process and expedite convergence, the authors introduce a column-constrained generation algorithm with alternating iterations of U and D variables (CCG-UD) specifically designed for the three-layer structure in the second stage. This algorithm effectively decouples subproblems, contributing to accelerated solutions. To tackle the convergence challenges posed by the non-convex MG-CES model, the authors integrate the Bregman alternating direction method with multipliers (BADMM) with CCG-UD in the final solution step. Real case tests are conducted using three zone-level MGs to validate the efficacy of the proposed model and methodology. The results demonstrate the practical utility and efficiency of the developed approach in addressing distributed cooperation challenges in microgrid systems with energy storage.
Inspired by the global supply chain disruptions caused by the COVID-19 pandemic, we study optimal procurement and inventory decisions for a pharmaceutical supply chain over a finite planning horizon. To model disrupti...
详细信息
Inspired by the global supply chain disruptions caused by the COVID-19 pandemic, we study optimal procurement and inventory decisions for a pharmaceutical supply chain over a finite planning horizon. To model disruption, we assume that the demand for medical drugs is uncertain and shows spatiotemporal variability. To address demand uncertainty, we propose a two-stage optimization framework, where in the first stage, the total cost of pre-positioning drugs at distribution centers and its associated risk is minimized, while the second stage minimizes the cost of recourse decisions (e.g., reallocation, inventory management). To allow for different risk preferences, we propose to capture the risk of demand uncertainty through the expectation and worst-case measures, leading to two different models, namely (risk-neutral) stochastic programming and (risk-averse) robust optimization. We consider a finite number of scenarios to represent the demand uncertainty, and to solve the resulting models efficiently, we propose L-shaped decomposition-based algorithms. Through extensive numerical experiments, we illustrate the impact of various parameters, such as travel time, product's shelf life, and waste due to transportation and storage, on the supply chain resiliency and cost, under optimal risk-neutral and risk-averse policies. These insights can assist decision makers in making informed choices.
stochastic multistage decision problems appear in many -if not all -application areas of Operations Re-search. While to define such problems is easy, to solve them is quite difficult, since they are of infinite dimens...
详细信息
stochastic multistage decision problems appear in many -if not all -application areas of Operations Re-search. While to define such problems is easy, to solve them is quite difficult, since they are of infinite dimension. Numerical solution can only be found by solving an approximate, easier problem. In this pa-per, we show good approximations can be found, where we emphasize the recursive structure of the involved algorithms and data structures. In a second part, the problem of coping with the model error of approximations is discussed. We present algorithms for finding distributionally robust solutions for the model error problem. We also review some application cases of such situations from the literature.(c) 2022 The Author. Published by Elsevier B.V. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )
To comprehensively reflect the heteroscedasticity, nonlinear dependence and heavy-tailed distributions of stock returns while reducing the huge cost of parameter estimation, we use the Fama-French three-factor model t...
详细信息
To comprehensively reflect the heteroscedasticity, nonlinear dependence and heavy-tailed distributions of stock returns while reducing the huge cost of parameter estimation, we use the Fama-French three-factor model to describe stock returns and then model the factor dynamics by using the ARMA-GARCH and Student-t copula models. A factor-based scenario tree generation algorithm is thus proposed, and the corresponding multi-stage international portfolio selection model is constructed and its reformulation is derived. Different from the current literature, our proposed models can capture the dynamic dependence among international markets and the dynamics of exchange rates, and what's more important, make it possible for the practical solution of large-scale multi-stage international portfolio selection problems. Considering three different objective functions and international investments in the USA, Japanese and European markets, we carry out a series of empirical studies to demonstrate the practicality and efficiency of the proposed factor-based scenario tree generation algorithm and multi-stage international portfolio selection models.
Nearshoring is a phenomenon that has gained prominence in Mexico over the last 2 years, where companies have faced problems in meeting customer demand due to a service level and limited inventory space. Previous studi...
详细信息
Nearshoring is a phenomenon that has gained prominence in Mexico over the last 2 years, where companies have faced problems in meeting customer demand due to a service level and limited inventory space. Previous studies in aggregate planning did not consider the possibility of allowing rental of extra warehouse space if needed with a concurrent uncertainty in demand. Therefore, to address this gap in the research, an improved optimization model for multi-product and multi-period aggregate planning with uncertainty in demands given an area of inventory space is proposed. A set of cases based on real industry data were solved and compared to a model where no warehouse space is allowed to be rented. The results are improvements related to production costs and customer demand satisfaction. In addition, the model will help managers of manufacturing companies to determine the minimum inventory space required to effectively meet demand. [Graphical abstract]
This article proposes a new approach to obtain uniformly valid inference for linear functionals or scalar subvectors of a partially identified parameter defined by linear moment inequalities. The procedure amounts to ...
详细信息
This article proposes a new approach to obtain uniformly valid inference for linear functionals or scalar subvectors of a partially identified parameter defined by linear moment inequalities. The procedure amounts to bootstrapping the value functions of randomly perturbed linear programming problems, and does not require the researcher to grid over the parameter space. The low-level conditions for uniform validity rely on genericity results for linear programs. The unconventional perturbation approach produces a confidence set with a coverage probability of 1 over the identified set, but obtains exact coverage on an outer set, is valid under weak assumptions, and is computationally simple to implement.
For drivers in ride-hailing companies, allocation within the city is paramount to get matched with rides. This decision depends on many factors, where some of them (such as demand and allocation of others) are unknown...
详细信息
For drivers in ride-hailing companies, allocation within the city is paramount to get matched with rides. This decision depends on many factors, where some of them (such as demand and allocation of others) are unknown for the drivers, but are available for the company. In this work, we investigate whether it is beneficial or not for the ride-hailing company to share this information with their drivers. To do so, we study the problem through the lens of Stackelberg games, and we propose a new indicator called the Expected Value of Shared Information. We present a simplified model to conduct a proof-of-concept study: we provide explicit single-level reformulations of the bilevel programming problems derived from the model, and perform several simulations with randomly generated data. Our preliminary results suggest that sharing information could be beneficial and deserves to be further studied.
Distribution network design is both strategic and tactical level problem that deals with the alternative locations selection, assignment of the customers to suppliers, and determining the product flow quantities among...
详细信息
Distribution network design is both strategic and tactical level problem that deals with the alternative locations selection, assignment of the customers to suppliers, and determining the product flow quantities among the echelons. There are various factors that affect decisions on this problem such as transportation mode availability, lead times, facility capacities, penalties, demand, unit costs, storing costs etc. In real life distribution networks, all the activities are realized in a dynamic environment and most of the above-mentioned factors include uncertainties. Obtaining an applicable solution for real life distribution network design requires a stochastic approach consideration. In this study, a two stage stochastic programming method is applied for modeling and solving the problem. In the first stage, the model tries to decide the location decision of the facilities of the network. In the second stage, the model aims to make a decision about the transported, stored and unmet demand quantities considering the demand and related handling cost. These demand and handling costs are obtained by combining the various scenarios. The proposed model is solved for a distribution network active in FMCG sector. The results are analyzed and compared with the deterministic solutions.
暂无评论