不确定环境下应急救援供应链鲁棒优化模型

鉴于灾害救援运作的紧迫性和重要性,考虑需求、供应、成本等参数的不确定性,构建一个由供应商、救援配送中心和受灾区域构成的三级应急救援供应链,旨在确定救援产品数量及救援配送中心的合适位置,以最小化救援供应链总成本,最大化受灾区域满意水平为目标,采用区间数据鲁棒优化方法处理模型的不确定性,应用情景随机规划降低鲁棒优化的计算难度,最后给出一个地震案例的具体数据来证明所提救援供应链鲁棒优化模型的有效性和可行性。实验结果表明,需求保守度的变化对目标函数值的影响大于供给和成本保守度的变化,可为应急救援决策者调整不确定参数保守度提供理论支持。     

不确定需求下应急资源配置的鲁棒优化方法

考虑灾害发生时需求不确定的条件,建立了二阶段决策数学规划模型,解决针对自然灾害的应急资源配置问题.将灾害发生后的各个灾区的需求量表示为区间型数据.利用可调整鲁棒优化的思想解决含有不确定需求的资源配置模型.数值试验表明,建立的模型是实际可行的,求解方法保证了解的鲁棒性.     

基于不确定需求的鲁棒应急物流系统

近年来各类突发事件和灾难频发,严重威胁到人们的生命安全,给人们经济生活带来了巨大的影响.灾难发生后,应急物流系统的效率是救援展开的保证.分析了应急物流系统的特点,采用鲁棒规划建立数学模型解决了应急物资需求不确定下如何进行应急配送中心选址和配送计划的安排,使得我们的决策能够体现最优性与鲁棒性的均衡.数值实验表明,建立的模型是符合实际的,数值结果具有较好的鲁棒性.     

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

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

考虑风险偏好的动态生产库存问题的鲁棒优化模型

不同阶段需求不确定情况下,决策者的风险偏好和生产过程中的废品处理影响着供应链生产库存管理和供应链整体效益。本文考虑决策者风险偏好下,构建了包含I个生产者企业,一个库存点和一个废物处理基地的T阶段动态供应链生产库存框架,建立了椭球型需求不确定集下,以追求整体收益最大化为目标的不确定优化模型,并应用鲁棒优化理论得到了数据确定性线性鲁棒对应模型,讨论了模型解的可靠性和有效性。最后的算例表明,只有当决策者风险偏好参数在一定范围内时,才会存在满足条件且具有较高可靠性的鲁棒决策,验证了该鲁棒优化模型的合理性。     

到达不确定呼叫中心人员配置的鲁棒优化模型

针对呼叫中心实际运营中顾客到达不确定的特点,采用鲁棒离散优化方法,建立呼叫中心人员配置的鲁棒模型。利用对偶原理将鲁棒模型转换易于求解的线性鲁棒对等式,通过调节模型中的鲁棒参数来权衡鲁棒解的保守性与最优性之间的关系,计算模型中约束违背概率上限来表示鲁棒解的可靠性。通过现实呼叫中心数据算例,验证了模型的有效性,分析了不同鲁棒水平下各时间段服务人员配置规律,以及系统最小成本与违背概率之间的权衡关系。最后,对到达扰动系数进行了敏感性分析。     

数据不确定的鲁棒数据包络分析方法(英文)

本文研究了输出参数不确定的数据包络分析(DEA)模型.利用鲁棒优化方法,建立了一个鲁棒DEA模型,通过数值试验表明了该模型在有效性评价和排序方面的可靠性.本文的模型可处理分布未知的不确定数据,与已有的只考虑对称分布不确定参数的模型相比,适用范围更广.     

资产组合鲁棒优化模型及应用研究

本文在对资产组合鲁棒优化理论归纳总结的基础上,根据我国实际情况,考虑未来经济因素的不确定性,建立了相应的资产组合鲁棒优化模型。对基金公司的投资决策、银行卡网络资金分配、VaR约束下的资产组合选择等实际问题进行了研究。针对每一个具体问题,调整和改进了模型的目标函数和约束条件,用相应的不确定集描述有关的未来不确定经济因素,得到了鲁棒优化结果,使得资产组合决策兼具可行性和最优性。     

椭球不确定集下具有消费的投资组合鲁棒优化模型

针对含有不确定参数的优化问题,鲁棒优化作为一种有效的优化手段引起了人们的普遍关注。本文主要介绍了CVaR风险投资纽合模型,并在模型中加入消费,将椭球不确定集下鲁棒优化应用到该模型中,这不仅解决了该模型由于参数的不确定性所造成的缺陷,而且也比较符合实际情况。     

风险应对视角下不确定需求定位-路径鲁棒优化研究

及时准确地配送应急救援物资是突发公共事件救援过程中的关键环节,综合考虑应急救援过程中出现的需求随机性,路网的连通能力下降和设施点失灵等情况,采用车辆与直升机联合运输方式进行配送,以应急系统中各物资需求点的救援时间满意度之和最大、系统总成本最小及物资到达需求点的救援时间之和最小为目标,对多式联运三级网络应急物流系统定位—路径优化问题进行研究,建立了多目标定位—路径模型,并改进了遗传算法。最后,以汶川地震应急救援相关数据为例,对模型和算法的有效性进行了数据仿真验证,通过实验结果的对比分析,证明了鲁棒优化方法在处理不确定需求和设施失灵风险方面的有效性,进而为抵御突发公共事件发生后出现的风险,为解决突发公共事件发生后救援物资的安全及时准确配送提供了有效的方法。     

