Results 41 to 50 of about 256,176 (302)
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs [PDF]
INFORMS journal on computing, 2021 We investigate new methods for generating Lagrangian cuts to solve two-stage stochastic integer programs. Lagrangian cuts can be added to a Benders reformulation and are derived from solving single scenario integer programming subproblems identical to ...
Rui Chen, James R. Luedtke
semanticscholar +1 more source
Stochastic programming approach for TEP optimization considering RES integration in electricity market [PDF]
, 2017 Transmission expansion planning (TEP) is helping the system operator to decide the optimal solution for building new lines and in the same time to increase the reliability and safety of the existing power system.
Dumbrava, Virgil +5 more
core +2 more sources
IEEE Access, 2020 Conventional mine planning approaches use an estimated orebody model as input to generate optimal production schedules. The smoothing effect of some geostatistical estimation methods cause most of the mine plans and production forecasts to be unrealistic
Shuwei Huang +4 more
semanticscholar +1 more source
A heuristic approach for provider selection and task allocation model in telecommunication networks under stochastic QOS guaranties [PDF]
, 2012 In this study, we model provider selection and task allocation problem as an expected cost minimization problem with stochastic chance constraints. Two important parameters of Quality of Service (QoS), delay and jitter are considered as random variables ...
Kasap, Nihat +2 more
core +1 more source
Applied Sciences, 2019 This paper proposes a coordinated active–reactive power optimization model for an active distribution network with energy storage systems, where the active and reactive resources are handled simultaneously.
Lingling Wang +4 more
doaj +1 more source
Stochastic packing integer programs with few queries [PDF]
Mathematical Programming, 2018 The final draft of a paper published in Mathematical Programming (Series A)
Maehara, Takanori, Yamaguchi, Yutaro
openaire +4 more sources
Operations Research Perspectives, 2019 We propose herein the application of Benders decomposition with stochastic linear programming instead of the mix integer linear programming (MILP) approach to solve a lot sizing problem under uncertain demand, particularly in the case of a large-scale ...
Aphisak Witthayapraphakorn +1 more
doaj +1 more source
IEEE Access, 2020 In recent years, more and more oil companies adopt initiative delivery mode to make the refined oil secondary distribution scheme. In this work, we focus on the optimization problem of refined oil secondary distribution based on the initiative ...
Zhenping Li, Yuwei Zhang, Guowei Zhang
doaj +1 more source
A Location Problem of Fast Charging Stations Considering Congestion [PDF]
Journal of International Logistics and Trade, 2017 This paper considers locating congested fast charging stations (FCSs) and deploying chargers in a stochastic environment, while the related studies have predominantly focused on problems in deterministic environments. Reducing the inconvenience caused by
Woosuk Yang
doaj +1 more source
Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming [PDF]
, 2012 Internet Service Providers (ISPs) have the ability to route their traffic over different network providers. This study investigates the optimal routing strategy under multihoming in the case where network providers charge ISPs according to top-percentile
Grothey, A, Yang, X
core +1 more source