共查询到20条相似文献,搜索用时 31 毫秒
1.
We present an algorithmic framework, so-called BFC-TSMIP, for solving two-stage stochastic mixed 0–1 problems. The constraints in the Deterministic Equivalent Model have 0–1 variables and continuous variables at any stage. The approach uses the Twin Node Family ( TNF) concept within an adaptation of the algorithmic framework so-called Branch-and-Fix Coordination for satisfying the nonanticipativity constraints for the first stage 0–1 variables. Jointly we solve the mixed 0–1 submodels defined at each TNF integer set for satisfying the nonanticipativity constraints for the first stage continuous variables. In these submodels the only integer variables are the second stage 0–1 variables. A numerical example and some theoretical and computational results are presented to show the performance of the proposed approach. 相似文献
2.
We present an algorithmic approach for solving two-stage stochastic mixed 0–1 problems. The first stage constraints of the
Deterministic Equivalent Model have 0–1 variables and continuous variables. The approach uses the Twin Node Family ( TNF) concept within the so-called Branch-and-Fix Coordination algorithmic framework to satisfy the nonanticipativity constraints, jointly with a Benders Decomposition scheme to solve a given LP model at each TNF integer set. As a pilot case, the structuring of a portfolio of Mortgage-Backed Securities under uncertainty in the interest rate path
on a given time horizon is used. Some computational experience is reported. 相似文献
3.
In this paper we study solution methods for solving the dual problem corresponding to the Lagrangian Decomposition of two-stage stochastic mixed 0-1 models. We represent the two-stage stochastic mixed 0-1 problem by a splitting variable representation of the deterministic equivalent model, where 0-1 and continuous variables appear at any stage. Lagrangian Decomposition (LD) is proposed for satisfying both the integrality constraints for the 0-1 variables and the non-anticipativity constraints. We compare the performance of four iterative algorithms based on dual Lagrangian Decomposition schemes: the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm, and the Dynamic Constrained Cutting Plane scheme. We test the tightness of the LD bounds in a testbed of medium- and large-scale stochastic instances. 相似文献
4.
This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated
as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to
be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items
due to the decisions made in the first stage. The problem’s objective is to minimize the total expected cost incurred in both
stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for
solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known
measures of uncertainty effects in stochastic programming: the value of stochastic solution— VSS—and the expected value of perfect information— EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches,
even under small variations in the parameters of the problem. 相似文献
5.
A two-stage stochastic program is formulated for day-ahead commitment of thermal generating units to minimize total expected cost considering uncertainties in the day-ahead load and the availability of variable generation resources. Commitments of thermal units in the stochastic reliability unit commitment are viewed as first-stage decisions, and dispatch is relegated to the second stage. It is challenging to solve such a stochastic program if many scenarios are incorporated. A heuristic scenario reduction method termed forward selection in recourse clusters (FSRC), which selects scenarios based on their cost and reliability impacts, is presented to alleviate the computational burden. In instances down-sampled from data for an Independent System Operator in the US, FSRC results in more reliable commitment schedules having similar costs, compared to those from a scenario reduction method based on probability metrics. Moreover, in a rolling horizon study, FSRC preserves solution quality even if the reduction is substantial. 相似文献
6.
A general multiperiod model to optimize simultaneously production planning and design decisions applied to multiproduct batch plants is proposed. This model includes deterministic seasonal variations of costs, prices, demands and supplies. The overall problem is formulated as a mixed-integer linear programming model by applying appropriate linearizations of non-linear terms. The performance criterion is to maximize the net present value of the profit, which comprises sales, investment, inventories, waste disposal and resources costs, and a penalty term accounting for late deliveries. A noteworthy feature of this approach is the selection of unit dimensions from the available discrete sizes, following the usual procurement policy in this area. The model simultaneously calculates the plant structure (parallel units in every stage, and allocation of intermediate storage tanks), and unit sizes, as well as the production planning decisions in each period (stocks of both product and raw materials, production plans, policies of sales and procurement, etc.). 相似文献
7.
In this paper we consider integrated planning of transportation of raw material, production and distribution of products of the supply chain at Södra Cell AB, a major European pulp mill company. The strategic planning period is one year. Decisions included in the planning are transportation of raw materials from harvest areas to pulp mills, production mix and contents at pulp mills, distribution of pulp products from mills to customer via terminals or directly and selection of potential orders and their levels at customers. Distribution is carried out by three different transportation modes; vessels, trains and trucks. We propose a mathematical model for the entire supply chain which includes a large number of continuous variables and a set of binary variables to reflect decisions about product mix and order selection at customers. Five different alternatives regarding production mix in a case study carried out at Södra Cell are analyzed and evaluated. Each alternative describes which products will be produced at which pulp mills. 相似文献
8.
We present an exact algorithmic framework, so-called BFC-MSMIP, for optimizing multistage stochastic mixed 0–1 problems with
complete recourse. The uncertainty is represented by using a scenario tree and lies anywhere in the model. The problem is
modeled by a splitting variable representation of the Deterministic Equivalent Model of the stochastic problem, where the
0–1 variables and the continuous variables appear at any stage. The approach uses the Twin Node Family concept within the
algorithmic framework, so-called Branch-and-Fix Coordination, for satisfying the nonanticipativity constraints in the 0–1 variables. Some blocks of additional strategies are used in order to show the performance of the proposed
approach. The blocks are related to the scenario clustering, the starting branching and the branching order strategies, among
others. Some computational experience is reported. It shows that the new approach obtains the optimal solution in all instances
under consideration.
相似文献
9.
Numerous planning problems can be formulated as multi-stage stochastic programs and many possess key discrete (integer) decision
variables in one or more of the stages. Progressive hedging (PH) is a scenario-based decomposition technique that can be leveraged
to solve such problems. Originally devised for problems possessing only continuous variables, PH has been successfully applied
as a heuristic to solve multi-stage stochastic programs with integer variables. However, a variety of critical issues arise
in practice when implementing PH for the discrete case, especially in the context of very difficult or large-scale mixed-integer
problems. Failure to address these issues properly results in either non-convergence of the heuristic or unacceptably long
run-times. We investigate these issues and describe algorithmic innovations in the context of a broad class of scenario-based
resource allocation problem in which decision variables represent resources available at a cost and constraints enforce the
need for sufficient combinations of resources. The necessity and efficacy of our techniques is empirically assessed on a two-stage
stochastic network flow problem with integer variables in both stages. 相似文献
10.
研究集生产、运输和销售为一体的多个制造商在随机市场环境下的两阶段随机非合作博弈问题.首先,建立了该两阶段随机非合作博弈问题的模型,然后将其转化为两阶段随机变分不等式(Stochastic Variational Inequality,简称SVI).在温和的假设条件下,证明了该问题存在均衡解,并通过Progressive Hedging Method(简称PHM)进行求解.最后,通过改变模型中随机变量的分布和成本参数,分析与研究厂商的市场行为. 相似文献
11.
This paper considers the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). The MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand to minimize the total cost generated during the planning horizon. The problem is formulated as a two-stage stochastic programming model, in which the first stage decision deals with the temporal and spatial movement of MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of the L-shaped method is proposed in which several lower bound inequalities are developed and incorporated into the master program. The computational results show that the algorithm yields a tighter lower bound and converges faster to the optimal solution. The result of a sensitivity analysis further indicates that in dealing with stochastic demand the two-stage stochastic programming approach has a distinctive advantage over the model considering only the average demand in terms of cost reduction. 相似文献
12.
This paper deals with inventory models that unify the decisions for raw materials and the finished product for a single product manufacturing system. The product is manufactured in batches and raw materials are jointly replenished from outside suppliers. The system is assumed to deteriorate during the production process. As a result, some proportion of nonconforming items is produced. The objective is to minimize the total variable cost for the system. A solution procedure is developed to find a near optimal solution for the basic model. The analysis for the basic model is extended to cases where the proportion of defective items is not constant or the defective rate is a function of production setup cost. 相似文献
13.
This paper provides a complete framework to consider manufacturing, inspection and rework activities in two-stage transfer-line production systems. The purpose of this paper is to analyse some of the transient state characteristics of a two-stage production system subject to an initial buffer of infinite capacity, inspection at both the inter- and end-stages and rework. The first stage of the system is never starved and the second stage is never blocked. A stochastic model is developed to analyse the system and explicit analytical expressions for some of the system characteristics have been obtained using the state-space method and regeneration point technique. All the random variables involved in the analysis are assumed to be arbitrary (general). Numerical illustrations have also been presented for some particular cases. 相似文献
14.
Multi-stage stochastic linear programs (MSLPs) are notoriously hard to solve in general. Linear decision rules (LDRs) yield an approximation of an MSLP by restricting the decisions at each stage to be an affine function of the observed uncertain parameters. Finding an optimal LDR is a static optimization problem that provides an upper bound on the optimal value of the MSLP, and, under certain assumptions, can be formulated as an explicit linear program. Similarly, as proposed by Kuhn et al. (Math Program 130(1):177–209, 2011) a lower bound for an MSLP can be obtained by restricting decisions in the dual of the MSLP to follow an LDR. We propose a new approximation approach for MSLPs, two-stage LDRs. The idea is to require only the state variables in an MSLP to follow an LDR, which is sufficient to obtain an approximation of an MSLP that is a two-stage stochastic linear program (2SLP). We similarly propose to apply LDR only to a subset of the variables in the dual of the MSLP, which yields a 2SLP approximation of the dual that provides a lower bound on the optimal value of the MSLP. Although solving the corresponding 2SLP approximations exactly is intractable in general, we investigate how approximate solution approaches that have been developed for solving 2SLP can be applied to solve these approximation problems, and derive statistical upper and lower bounds on the optimal value of the MSLP. In addition to potentially yielding better policies and bounds, this approach requires many fewer assumptions than are required to obtain an explicit reformulation when using the standard static LDR approach. A computational study on two example problems demonstrates that using a two-stage LDR can yield significantly better primal policies and modestly better dual policies than using policies based on a static LDR. 相似文献
15.
We study a vehicle routing problem in which vehicles are dispatched multiple times a day for product delivery. In this problem,
some customer orders are known in advance while others are uncertain but are progressively realized during the day. The key
decisions include determining which known orders should be delivered in the first dispatch and which should be delivered in
a later dispatch, and finding the routes and schedules for customer orders. This problem is formulated as a two-stage stochastic
programming problem with the objective of minimizing the expected total cost. A worst-case analysis is performed to evaluate
the potential benefit of the stochastic approach against a deterministic approach. Furthermore, a sample-based heuristic is
proposed. Computational experiments are conducted to assess the effectiveness of the model and the heuristic.
相似文献
16.
We address a multi-category workforce planning problem for functional areas located at different service centres, each having office-space and recruitment capacity constraints, and facing fluctuating and uncertain workforce demand. A deterministic model is initially developed to deal with workforce fluctuations based on an expected demand profile over the horizon. To hedge against the demand uncertainty, we also propose a two-stage stochastic program, in which the first stage makes personnel recruiting and allocation decisions, while the second stage reassigns workforce demand among all units. A Benders’ decomposition-based algorithm is designed to solve this two-stage stochastic mixed-integer program. Computational results based on some practical numerical experiments are presented to provide insights on applying the deterministic versus the stochastic programming approach, and to demonstrate the efficacy of the proposed algorithm as compared with directly solving the model using its deterministic equivalent. 相似文献
17.
Setting the mean (target value) for a production process is an important decision for a producer when material cost is a significant portion of production cost. Because the process mean determines the process conforming rate, it affects other production decisions, including, in particular, production setup and raw material procurement policies. In this paper, we consider the situation in which the product of interest is assumed to have a lower specification limit, and the items that do not conform to the specification limit are scrapped with no salvage value. The production cost of an item is a linear function of the amount of the raw material used in producing the item, and the supply rate of the raw material is finite and constant. Furthermore, it is assumed that quantity discounts are available in the raw material cost and that the discounts are determined by the supply rate. Two types of discounts are considered in this paper: incremental quantity discounts and all-unit quantity discounts. A two-echelon model is formulated for a single-product production process to incorporate the issues associated with production setup and raw material procurement into the classical process mean problem. Efficient solution algorithms are developed for finding the optimal solutions of the model. 相似文献
19.
Stochastic programs with recourse provide an effective modeling paradigm for sequential decision problems with uncertain or noisy data, when uncertainty can be modeled by a discrete set of scenarios. In two-stage problems the decision variables are partitioned into two groups: a set of structural, first-stage decisions, and a set of second-stage, recourse decisions. The structural decisions are scenario-invariant, but the recourse decisions are scenario-dependent and can vary substantially across scenarios. In several applications it is important to restrict the variability of recourse decisions across scenarios, or to investigate the tradeoffs between the stability of recourse decisions and expected cost of a solution.We present formulations of stochastic programs with restricted recourse that trade off recourse stability with expected cost. The models generate a sequence of solutions to which recourse robustness is progressively enforced via parameterized, satisficing constraints. We investigate the behavior of the models on several test cases, and examine the performance of solution procedures based on the primal-dual interior point method. 相似文献
20.
In this research, we integrate the issues related to operations and marketing strategy of firms characterized by large product variety, short lead times, and demand variability in an assemble-to-order environment. The operations decisions are the inventory level of components and semi-finished goods, and configuration of semi-finished goods. The marketing decisions are the products price and a lead time guarantee which is uniform for all products. We develop an integrated mathematical model that captures trade-offs related to inventory of semi-finished goods, inventory of components, outsourcing costs, and customer demand based on guaranteed lead time and price.The mathematical model is a two-stage, stochastic, integer, and non-linear programming problem. In the first stage, prior to demand realization, the operation and marketing decisions are determined. In the second stage, inventory is allocated to meet the demand. The objective is to maximize the expected profit per-unit time. The computational results on the test problems provide managerial insights for firms faced with the conflicting needs of offering: (i) low prices, (ii) guaranteed and short lead time, and (iii) a large product variety by leveraging operations decisions. 相似文献
|