需求不确定下应急医疗服务站鲁棒配置模型与算法

大型突发事件发生后需要快速启动应急救灾网络,合理配置应急医疗服务站。本文考虑各应急医疗服务站选址节点需求的不确定性,引入三个不确定水平参数,构建四类不确定需求集合(box, ellipsoid, polyhedron和interval-polyhedron)对应的应急医疗服务站鲁棒配置模型,运用分支-切割算法求解,最后,进行需求扰动比例的灵敏度分析。算例结果表明,四类不确定需求集下的鲁棒配置模型中,ellipsoid不确定需求集合配置模型开放设施较少,总成本最小,鲁棒性较好。决策者还可以根据风险偏好选择不确定水平和需求扰动比例的组合,以使得总成本最小。     

Robust solutions for network design under transportation cost and demand uncertainty

In many applications, the network design problem (NDP) faces significant uncertainty in transportation costs and demand, as it can be difficult to estimate current (and future values) of these quantities. In this paper, we present a robust optimization-based formulation for the NDP under transportation cost and demand uncertainty. We show that solving an approximation to this robust formulation of the NDP can be done efficiently for a network with single origin and destination per commodity and general uncertainty in transportation costs and demand that are independent of each other. For a network with path constraints, we propose an efficient column generation procedure to solve the linear programming relaxation. We also present computational results that show that the approximate robust solution found provides significant savings in the worst case while incurring only minor sub-optimality for specific instances of the uncertainty.     

Robust vehicle routing problem with deadlines and travel time/demand uncertainty

In this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved.     

Application of fuzzy decision making to the fuzzy finite element method

In this paper we present a new approach to handle uncertainty in the Finite Element Method. As this technique is widely used to tackle real-life design problems, it is also very prone to parameter-uncertainty. It is hard to make a good decision regarding design optimization if no claim can be made with respect to the outcome of the simulation. We propose an approach that combines several techniques in order to offer a total order on the possible design choices, taking the inherent fuzziness into account. Additionally we propose a more efficient ordering procedure to build a total order on fuzzy numbers.     

Integrated facility location and production scheduling in multi-generation energy systems

In this paper, we investigate the energy system design problems with the multi-generation technologies, i.e., simultaneous generation of multiple types of energy. Our results illustrate the economic value of multi-generation technologies to reduce spatio-temporal demand uncertainty by risk pooling both within and across different facilities.     

Robust Capacity Assignment in Telecommunications

In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another.     

Dynamic dairy facility location and supply chain planning under traffic congestion and demand uncertainty: A case study of Tehran

In this paper, dynamic dairy facility location and supply chain planning are studied through minimizing the costs of facility location, traffic congestion and transportation of raw/processed milk and dairy products under demand uncertainty. The proposed model dynamically incorporates possible changes in transportation network, facility investment costs, monetary value of time and changes in production process. In addition, the time variation and the demand uncertainty for dairy products in each period of the planning horizon is taken into account to determine the optimal facility location and the optimal production volumes. Computational results are presented for the model on a number of test problems. Also, an empirical case study is conducted in order to investigate the dynamic effects of traffic congestion and demand uncertainty on facility location design and total system costs.     

Capacity planning and warehouse location in supply chains with uncertain demands

We discuss the strategic capacity planning and warehouse location problem in supply chains operating under uncertainty. In particular, we consider situations in which demand variability is the only source of uncertainty. We first propose a deterministic model for the problem when all relevant parameters are known with certainty, and discuss related tractability and computational issues. We then present a robust optimization model for the problem when the demand is uncertain, and demonstrate how robust solutions may be determined with an efficient decomposition algorithm using a special Lagrangian relaxation method in which the multipliers are constructed from dual variables of a linear program.     

Decomposition for adjustable robust linear optimization subject to uncertainty polytope