A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders

In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing system. We consider a multi-product capacitated, dynamic setting. We introduce a demand-based fluid model where the demand is a linear function of the price, the inventory cost is linear, the production cost is an increasing strictly convex function of the production rate and all coefficients are time-dependent. A key part of the model is that no backorders are allowed. We show that the robust formulation is of the same order of complexity as the nominal problem and demonstrate how to adapt the nominal (deterministic) solution algorithm to the robust problem.     

A Simple Inventory Replenishment Policy for Demand with Uncertainty

Research indicates that the economic order quantity is preferred to alternative techniques because it is less nervous to forecast errors. This paper attempts to establish that no statistical relationship exists between the size of forecast error and the performance of some lot-size techniques. A heuristic rule is also presented for deterministic demand. The rule does well on the examples considered and is shown to be more stable than E.O.Q.     

Competitive Multi-period Pricing for Perishable Products: A Robust Optimization Approach

We study a multi-period oligopolistic market for a single perishable product with fixed inventory. Our goal is to address the competitive aspect of the problem together with demand uncertainty using ideas from robust optimization and variational inequalities. The demand function for each seller has some associated uncertainty and we assume that the sellers would like to adopt a policy that is robust to adverse uncertain circumstances. We believe this is the first paper that uses robust optimization for dynamic pricing under competition. In particular, starting with a given fixed inventory, each seller competes over a multi-period time horizon in the market by setting prices and protection levels for each period at the beginning of the time horizon. Any unsold inventory at the end of the horizon is worthless. The sellers do not have the option of periodically reviewing and replenishing their inventory. We study non-cooperative Nash equilibrium policies for sellers under such a model. This kind of a setup can be used to model pricing of air fares, hotel reservations, bandwidth in communication networks, etc. In this paper we demonstrate our results through some numerical examples.     

证券投资组合优化问题的强健性的锥优化方法(英文)

本文研究了具有强健性的证券投资组合优化问题.模型以最差条件在值风险为风险度量方法,并且考虑了交易费用对收益的影响.当投资组合的收益率概率分布不能准确确定但是在有界的区间内,尤其是在箱型区间结构和椭球区域结构内时,我们可以把具有强健性的证券投资组合优化问题的模型分别转化成线性规划和二阶锥规划形式.最后,我们用一个真实市场数据的算例来验证此方法.     

证券投资组合优化问题的强健性的锥优化方法(英)

本文研究了具有强健性的证券投资组合优化问题.模型以最差条件在值风险为风险度量方法,并且考虑了交易费用对收益的影响.当投资组合的收益率概率分布不能准确确定但是在有界的区间内,尤其是在箱型区间结构和椭球区域结构内时,我们可以把具有强健性的证券投资组合优化问题的模型分别转化成线性规划和二阶锥规划形式.最后,我们用一个真实市场数据的算例来验证此方法.     

Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty

This paper presents a three-stage optimization algorithm for solving two-stage deviation robust decision making problems under uncertainty. The structure of the first-stage problem is a mixed integer linear program and the structure of the second-stage problem is a linear program. Each uncertain model parameter can independently take its value from a real compact interval with unknown probability distribution. The algorithm coordinates three mathematical programming formulations to iteratively solve the overall problem. This paper provides the application of the algorithm on the robust facility location problem and a counterexample illustrating the insufficiency of the solution obtained by considering only a finite number of scenarios generated by the endpoints of all intervals. This work was supported by the National Science Foundation through Grant DMI-0200162.     

考虑市场需求不确定下的供应链协调优化

在市场需求不确定的情况下,考察市场需求依赖销售价格,建立一个由单一供应商和单一零售商组成的二级退货模型,并分别从集中决策和分散决策两方面讨论,证明单纯的退货政策无法实现供应链协调,而通过引入回馈与惩罚机制后则可以实现协调,并求出此时的最优订货量和最优售价.最后,通过数值算例证明以上的结论.     

需求替代下易腐品的订货策略和定价策略研究

针对蔬菜、水果等这类在存储的过程中随时间的推移会发生大量损耗的易腐品,在激烈的市场竞争中,产品的需求不仅与本身的价格有关,而且与竞争对手产品的价格有关,零售商根据市场需求确定最优定价和订货策略以最大化自身利益,建立库存模型,证明了模型存在唯一最优策略.通过数值实验,分析得到替代程度发生变化对最优策略的影响.     

A Two-Echelon Inventory Optimization Model with Demand Time Window Considerations

This paper studies a two-echelon dynamic lot-sizing model with demand time windows and early and late delivery penalties. The problem is motivated by third-party logistics and vendor managed inventory applications in the computer industry where delivery time windows are typically specified under a time definite delivery contract. Studying the optimality properties of the problem, the paper provides polynomial time algorithms that require O(T ³) computational complexity if backlogging is not allowed and O(T ⁵) computational complexity if backlogging is allowed.     

Dynamic Network Inventory Control Model with Interval Nonstationary Demand Uncertainty

We consider a dynamic inventory control system described by a network model with an interval assigned nonstationary demand. We assume that unknown demand may take any value within the interval, which bounds depend on time. In terms of Kaucher interval arithmetic, we derive necessary and sufficient conditions for the existence of a feasible feedback control and sufficient conditions for the existence of an optimal feedback control strategy. We obtain an optimal feasible storage level and estimate the rate of the system convergence to this level. Then we develop the algorithm of finding the optimal control strategy. These results are applied to an example.