以库存成本为中心的航空备件决策分析

在分析库存成本的基础上,根据等周期补货原则,确定了在一定时间跨度内的缺货时间点、补货时间点及每次的补充量;根据补货周期内部缺货的时间长度与周期长度界定了库存服务水平;最后通过算例对备件决策中的各要素与库存成本的关系进行了分析.     

三级备件保障系统下的备件库存优化模型

目前我军装备备件保障通常采用三级保障模式,以各级备件期望短缺数量之和最小为目标,研究在不同库存水平条件下,三级备件保障系统的备件库存优化模型.经示例分析,验证了该模型的可行性和有效性,该结果可为多级备件保障提供理论依据.     

智能电表最优更换及备件库存联合决策

智能电表是智能电网运行的关键部件,提高其可靠性和可用度对保证电力的持续不间断供应和准确电能测量至关重要。充足的智能电表库存是其换装与维修的基本保障。本文基于智能电表的故障特性和换装需求分析,建立了智能电表的最优更换与备件库存联合决策模型,并给出了优化方法,以求得可以使系统长期平均运营成本最小的最优更换与备件库存策略。     

典型串并联系统的备件库存优化模型

选取典型串并联系统的备件库存优化为研究对象,以系统供应可用度最大为目标,备件总购置费为约束条件构建备件库存优化模型,给出基于边际分析法的优化算法.经示例分析,验证了该模型的可行性和有效性,结果可为备件保障经费的合理配置提供理论依据.     

电子商务环境下考虑退货的选址库存问题模型与算法

选址库存问题(location inventory problem, LIP)是物流系统集成的经典问题之一,也是企业需要面对的管理决策难题。本文考虑在电子商务环境下无质量缺陷的退货商品可简单再包装后重新进入销售市场这一现实情况,对设施选址和库存控制进行集成优化,构建随机需求下有退货的LIP模型。针对此问题求解的复杂性,设计了改进的自适应混合差分进化算法对模型进行整体求解。最后,通过多组算例验证了模型和算法的实用性和优越性,可为设施选址、库存控制和商品配送回收决策提供重要参考依据。     

应对突发状况的装备备件供应网络虚拟库存策略研究

研究突发状况引起装备维修备件需求大增时,供应网络中维修站点备件库存策略问题.基于多维修站点的虚拟库构建应对突发状况的备件库存期望成本模型,考虑突发状况的发生概率和突发状况对维修站点的影响概率,比较分析了突发状况发生引起维修需求大增的情况下,维修站点独立应对和构建虚拟库横向联合应对的库存期望成本,通过算例对这两种库存期望成本模型进行了数值分析,验证了构建虚拟库应对突发状况的有效性.     

备件品种选择的rough方法

分析了影响备件储备品种选择的重要性、可更换性、消耗性、获得难度和经济性等五个因素,利用粗集方法,按条件属性的不同顺序对备件储备品种的选择规则进行了约简,根据工程实践,从中选择一个更加合理的约简结果作为最终的备件储备品种的选择规则,并得到了相应的决策算法.该方法能够克服各影响因素在备件品种选择过程中的影响不足或影响过强等弱点,具有简单、操作方便等特点,为导弹武器装备备件保障部门选择导弹备件品种提供了一种新的理论依据.     

一个基于运输规模经济的库存选址模型

介绍了一种新的配送中心(DC)选址模型,在该模型中考虑了一般库存和安全库存成本,同时把从供应商到DC的运输成本也结合进去综合考虑,运输成本是由固定成本加可变成本两部分组成,反映了运输规模经济.     

战时备件配送的MDVRPTW问题研究

战时备件配送的车辆调度是提高装备保障效率的关键因素.以装备效能损失最小化为车辆调度的目标,建立了问题的M DVRPTW模型,并应用蚁群算法对问题进行了求解.算法中,根据问题特征改进了状态转移规则,设计了串行和并行两种路线构造方法,并应用局部搜索模块对蚂蚁构造的路线进行改进.对算例的计算实验表明,串行路线构造方法在精度和速度两方面均优于并行路线构造方法.     

随机需求下选址——库存问题

在由多个零售商和多个分销中心组成的供应链网络中，零售商的数量及位置已给定，零售商处的顾客需求是随机的。优化决策是确定分销中心的数量和位置、每个分销中心负责的零售商组、各零售商的订货策略，目标是使系统长期运行下的总成本达到最小。将这种选址——库存问题建模为整数线性规划模型，利用拉格朗日松弛方法和启发式算法分别获得问题的上下界，然后设计求解算法，并通过大量的算例考察算法的有效性。     

一类应急服务设施选址问题的模型及算法

在分析城市应急服务设施选址问题基础上,建立了限定期条件下应急服务设施选址问题的数学模型,提出了一种基于遗传算法的应急服务设施选址模型的有效算法,并通过算例分析验证了该方法的有效性.     

需求不确定的服务设施网络设计模型鲁棒性研究

由于选址决策的长期性,参数面临随机波动,在选址问题中考虑不确定因素至关重要。在选址模型中提出一种新的鲁棒方法,采用有界对称的“盒子”作为不确定需求的集合,通过调节不确定预算,来权衡解的鲁棒性与系统成本之间的关系。利用该方法得到的鲁棒模型不仅能够转化成线性规划,并且可以计算出设施的最低服务水平。然后,设计禁忌搜索算法来求解该问题,数值算例的结果表明了算法的有效性。最后,分析了不同鲁棒水平下,服务设施网络不同的拓扑结构,并得到服务水平与成本之间的权衡关系。同时对需求扰动作了敏感性分析,结果表明随着服务水平的提高,成本对需求扰动越来越敏感。     