We present in this paper a general decomposition framework to solve exactly adjustable robust linear optimization problems subject to polytope uncertainty. Our approach is based on replacing the polytope by the set of its extreme points and generating the extreme points on the fly within row generation or column-and-row generation algorithms. The novelty of our approach lies in formulating the separation problem as a feasibility problem instead of a max–min problem as done in recent works. Applying the Farkas lemma, we can reformulate the separation problem as a bilinear program, which is then linearized to obtained a mixed-integer linear programming formulation. We compare the two algorithms on a robust telecommunications network design under demand uncertainty and budgeted uncertainty polytope. Our results show that the relative performance of the algorithms depend on whether the budget is integer or fractional.     

Uncertain models for single facility location problems on networks

In practical location problems on networks, the vertex demand is usually non-deterministic. This paper employs uncertainty theory to deal with this non-deterministic factor in single facility location problems. We first propose the concepts of satisfaction degree for both vertices and the whole network, which are used to evaluate products assignment. Based on different network satisfaction degree, two models are constructed. The solution to these models is based on Hakimi’s results, and some examples are given to illustrate these models.     

Human resources management at a marine container terminal

We consider the manpower planning problem in the real context of a marine container terminal. The main features of this problem are the uncertainty of workforce demand and the need of ensuring a time continuous efficiency of the terminal, which enforces to decompose the problem into two phases: a long-period planning first and then a daily planning.We propose mathematical programming models for both problems and suitably tailor them to the container terminal at the Gioia Tauro port. We derive solution algorithms by exploiting the mathematical properties of the models: a heuristic approach to a set-covering type problem for the long-term planning, and a branch-and-bound algorithm for the short-term planning. Finally, we report computational results on some real instances.     

基于预约模式的移动充电车实时需求响应策略研究

预约模式下移动充电车实时需求响应问题是移动充电行业发展过程中的新问题,该问题包含了两类不同特点、存在动态交替影响关系的需求,不仅有时间窗约束、实时响应性要求,也有动态不确定性的特点。针对以上问题特点,本文以最大化整体收益为目标,提出联动的两阶段实时需求响应策略,引用近似动态规划求解决策未来价值,并融入到以下两阶段中：第一阶段基于多阶段随机动态决策模型与禁忌搜索算法生成了可以动态调整的充电服务方案;第二阶段基于第一阶段提出了针对动态需求的实时响应决策流程。最后,对比实验验证了本策略在不同客户规模与动态度下的有效性,并得出管理启示。本研究可以支持制定移动充电车的实时需求响应策略,对类似具有动态特征的需求响应问题具有启发意义。     

Proactive data envelopment analysis: Effective production and capacity expansion in stochastic environments

Demand fluctuations that cause variations in output levels will affect a firm’s technical inefficiency. To assess this demand effect, a demand-truncated production function is developed and an “effectiveness” measure is proposed. Often a firm can adjust some input resources influencing the output level in an attempt to match demand. We propose a short-run capacity planning method, termed proactive data envelopment analysis, which quantifies the effectiveness of a firm’s production system under demand uncertainty. Using a stochastic programming DEA approach, we improve upon short-run capacity expansion planning models by accounting for the decreasing marginal benefit of inputs and estimating the expected value of effectiveness, given demand. The law of diminishing marginal returns is an important property of production function; however, constant marginal productivity is usually assumed for capacity expansion problems resulting in biased capacity estimates. Applying the proposed model in an empirical study of convenience stores in Japan demonstrates the actionable advice the model provides about the levels of variable inputs in uncertain demand environments. We conclude that the method is most suitable for characterizing production systems with perishable goods or service systems that cannot store inventories.     

Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and gradual uncertainty resolution

In many planning problems under uncertainty the uncertainties are decision-dependent and resolve gradually depending on the decisions made. In this paper, we address a generic non-convex MINLP model for such planning problems where the uncertain parameters are assumed to follow discrete distributions and the decisions are made on a discrete time horizon. In order to account for the decision-dependent uncertainties and gradual uncertainty resolution, we propose a multistage stochastic programming model in which the non-anticipativity constraints in the model are not prespecified but change as a function of the decisions made. Furthermore, planning problems consist of several scenario subproblems where each subproblem is modeled as a nonconvex mixed-integer nonlinear program. We propose a solution strategy that combines global optimization and outer-approximation in order to optimize the planning decisions. We apply this generic problem structure and the proposed solution algorithm to several planning problems to illustrate the efficiency of the proposed method with respect to the method that uses only global optimization.     

