仓库容量有限条件下的随机存贮管理2

讨论了仓库容量有限条件下的随机存贮管理优化问题,认为时间是连续分布的.对于存贮一种商品的问题,根据订货点和自己仓库容量的关系分两种情况讨论,得到平均损失费与订货点、到货时间之间的关系式,利用实测数据拟合出到货时间的概率密度,建立了以平均损失费用的数学期望为目标函数的最优化模型,并使用MATLAB数学软件进行求解,得到三种商品的最优订货点分别为41,37和36.经过分析得知仓库容量与销售速率的比例、单位商品的损失费均对确定订货点都有重要影响.对于存贮多种商品的问题,根据到货时间的取值范围与两个时间临界点(销售完租借仓库中某种商品的时间和销售完所有该种商品的时间)之间的位置关系,将每种商品分为六种情况,m种商品组合起来,就有6()种不同情况,在此基础上,以m种商品的总体平均损失费用的数学期望作为目标函数,建立问题的最优化模型.针对题目中给出的三种商品的情形进行求解,得到最优订货点L*=4.807.最后,对销售速率随机的情形建立模型并进行了讨论.     

仓库容量有限条件下的随机存贮管理

讨论了仓库容量有限条件下的随机存贮管理优化问题,认为时间是连续分布的.对于存贮一种商品的问题,根据订货点和自己仓库容量的关系分两种情况讨论,得到平均损失费与订货点、到货时间之间的关系式,利用实测数据拟合出到货时间的概率密度,建立了以平均损失费用的数学期望为目标函数的最优化模型,并使用MATLAB数学软件进行求解,得到三种商品的最优订货点分别为41,37和36.经过分析得知仓库容量与销售速率的比例、单位商品的损失费均对确定订货点都有重要影响.对于存贮多种商品的问题,根据到货时间的取值范围与两个时间临界点(销售完租借仓库中某种商品的时间和销售完所有该种商品的时间)之间的位置关系,将每种商品分为六种情况,m种商品组合起来,就有6m种不同情况,在此基础上,以m种商品的总体平均损失费用的数学期望作为目标函数,建立问题的最优化模型.针对题目中给出的三种商品的情形进行求解,得到最优订货点L*=4.807.最后,对销售速率随机的情形建立模型并进行了讨论.     

仓库容量有限条件下的随机存贮管理模型

以商场的商品销售与存贮为研究对象,建立了一类在仓库容量有限条件下的存贮管理决策模型,并给出了最优存贮策略.针对某个大型超市的三种商品的真实销售数据,我们运用该模型分析求解得出了三种商品的最优订货点L*分别为35、39和40.结合销售存贮管理中的实际情况,我们针对商场同时订购多种商品时的情况对模型进行了初步推广,并依据此推广模型得出了在同时订购三种商品时的最优订货点L*为7.2.最后我们进一步讨论了在商品销售率随存贮时间发生变化及存贮变质性商品时的存贮管理决策模型,以便满足不同商家的订货和存贮策略.     

考虑仓库容量扩张的多周期随机存贮模型——折扣准则

研究了仓库容量可以控制的、基于折扣准则的多周期随机存贮模型.利用马氏决策过程(MDP)的方法,建立了最小折现成本所满足的最优方程,在此基础上,得到了一个(Ut*,yt*(b))结构的最优策略:当仓库容量小于Ut*时将容量扩充到Ut*,并订货至Ut*;否则保持仓库容量不变,且当存贮量小于yt*(b)时订货到yt*(b),反之不订货.     

需求依赖于展示区库存水平的易腐品订购和转运策略

本文主要研究易腐品零售商的订货和转运策略。零售商的库存分为两部分,即展示区/货架库存和仓库库存。零售商定期向供应商订货,零售商收到订购的商品首先将其中一部分商品存放在展示区中,余下的部分储存在仓库。展示区的空间是有限的,并且需求依赖于展示区商品的库存量。本文首先建立了以平均利润最大化为目标的库存优化模型并对模型最优解的存在性进行了分析,然后得到了求解最优订购量、转运量、转运时间间隔以及再订购点的算法,最后给出了不同参数条件下的算例。     

区域二级应急救援系统多救援点协同策略研究

主要研究在需求不确定的救援环境下,由一个区域救援总站和多个地方救援点组成的二级应急救援系统多种救援物资协同共享问题.各地方救援点对救援物资的需求为随机模糊变量,当某一地方救援点救援物资不足时,可以通过不同的协同方式进行应急补库,所有应急补库方式均考虑了地方救援点的优先级.据此建立了在一定服务满足率条件下以救援时间最短为目标函数的模型,结合随机模糊变量模拟和PSO、PSO-SA算法对模型进行了求解.最后对各种协同方式进行了对比并分析了相关变量的敏感性.结果表明:允许完全转运的协同共享方式能有效地缩短救援时间.     