提前期不确定条件下的预防性维修备件存储模型研究

在考虑预防性维修周期和提前期不确定的条件下,分别研究备件存储与其相关的维修费用、缺货费用、库存费用以及订购费用等四种费用之间的关系,明确了备件存储量对各项费用的影响.以各项费用总和最小化为目标,构建了提前期不确定条件下的预防性维修备件存储模型.通过备件存储模型的构建,对备件存储过程中的各项成本进行分析,以期对备件库存策略的确定给出一种解决方案.     

Numerical Approach of Multi-Objective Optimal Control Problem in Imprecise Environment

In this paper, realistic production-inventory models without shortages for deteriorating items with imprecise holding and production costs for optimal production have been formulated. Here, the rate of production is assumed to be a function of time and considered as a control variable. Also the demand is time dependent and known. The imprecise holding and production costs are assumed to be represented by fuzzy numbers which are transformed to corresponding interval numbers. Following interval mathematics, the objective function is changed to respective multi-objective functions and thus the single-objective problem is reduced to a multi-objective decision making(MODM) problem. The MODM problem is then again transformed to a single objective function with the help of weighted sum method and then solved using global criteria method, calculus method, the Kuhn–Tucker conditions and generalized reduced gradient(GRG) technique. The models have been illustrated by numerical data. The optimum results for different objectives are obtained for different types of production function. Numerical values of demand, production function and stock level are presented in both tabular and graphical forms     

Aggregation and disaggregation in hierarchical production planning

This paper reports on a simulation study of hierarchical planning procedures, which can support a material requirements planning system. Data for this study have been obtained from a Swedish manufacturing company. The three final products considered in the simulations represent a major part of this company.An aggregate plan in terms of product groups and machine groups is derived with the aid of an aggregate model. This plan is then disaggregated by changing order release times obtained from material requirements planning, and by distributing extra capacity among individual machines.The results indicate that our methods in general perform significantly better than a comparable reference case without the supporting hierarchical planning process. In our simulation experiments we evaluate different design features, like disaggregation procedures and methods for aggregating items and machines.     

有服务时长和服务可选择性的快递车辆调度在线策略研究

针对快递揽件需求出现无法提前获知、服务每一个快递需求需要一定的服务时长,且无法接受全部请求的情形,提出带有服务时长和服务可选择性的快递车辆在线调度问题,证明了该问题在线策略竞争比的下界。在正半轴上提出Replan策略,在直线上提出ReOPT策略,在一般网络上提出GRH策略,证明了上述在线策略的竞争比。结果表明,考虑服务时长能够改善在线策略的竞争性能,所提在线策略在实际应用中具有实用性。结论将为快递车辆的科学调度提供理论依据。     

The Economic Lot Scheduling Problem without Capacity Constraints

This study presents a comprehensive analysis on the Economic Lot Scheduling Problem (ELSP) without capacity constraints. We explore the optimality structure of the ELSP without capacity constraints and discover that the curve for the optimal objective values is piecewise convex with repsect to B, i.e., the values of basic period. The theoretical properties of the junction points on the piecewise convex curve not only provides us the information on “which product i” to modify, but also on “where on the B-axis” to change the set of optimal multpliers in the search process. By making use of the junction points, we propose an effective search algorithm to secure a global optimal solution for the ELSP without capacity constraints. Also, we use random experiments to verify that the proposed algorithm is efficient. The results in this paper lay important foundation for deriving an efficient heuristic to solve the conventional ELSP with capacity constraints.     

带覆盖需求约束的设施选址问题

带覆盖需求约束的设施选址问题(FLPWCDL)研究:客户必须在规定的响应半径内被服务,并要求服务站能够覆盖规定的需求数量,如何选择合适的服务站,使总成本(建站成本+路线成本)最小.FLPWCDL广泛应用于应急服务、物流、便利店等服务站的选址.建立了问题的混合整数规划模型,并构造了求解FLPWCDL的Benders分解算法,计算实验显示Benders分解算法具有非常高的求解效率与求解质量.     

Optimal pricing and production in an inventory model

This paper deals with the problem of simultaneously determining the optimal price policy and production rate over a given planning horizon. For nonlinear demand functions and convex inventory and shortage cost functions the optimal solution paths are derived by using optimal control theory. The treatment of linear nonsmooth cost functions requires the use of a generalized maximum principle. The solution method is a phase portrait analysis providing insight into the optimal pricing and production policies as well as the resulting inventory paths. Moreover, it is shown that in the case of nonsmooth piecewise linear cost functions the equilibrium is approached within finite time although the model is nonlinear in the control variables. Finally it is illustrated that exogenous fluctuations in the demand rate (seasonal demand pattern) amount to cyclical optimal solutions.     

Variational approach to serial multilevel production/inventory systems

We discuss stochastic, continuous-time models of serial multilevel production/inventory systems using quasi-variational inequalities. The value functions are characterized as maximum solutions of suitable equivalent problems. Then, we show how to construct optimal centralized policies and, if possible, decentralized policies. Finally, we present some numerical examples for the deterministic case.The work of the second author was supported by the National Science Foundation under Grant No. DMS-87-02236.