易逝品联合采购订货决策分析

采购联盟成员间的信息不完全,彼此均以对方的期望需求作为对方实际需求的估计.针对易逝品的特点,提出了调剂价格的特殊约束条件并建立了联盟期望利润模型,最后进行了数值仿真.研究表明:联合采购使联盟总体利润得到改善,但不能使联盟成员的利润都得到改善.     

On a responsive replenishment system: a fuzzy logic approach

In today's competitive business environment, it is important that customers are able to obtain their preferred items in the shops they visit, particularly for convenience store chains such as 7–Eleven where popular items are expected to be readily available on the shelves of the stores for buyers. To minimize the cost of running such store chains, it is essential that stocks be kept to a minimum and at the same time large varieties of popular items are available for customers. In this respect, the replenishment system needs to be able to cope with the taxing demands of minimal inventory but at the same time keeping large varieties of needed items. This paper proposes a replenishment system which is able to respond to the fluctuating demands of customers and provide a timely supply of needed items in a cost–effective way. The proposed system embraces the principle of fuzzy logic which is able to deal with uncertainties by virtue of its fuzzy rules reasoning mechanism, thereby leveraging the responsiveness of the entire replenishment system for the chain stores. To validate the feasibility of the approach, a case study has been conducted in an emulated environment with promising results.     

基于水化学和环境同位素的准格尔煤田地下水循环特征

为揭示准格尔煤田地区地下水循环特征,运用水化学技术、水汽轨迹模型和环境同位素等方法分析不同水体水化学特征、环境同位素特征、大气降水主要来源、地表水及地下水转化关系。结果表明:地表水矿化度低,呈弱碱-偏碱性,水化学类型以HCO_3·SO_4·Cl-Ca型水为主;地下水整体矿化度低,偏弱碱性,主要以HCO_3-Na·Ca型、Cl-Na型、HCO_3-Ca·Mg型、HCO_3·Cl-Na型水为主;黄河水δ(D)平均值为-79.6‰、δ(~(18)O)平均值为-10.47‰,第四系地下水δ(D)平均值为-66.25‰、δ(~(18)O)平均值为-9.1‰,白垩系地下水δ(D)值为-70.6‰、δ(~(18)O)值为-9.3‰,石炭-二叠系地下水δ(D)平均值为-77.07‰、δ(~(18)O)平均值为-9.9‰,寒武-奥陶系地下水δ(D)平均值为-75.73‰、δ(~(18)O)平均值为-10.06‰;大气降水受极地气团和季风影响,主要来源为西风带水汽、地表水和地下水水汽蒸发再循环;断层带、褶皱轴部裂隙带为不同含水层间主要导水通道,大气降水和黄河为地下水主要补给来源;高承压水头寒武-奥陶系岩溶裂隙水越流补给第四系松散孔隙水和砂岩裂隙水,第四系松散孔隙水通过地层间不整合接触面裂隙发育带向下补给石炭-二叠系砂岩裂隙水,黄河水对寒武-奥陶系地下水的补给比例受地质构造发育的影响较大。     

差分进化算法在模糊多资源约束联合补货模型中的应用

本文用三角模糊数表示不确定的资金约束,用梯形模糊数表示不确定的存储空间约束,构建了模糊规划联合补货模型,目标函数为最小化订货成本、库存持有成本和运输成本,决策变量为基本补充周期和每种产品的补充周期。通过对变异算子与选择操作进行变化,设计了改进的差分进化算法对模型进行求解,并通过实例证实了模型与算法的科学合理性。     

联合补充库存的拉格朗日松弛与退火算法

针对确定性需求的联合生产补充(JRP)问题,有多种启发式算法,但这些算法或不能保证最优或计算复杂。本文利用现代优化方法模拟退火算法和拉格朗日松驰算法,设计出一种新的算法,通过算例表明该算法可得出较优的可行解,可以更有效地解决实际问题。     

无线可充能传感器网络的锚点算法与移动设备调度研究

由于传感器的电池容量和存储容量有限,导致无法持续对传感器进行能量补充并收集传感器生成的感测数据。针对该问题,研究了周期性能量补充和数据收集问题,提出了一种用于充能和数据收集的方法,包括基于网格的算法(GBA)、基于支配集的算法(DSBA)和基于圆相交的算法(CIBA)。通过这三种方法或两两相结合的方法找到锚点集合,通过移动设备调度算法调度最小数量的移动设备来访问生成的锚点。仿真结果验证了所提方法的有效性。与联合能量数据采集(JEDA)算法、最小覆盖圆(SEC)算法相比,所提CIBA需要的移动设备数量最少,总移动距离也最短,具有良好的综合性能。     

基于分组策略的补货配送问题优化模型

针对已存在的供应链环境下较少考虑补货配送问题中的分组配送策略,结合大量零售商对单一产品需求量不同等特点,引入分组的决策变量.根据配送中心补货周期与配送次数的函数关系,以最小化三级供应链系统的平均总成本为目标,构建了带有配送中心能力约束的补货配送优化模型.根据优化模型的特点,利用改进的遗传算法求解模型,并进行了数据仿真试验.结果表明,该优化模型能为配送中心提供一种有效的分组配送方案,选择的优化算法更稳定快捷,能为企业提供有益的管理启迪.     

投资仓储技术的易逝品供应链管理模型

为研究仓储技术投资对易逝品供应链生产库存决策的影响,构建了由单个制造商和多个零售商构成的两级供应链模型。考虑制造商和零售商共用一个仓库并共同投资仓储技术来控制降低产品的易逝率,以供应链单位时间总成本最小化为目标,研究集成环境下供应链各方的最优决策问题。通过数值计算分析了模型中各主要参数的变化对最优策略的影响,为易逝品供应链管理决策提供了决策依据。     

橡胶坝自动化补水系统研究

橡胶坝是一种新型水工建筑物,目前我国建设的橡胶坝多达4000多座。橡胶坝在运行中,由于坝袋锚固、闸阀关闭不严等原因,坝袋经常出现缓慢自行降坝,造成坝整体不均过流。目前,主要采用原有的充排系统为坝袋补水。这种方式在运行时需要同时开启多个较大阀门、大功率水泵,费时费力,增加运行成本。橡胶坝自动化补水消除了大泵补水产生的水锤效应,解决了水锤效应对蝶阀、机泵、管路的破坏问题,延长了机泵、蝶阀、管路的使用寿命,大大提高了橡胶坝工程的运行管理水平。     

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.