顾客部分延期付款下两级商业信用易腐品订货策略

针对易腐品的经济订货批量问题展开研究。在供应商给零售商提供延迟还款的同时,零售商也给顾客提供部分延期还款条件。分五种情况分别讨论零售商的成本构成,并由此建立数学模型以求解最优订货周期使得零售商单位时间总成本最小化。通过数学证明得到了目标函数的解析性质,结果显示每种情况下在可行域范围内至多存在一个极小值点。以此为基础给出了相应的命题以有效地确定零售商的最优决策。最后通过数值算例说明了模型的有效性。     

基于混合算法的实时订货信息下的车辆调度优化

实时订货信息下的车辆调度是随机性车辆调度中货物需求量、需求点均不确定的情况下的车辆调度.针对该问题,本文构建了配送总成本最小的目标函数,提出了采用混合算法求解的思路.即以局部搜索法求得初始解,采用遗传算法优化初始解,并在送货时间更新后,利用禁忌搜索法求解速度快的特点改进调度方案,得到订货信息不断更新的条件下的车辆调度方案.通过实例分析,本方法既可解决电子商务条件下实时订货的车辆调度问题,也具有求解结果可靠、求解过程快速的特点.     

提前期需求为模糊随机条件下的连续库存补货策略

考虑提前期内需求为模糊随机变量且提前期为可缩短情形下,建立由购买商和供应商所组成的简单供应链连续库存补货策略优化模型,其中订单量、再订货点和提前期为决策变量.首先推导出模糊随机需求条件下购买商和供应链的成本函数,然后,进一步考虑总需求为三角模糊数,推导出供应商、购买商和供应链的模糊成本函数.在此基础上分别从购买商成本最小和供应链成本最小角度对模型进行求解,结合具体算例对模型进行应用分析和比较分析,结果表明模型具有有效性和实用性,并得出如下结论:从购买商本身角度考虑订购策略所产生的供应链成本总是大于从供应链整体角度考虑订货策略所产生的供应链成本,同时从购买商本身角度考虑订货策略所产生的最优订购量、购买商成本低于从供应链整体角度考虑订货策略所产生的最优订购量、购买商成本.     

仓库容量有限条件下允许缺货的两类存贮模型

研究了仓库容量有限条件下允许缺货的两类存贮问题,建立了使用租借仓库时相应的存贮模型,给出了最优存贮策略.     

A new data envelopment analysis model with fuzzy random inputs and outputs

This paper first presents several formulas for mean chance distributions of triangular fuzzy random variables and their functions, then develops a new class of fuzzy random data envelopment analysis (FRDEA) models with mean chance constraints, in which the inputs and outputs are assumed to be characterized by fuzzy random variables with known possibility and probability distributions. According to the established formulas for the mean chance distributions, we can turn the mean chance constraints into their equivalent stochastic ones. On the other hand, since the objective in the FRDEA model is the expectation about the ratio of the weighted sum of outputs and the weighted sum of inputs for a target decision-making unite (DMU), for general fuzzy random inputs and outputs, we suggest an approximation method to evaluate the objective; and for triangular fuzzy random inputs and outputs, we propose a method to reduce the objective to its equivalent stochastic one. As a consequence, under the assumption that the inputs and the outputs are triangular fuzzy random vectors, the proposed FRDEA model can be reduced to its equivalent stochastic programming one, in which the constraints contain the standard normal distribution function, and the objective is the expectation for a function of the normal random variable. To solve the equivalent stochastic programming model, we design a hybrid algorithm by integrating stochastic simulation and genetic algorithm (GA). Finally, one numerical example is presented to demonstrate the proposed FRDEA modeling idea and the effectiveness of the designed hybrid algorithm.     

Order Quantities with Temporary Price Reductions

