Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于丛生树的多流水线并行Hash连接的处理机分配算法

本文介绍了并行数据库中实现多流水线Ｈａｓｈ连接的处理机分配算法，该算法对于执行Ｈａｓｈ连接的丛生查询树可同时实现流水线内并行（ＩｎｔｒａｐｉｐｅｌｉｎｅＰａｒａｌｅｌ）和多流水线间的并行（ＩｎｔｒａｐｉｐｅｌｉｎｅＰａｒ－ａｌｅｌ     

论兵器运用工程

本文阐述了兵器运用工程研究的目的、对象、内容及要解决的问题,简要地回顾了这门学科形成的过程,并着重讨论了构成本学科的专业理论和今后急待研究的方向。     

带模糊约束的非平衡运输问题

本文首次提出了两类带模糊约束的非平衡运输问题,并建立了相应的数学模型。此外,研究了它们的表上求解法。最后,给出了一个具体实例。     

管输水力摩阻不分区计算与实验研究

长输管道输送一般处于紊流区,紊流区的水力摩阻计算一直采用分区计算的方法,涉及到的公式较多,使用起来不方便,并且分区附近存在数值跃变;由于混合摩擦区的计算通常采用近似公式,误差增加,最大甚至可达百分之十几。科尔布鲁克公式被公认为是计算混合摩擦区摩阻因数的准确公式,也可近似地用于水力光滑区和完全粗糙区的计算。文中给出了基于科尔布鲁克公式的水力摩阻计算公式,用该公式统一紊流区水力摩阻计算,并对不同油品在同一管道中流动的水力摩阻损失进行了实验研究,用实验数据分析了水力摩阻计算公式的误差。研究表明,紊流区的水力摩阻计算可不分区,均采用科尔布鲁克公式,以利于工程计算,同时可提高混合摩擦区的计算精度。     

管线探堵理论分析及实验研究

介绍了管线探堵主要方法及特点。分析了埋地管线水力瞬变探堵的理论基础,建立埋地管线快速探堵的数学模型,进行了数值模拟计算和分析,并进行了实验研究。实验证明,根据水力瞬变特性探堵可以快速准确确定堵点位置。水力瞬变探堵系统具有精度高、速度快、设备简单、使用方便、用途广等特点。     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

舰艇编队海上运输补给物资需求预测方法

按照是否与任务、事件相关,将物资需求分为两类,对于任务、事件相关物资需求的预测,将任务进行合理的分解,并根据物资消耗与任务、事件之间的关系,给出了预测的一般模型;对于与任务、事件联系不紧密的物资需求的预测,则根据历史经验及该物资固有的消耗规律,提出了经验预测模型。为了解决舰艇编队海上运输补给物资需求预测所存在的问题,利用案例推理的方法生成了预测所需的样本数据,以最小二乘向量机(LSSVM)模型为预测模型,并以岛屿进攻作战的防空弹药需求预测为例进行了实例分析。结果表明:案例推理生成的样本数据可用,选用LSSVM模型的预测结果与其他预测模型表现出了一致性,但LSSVM相对误差较小;该方法在某种程度上解决了样本数据有限的问题,适用于作战物资需求的预测问题。     

高速并行Gardner算法设计与实现

随着空间探测任务逐步增加、空间信道频谱资源日趋紧张,传统Gardner定时同步算法已经无法满足高速数传系统高通量、高可靠性的需求。为了提高Gardner定时同步算法的吞吐率并增大可纠正误差范围,提出一种高速并行Gardner算法。为了保证插值精度同时减少乘法器消耗,设计了一种并行分段抛物线插值滤波器;为了便于并行流水线设计和最佳采样点选取,构建了计数模块和定时缓存调整模块;为了提高等价吞吐率,重构了流水线并行环路滤波器结构和并行数控振荡器结构。结果表明,该算法等价吞吐率可达1 739.13 Msps,数字信号处理器资源消耗可减少44%,可纠正2×10^-3的定时误差。