Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA note on Tempelmeiers {beta}-service measure under non-stationary stochastic demand
102
0
0.0
(
0
)
Added by
Roberto Rossi
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Tempelmeier (2007) considers the problem of computing replenishment cycle policy parameters under non-stationary stochastic demand and service level constraints. He analyses two possible service level measures: the minimum no stock-out probability per period ({alpha}-service level) and the so called fill rate, that is the fraction of demand satisfied immediately from stock on hand ({beta}-service level). For each of these possible measures, he presents a mixed integer programming (MIP) model to determine the optimal replenishment cycles and corresponding order-up-to levels minimizing the expected total setup and holding costs. His approach is essentially based on imposing service level dependent lower bounds on cycle order-up-to levels. In this note, we argue that Tempelmeiers strategy, in the {beta}-service level case, while being an interesting option for practitioners, does not comply with the standard definition of fill rate. By means of a simple numerical example we demonstrate that, as a consequence, his formulation might yield sub-optimal policies.
rate research
Read More
Given the rise of electric vehicle (EV) adoption, supported by government policies and dropping technology prices, new challenges arise in the modeling and operation of electric transportation. In this paper, we present a model for solving the EV routing problem while accounting for real-life stochastic demand behavior. We present a mathematical formulation that minimizes travel time and energy costs of an EV fleet. The EV is represented by a battery energy consumption model. To adapt our formulation to real-life scenarios, customer pick-ups and drop-offs were modeled as stochastic parameters. A chance-constrained optimization model is proposed for addressing pick-ups and drop-offs uncertainties. Computational validation of the model is provided based on representative transportation scenarios. Results obtained showed a quick convergence of our model with verifiable solutions. Finally, the impact of electric vehicles charging is validated in Downtown Manhattan, New York by assessing the effect on the distribution grid.
We investigate stochastic optimization problems under relaxed assumptions on the distribution of noise that are motivated by empirical observations in neural network training. Standard results on optimal convergence rates for stochastic optimization assume either there exists a uniform bound on the moments of the gradient noise, or that the noise decays as the algorithm progresses. These assumptions do not match the empirical behavior of optimization algorithms used in neural network training where the noise level in stochastic gradients could even increase with time. We address this behavior by studying convergence rates of stochastic gradient methods subject to changing second moment (or variance) of the stochastic oracle as the iterations progress. When the variation in the noise is known, we show that it is always beneficial to adapt the step-size and exploit the noise variability. When the noise statistics are unknown, we obtain similar improvements by developing an online estimator of the noise level, thereby recovering close variants of RMSProp. Consequently, our results reveal an important scenario where adaptive stepsize methods outperform SGD.
We consider the non-stationary stochastic lot sizing problem with backorder costs and make a cost comparison among different lot-sizing strategies. We initially provide an overview of the strategies and some corresponding solution approaches in the literature. We then compare the cost performances of the lot-sizing strategies on a common test bed while taking into account the added value of realized demand information. The results of this numerical experience enable us to derive novel insights about the cost performance of different stochastic lot-sizing strategies under re-planning with respect to demand realization.
This study presents an innovative solution for powering electric vehicles, named Charging-as-a-Service (CaaS), that concerns the potential large-scale adoption of light-duty electric vehicles (LDEV) in the Mobility-as-a-Service (MaaS) industry. Analogous to the MaaS, the core idea of the CaaS is to dispatch service vehicles (SVs) that carry modular battery units (MBUs) to provide LDEVs for mobility service with on-demand battery delivery. The CaaS system is expected to tackle major bottlenecks of a large-scale LDEV adoption in the MaaS industry due to the lack of charging infrastructure and excess waiting and charging time. A hybrid agent-based simulation model (HABM) is developed to model the dynamics of the CaaS system with SV agents, and a trip-based stationary charging probability distribution is introduced to simulate the generation of charging demand for LDEVs. Two dispatching algorithms are further developed to support the optimal operation of the CaaS. The model is validated by assuming electrifying all 13,000 yellow taxis in New York City (NYC) that follow the same daily trip patterns. Multiple scenarios are analyzed under various SV fleet sizes and dispatching strategies. The results suggest that optimal deployment of 250 SVs may serve the LDEV fleet in NYC with an average waiting time of 5 minutes, save the travel distance at over 50 miles per minute, and gain considerable profits of up to $50 per minute. This study offers significant insights into the feasibility, service efficiency, and financial sustainability for deploying city-wide CaaS systems to power the electric MaaS industry.
Adaptive networks rely on in-network and collaborative processing among distributed agents to deliver enhanced performance in estimation and inference tasks. Information is exchanged among the nodes, usually over noisy links. The combination weights that are used by the nodes to fuse information from their neighbors play a critical role in influencing the adaptation and tracking abilities of the network. This paper first investigates the mean-square performance of general adaptive diffusion algorithms in the presence of various sources of imperfect information exchanges, quantization errors, and model non-stationarities. Among other results, the analysis reveals that link noise over the regression data modifies the dynamics of the network evolution in a distinct way, and leads to biased estimates in steady-state. The analysis also reveals how the network mean-square performance is dependent on the combination weights. We use these observations to show how the combination weights can be optimized and adapted. Simulation results illustrate the theoretical findings and match well with theory.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