The temporary price-change problem is studied, in which the objective is to minimize discounted cash flows. As pointed out by Goyal in an earlier paper, only the cash transactions at purchase times (i.e. the payments for the goods and the ordering costs) were considered. The cash flows associated with `inventory maintenance' costs which occur more or less continuously over time were neglected, which changes the structure of the model. Examples of these costs include storage, insurance, record-keeping, deterioration and obsolescence costs. In this paper, these continuously generated cash flows are included in the analysis, thereby making the new model more applicable to practical situations. This model is of interest because order-quantity decisions often must be made under conditions of both temporary price reductions and/or imminent price increases. These changes occur frequently in practice.     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

Risk-control approach for bottleneck transportation problem with randomness and fuzziness

Solving transportation problems is essential in engineering and supply chain management, where profitability depends on optimal traffic flow. This study proposes risk-control approaches for two bottleneck transportation problems with random variables and preference levels to objective functions with risk parameters. Each proposed model is formulated as a multiobjective programming problem using robust-based optimization derived from stochastic chance constraints. Since it is impossible to obtain a transportation pattern that optimizes all objective functions, our proposed models are numerically solved by introducing an aggregation function for the multiobjective problem. An exact algorithm that performs deterministic equivalent transformations and introduces auxiliary problems is also developed.     

On distributionally robust multiperiod stochastic optimization

This paper considers model uncertainty for multistage stochastic programs. The data and information structure of the baseline model is a tree, on which the decision problem is defined. We consider “ambiguity neighborhoods” around this tree as alternative models which are close to the baseline model. Closeness is defined in terms of a distance for probability trees, called the nested distance. This distance is appropriate for scenario models of multistage stochastic optimization problems as was demonstrated in Pflug and Pichler (SIAM J Optim 22:1–23, 2012). The ambiguity model is formulated as a minimax problem, where the the optimal decision is to be found, which minimizes the maximal objective function within the ambiguity set. We give a setup for studying saddle point properties of the minimax problem. Moreover, we present solution algorithms for finding the minimax decisions at least asymptotically. As an example, we consider a multiperiod stochastic production/inventory control problem with weekly ordering. The stochastic scenario process is given by the random demands for two products. We determine the minimax solution and identify the worst trees within the ambiguity set. It turns out that the probability weights of the worst case trees are concentrated on few very bad scenarios.     

Price-sensitive demand for perishable items - an EOQ model

This paper develops a finite time-horizon deterministic EOQ (Economic Order Quantity) model where the rate of demand decreases quadratically with selling price. Prices at different periods are considered as decision variables. The objective is to find the optimal ordering quantity and optimal sales prices that maximizes the vendor’s total profit. The results are discussed with numerical examples. Sensitivity analysis of the optimal solution with respect to the key parameters of the system is carried out.     

一类随机多目标二次线性规划模型的交互式算法

针对线性约束条件下带有一个二次目标函数和多个线性目标函数的随机多目标决策问题，借助参考方向法和权重法对该决策问题的期望值模型进行标量化，获得了关于期望值模型的（恰当／弱）有效解的充要条件，引入Ａｃｈｉｅｖｅｍｅｎｔ函数建立了一类随机多目标二次线性规划模型的交互式计算方法．     

Time response of structure with interval and random parameters using a new hybrid uncertain analysis method

Practical structures often operate with some degree of uncertainties, and the uncertainties are often modelled as random parameters or interval parameters. For realistic predictions of the structures behaviour and performance, structure models should account for these uncertainties. This paper deals with time responses of engineering structures in the presence of random and/or interval uncertainties. Three uncertain structure models are introduced. The first one is random uncertain structure model with only random variables. The generalized polynomial chaos (PC) theory is applied to solve the random uncertain structure model. The second one is interval uncertain structure model with only interval variables. The Legendre metamodel (LM) method is presented to solve the interval uncertain structure model. The LM is based on Legendre polynomial expansion. The third one is hybrid uncertain structure model with both random and interval variables. The polynomial-chaos-Legendre-metamodel (PCLM) method is presented to solve the hybrid uncertain structure model. The PCLM is a combination of PC and LM. Three engineering examples are employed to demonstrate the effectiveness of the proposed methods. The uncertainties resulting from geometrical size, material properties or external loads are studied.     

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization

Interpolation-based trust-region methods are an important class of algorithms for Derivative-Free Optimization which rely on locally approximating an objective function by quadratic polynomial interpolation models, frequently built from less points than there are basis components. Often, in practical applications, the contribution of the problem variables to the objective function is such that many pairwise correlations between variables are negligible, implying, in the smooth case, a sparse structure in the Hessian matrix. To be able to exploit Hessian sparsity, existing optimization approaches require the knowledge of the sparsity structure. The goal of this paper is to develop and analyze a method where the sparse models are constructed automatically. The sparse recovery theory developed recently in the field of compressed sensing characterizes conditions under which a sparse vector can be accurately recovered from few random measurements. Such a recovery is achieved by minimizing the ℓ ₁-norm of a vector subject to the measurements constraints. We suggest an approach for building sparse quadratic polynomial interpolation models by minimizing the ℓ ₁-norm of the entries of the model Hessian subject to the interpolation conditions. We show that this procedure recovers accurate models when the function Hessian is sparse, using relatively few randomly selected sample points. Motivated by this result, we developed a practical interpolation-based trust-region method using deterministic sample sets and minimum ℓ ₁-norm quadratic models. Our computational results show that the new approach exhibits a promising numerical performance both in the general case and in the sparse one.