Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于栅格分层的逐栅格汇流算法并行化研究

分布式水文模型中的逐栅格汇流算法计算量大,需要借助并行计算以满足大流域长历时模拟的要求。针对目前鲜有对基于隐式有限差分的逐栅格汇流算法进行并行计算研究的情况,基于栅格分层的思想提出一种适用于共享内存并行计算环境的逐栅格汇流并行算法。该算法首先根据流向进行栅格分层,使同一层中栅格的计算相互独立,然后将同一层中栅格的计算任务分配到多个计算单元并行计算。采用C++编程语言与OpenMP并行编程库实现了该算法,并选择河北省清水河流域为实验区,在不同数据规模(30m、90m、270m分辨率)、不同核数(2～20个)以及不同栅格分层方法的情况下对算法性能进行了测试。实验结果表明本文提出的并行算法具有较好的加速比和并行效率,且并行效率随数据规模的增大而增大。栅格分层方法对算法并行性能有明显影响,从上到下的分层方法比从下到上的方法具有更高的并行效率。     

抗毁网络多拓扑路由子层的免疫优化选择算法

针对现有多拓扑路由在多故障条件下无法有效进行故障恢复的现象,根据免疫理论中抗原与抗体相匹配的原理,提出一种多拓扑路由子层选择算法.该算法以最大限度保护通信业务为目标,将多故障情形与子层相匹配的过程看作抗体与抗原相结合的过程,使子层与故障在一定范围内最大程度地相似,并利用人工免疫算法进行寻优,提高了网络抗毁性.实验结果表明,该算法可使网络在多故障条件下的恢复能力得到提高.     

Inventory sharing under decentralized preventive transshipments

We consider preventive transshipments between two stores in a decentralized system with two demand subperiods. Replenishment orders are made before the first subperiod, and the stores may make transshipments to one another between the subperiods. We prove that the transshipment decision has a dominant strategy, called a control‐band conserving transfer policy, under which each store chooses a quantity to transship in or out that will keep its second‐subperiod starting inventory level within a range called a control band. We prove that the optimal replenishment policy is a threshold policy in which the threshold depends on the capacity level at the other store. Finally, we prove that there does not exist a transfer price that coordinates the decentralized supply chain. Our research also explains many of the differences between preventive and emergency transshipments, including differences in the optimal transfer policies and the existence or nonexistence of transfer prices that coordinate the system. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

基于多QoS约束的启发式路由选择算法设计与实现

针对时延、路由跳数以及网络资源利率3种约束，结合软件路由器项目，对路由选择算法的网络模型进行了描述和定义，并提出了基于多QoS约束的启发式路由选择算法（H_MCP）。通过在软件路由器上实现和测试，表明该算法具有可行性和启发性。     

船用反应堆堆芯放射性核素总量计算

采用KORIGEN程序对船用堆的堆芯放射性核素总量进行了计算,并对连续满功率运行和实际变功率运行的计算结果进行了分析与比较,探讨了放射性核素总量随功率运行史的变化规律.     

一种使用可用度备件库存模型

阐述了以装备战备完好性为中心的备件库存控制的基本原理,并给出了以可用度为中心的备件库存数学模型.该模型可计算装备细目结构中的所有组件在各级维修机构中的库存水平,在满足一定费用约束条件下,使装备的使用可用度达到最大.     

Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs

We study the one-warehouse multi-retailer problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-facility subproblems, then propose approximation algorithms by judiciously recombining the subproblem solutions. For piecewise linear concave batch order costs with a constant number of slopes we obtain a constant-factor approximation, while for general concave batch costs we propose an approximation within a logarithmic factor of optimality. We also extend some results to subadditive order and/or holding costs.     

SpaceWire网络混合路由机制设计

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量;动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。