需求可变性降低对均值CVaR约束销售努力决策库存系统的影响

本文运用Levy提出的变换研究需求可变性降低对风险偏好零售商的库存决策、销售努力决策和期望效用的影响,用均值CVaR刻画零售商的风险偏好特性,它包括风险厌恶、风险追求,也具有损失规避的特性。首先,运用该变换定量刻画需求可变性的降低,证明该变换蕴含经典随机占优中的割准则序和二阶随机占优等。其次,给出系统的最优订货量、最优期望效用和最优销售努力水平,得到它们关于风险偏好系数的单调性,并给出降低需求可变性对期望效用的影响。第三,针对风险中性、风险厌恶(最大化CVaR)和风险追求(最小化CVaR)这三种特殊情况得到相应的结果,并给出企业在库存决策和促销决策的管理启示。最后,通过数值例子验证了得到的研究结果并给出相应的管理启示。     

区块链驱动下快递“最后一公里”共同配送的博弈分析

站在政府角度,分析在区块链驱动下快递企业是否共同配送的策略选择问题。分析政府补偿机制在解决区块链驱动下快递“最后一公里”共同配送的效用,通过演化博弈分析政府对于快递物流企业、社区的补贴的合理范围。通过分析可知:在无政府补偿机制下,单靠快递企业和社区的努力,较难彻底解决快递物流“最后一公里”发展的困境;政府需要对快递企业以及社区给予一定的政策支持,并且保证补贴有一定的力度,这样才能保证快递企业、社区有足够的动力构建基于区块链的最后一公里共同配送网络。     

����˿͹����Ŷ�ϵͳ����Ϣ����

The discriminatory processor sharing queues with multiple classes of customers (abbreviated as DPS queues) are an important but difficult research direction in queueing theory, and it has many important practical applications in the fields of, such as, computer networks, manufacturing systems, transportation networks, and so forth. Recently, researchers have carried out some key work for the DPS queues. They gave the generating function of the steady-state joint queue lengths, which leads to the first two moments of the steady-state joint queue lengths. However, using the generating function to provide explicit expressions for the steady-state joint queue lengths has been a difficult and challenging problem for many years. Based on this, this paper applies the maximum entropy principle in the information theory to providing an approximate expression with high precision, and this approximate expression can have the same first three moments as those of its exact expression. On the other hand, this paper gives efficiently numerical computation by means of this approximate expression, and analyzes how the key variables of this approximate expression depend on the original parameters of this queueing system in terms of some numerical experiments. Therefore, this approximate expression has important theoretical significance to promote practical applications of the DPS queues. At the same time, not only do the methodology and results given in this paper provide a new line in the study of DPS queues, but they also provide the theoretical basis and technical support for how to apply the information theory to the study of queueing systems, queueing networks and more generally, stochastic models.     

基于减排成本共担期权契约的供应链协调

考虑消费者具有低碳产品偏好的情况,研究需求随机且受减排影响的期权契约,建立了由单个制造商和单个零售商组成的供应链模型。该模型中制造商处主导地位,零售商处追随地位,制造商首先提出期权契约,零售商购买期权。求解发现,由于传统双重边际化效应的存在,只有当零售价格等于期权执行价格时,才能达到供应链的协调,这时零售商利润为负,不满足参与约束。为此,从降低期权执行价格的角度,对期权契约进行补充,增加了成本共担条款。研究表明,减排成本共担的期权契约能够实现供应链的协调。最后利用算例验证了结论,计算了制造商和零售商利润及零售商分担的减排成本比例随期权价格和期权执行价格的变化情况,并对减排难度系数的敏感性做了分析。     

Optimal policies for inventory systems with discretionary sales, random yield and lost sales

We determine replenishment and sales decisions jointly for an inventory system with random demand, lost sales and random yield. Demands in consecutive periods are independent random variables and their distributions are known. We incorporate discretionary sales, when inventory may be set aside to satisfy future demand even if some present demand may be lost. Our objective is to minimize the total discounted cost over the problem horizon by choosing an optimal replenishment and discretionary sales policy. We obtain the structure of the optimal replenishment and discretionary sales policy and show that the optimal policy for finite horizon problem converges to that of the infinite horizon problem. Moreover, we compare the optimal policy under random yield with that under certain yield, and show that the optimal order quantity （sales quantity） under random yield is more （less） than that under certain yield.     

多重圈梯图在射影平面上的嵌入个数

图在不同亏格曲面上的嵌入个数常常有相关关系,因此,分析一些图类在小亏格曲面上的嵌入个数对最终确定图的亏格分布和完全亏格分布有着重要意义,本文利用嵌入的联树模型得出了多重圈梯图在射影平面上的嵌入个数.     

Stochastic chance constrained mixed-integer nonlinear programming models and the solution approaches for refinery short-term crude oil scheduling problem

Stochastic chance constrained mixed-integer nonlinear programming (SCC-MINLP) models are developed in this paper to solve the refinery short-term crude oil scheduling problem which concerns crude oil unloading, mixing, transferring and multilevel inventory control under demands uncertainty of distillation units. The objective of these models is the minimum expected value of total operation cost. It is the first time that the uncertain demands of Crude oil Distillation Units (CDUs) in these problems are set as random variables which have discrete and continuous joint probability distributions. This situation is close to the real world industry use. To reduce the computation complexity, these SCC-MINLP models are transformed into their equivalent stochastic chance constrained mixed-integer linear programming models (SCC-MILP). Stochastic simulation and stochastic sampling technologies are introduced in detail to solve these complex SCC-MILP models. Finally, case studies are effectively solved with the proposed approaches.     

FJ中子屏蔽层设计及虚拟装配

基于单元块的概念设计,对FJ中子屏蔽层进行了空间布局,并提出命名方法。基于真空室扇区与扇区接口确定的虚拟设计空间,将三维模型特征数字化。通过反求设计方法,对FJ中子屏蔽层进行了结构设计。为缩短设计周期,提高设计效率,采用了骨架建模和Instance建模方法。同时,对FJ中子屏蔽层进行了虚拟装配。     

基于Polar码的水声通信信源信道联合译码方法

水声信道时延扩展较长,频域选择性衰落严重,导致水声通信提升可靠性困难.同时,水声通信实际发送的信源中通常存在残留冗余,传统方法难以利用这部分冗余,从而导致一定的带宽浪费.针对该问题,提出了一种基于Polar码的水声通信信源信道联合译码方法.该方法根据Polar码的译码结构,以信源状态转移关系为基础构建信源信道联合译码网...