Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

用毁伤概率指标优化二点源诱饵系统布阵

两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。     

雷达实际平面探测威力模型与仿真算法研究

在考虑地物遮蔽的情况下,建立了3种程式雷达实际平面探测威力的数学模型,并对参数获取、盲区估算等问题进行了讨论。给出了一种基于DEM数据的雷达实际平面探测威力实用算法,实现了雷达在任意高度层的实际平面探测威力的自动仿真生成。应用表明,雷达实际平面探测威力图绘制的精度和效率较传统方法有较大提高。     

雷达组网系统抗压制干扰部署优化算法研究

针对雷达组网系统抗压制干扰部署优化问题,讨论了雷达及其组网系统的残剩可探测区动态定量评估模型,定义了雷达及其组网系统的探测能力下降指数、雷达装备利用率及其抗干扰效能指数,给出了一套完整的组网系统抗压制干扰综合效能动态定量评估模型、优化布站决策模型及相应的实用算法。3部雷达组网的仿真试验证明了其有效性。     

基于冗余的复杂体系动态适应性结构设计研究

针对复杂体系动态适应性研究所存在的问题,提出了复杂体系冗余概念和基于冗余的复杂体系动态适应性结构设计思想,讨论了基于冗余的复杂体系动态博弈设计过程及体系结构;在此基础上,根据复杂体系使命目标的执行特点及体系本身的结构特性,详细地阐述了复杂体系中的任务冗余、系统冗余和结构冗余三种冗余类型,并从冗余切换方式、冗余具体内容和冗余表现性质三个方面论述了复杂体系中各种冗余所组成的冗余体系,指出冗余体系是复杂体系适应环境的一种策略,也是复杂体系不断演化的需要和结果,并且能够为复杂体系动态适应性结构的构建及其效能评估和复杂体系的优化及改进等研究提供一定的理论指导。     

浅谈网络会计的审计

目前网络会计在各级消防部队中已得到普遍应用,网络会计的出现使得传统审计面临着危机。从网络会计的特点以及所出现的风险角度,探析了审计的新内容以及应注意的问题。     

石河子农耕区不同林地地被昆虫群落结构研究

用"五点式"取样法对石河子农耕区不同林地地被中的昆虫群落结构多样性进行了调查,共采集到昆虫31种,分属8目14科,共计1099头。结果表明:杨树老林地被昆虫群落的丰富度最高(为23),幼榆林次之(为14),苗圃和葡萄的最低(均为7)。多样性指数幼杂林最高(为1.8613),苗圃次之(为1.6833),幼榆林最低,为0.8534。     

基于粗糙神经网络和网络撕裂的故障诊断方法

利用网络撕裂法逐层将复杂装备撕裂为较为简单的单元,并充分利用粗糙集和神经网络融合方法的优点进行故障诊断。提出了基于粗糙神经网络的网络撕裂故障诊断方法,总结出基于粗糙神经网络和网络撕裂的故障算法流程图。以L-F滤波器为例进行实验,结果证明:该算法明显优于普通的基于粗糙神经网络的故障诊断方法,网络结构得到简化,训练速度得到加快。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017