Multicut Benders decomposition algorithm for process supply chain planning under uncertainty

In this paper, we present a multicut version of the Benders decomposition method for solving two-stage stochastic linear programming problems, including stochastic mixed-integer programs with only continuous recourse (two-stage) variables. The main idea is to add one cut per realization of uncertainty to the master problem in each iteration, that is, as many Benders cuts as the number of scenarios added to the master problem in each iteration. Two examples are presented to illustrate the application of the proposed algorithm. One involves production-transportation planning under demand uncertainty, and the other one involves multiperiod planning of global, multiproduct chemical supply chains under demand and freight rate uncertainty. Computational studies show that while both the standard and the multicut versions of the Benders decomposition method can solve large-scale stochastic programming problems with reasonable computational effort, significant savings in CPU time can be achieved by using the proposed multicut algorithm.     

Negotiations Within Supply Chains

In this paper we consider a negotiation between a supplier and its retailer. Due to the supplier's commitments with other customers the negotiation is about the maximum order quantity the retailer can order at a fixed price. We propose a structuring for the negotiation that captures two main features: First, we take into account that the supplier can strategically change its production facilities. The impact of this strategic decision is captured by the corresponding change of the supplier's cost situation. Second, we consider the uncertainty about the retailer's future demand due to its own customers. The negotiation takes place with respect to different demand scenarios, yielding a variety of possibilities of avoiding negotiation deadlocks.     

服务供应链视角下SaaS模式免费试用策略分析

针对处于市场推广期的SaaS模式中应用服务需求的不确定性,本文从服务供应链的视角对免费试用策略应对需求不确定性进行建模分析。设计了合作契约保证免费试用策略下服务供应链的协调;将免费试用策略绩效与传统的风险共担策略绩效作比较,得出免费试用策略的适用条件;通过数值分析验证了模型的有效性并得出了其管理学意义。研究表明,与风险共担策略相比,免费试用策略能够激励客户需求和有效规避SaaS模式中服务需求不确定性的风险,并提高服务供应链中各方收益;免费试用策略的适用性和绩效与应用服务提供商(ASP)技术能力水平有关;服务供应链协调可以使免费试用取得更好的效果。     

Production planning via scenario modelling

Several Linear Programming (LP) and Mixed Integer Programming (MIP) models for the production and capacity planning problems with uncertainty in demand are proposed. In contrast to traditional mathematical programming approaches, we use scenarios to characterize the uncertainty in demand. Solutions are obtained for each scenario and then these individual scenario solutions are aggregated to yield a nonanticipative or implementable policy. Such an approach makes it possible to model nonstationarity in demand as well as a variety of recourse decision types. Two scenario-based models for formalizing implementable policies are presented. The first model is a LP model for multi-product, multi-period, single-level production planning to determine the production volume and product inventory for each period, such that the expected cost of holding inventory and lost demand is minimized. The second model is a MIP model for multi-product, multi-period, single-level production planning to help in sourcing decisions for raw materials supply. Although these formulations lead to very large scale mathematical programming problems, our computational experience with LP models for real-life instances is very encouraging.     

Robust solutions to uncertain linear complementarity problems

In this paper,we adopt the robust optimization method to consider linear complementarity problems in which the data is not specified exactly or is uncertain,and it is only known to belong to a prescribed uncertainty set.We propose the notion of the p- robust counterpart and the p-robust solution of uncertain linear complementarity problems.We discuss uncertain linear complementarity problems with three different uncertainty sets,respectively,including an unknown-but-bounded uncertainty set,an ellipsoidal uncertainty set and an intersection-of-ellipsoids uncertainty set,and present some sufficient and necessary(or sufficient) conditions which p- robust solutions satisfy.Some special cases are investigated in this paper.