Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

网络撕裂法在测磁仪故障诊断中的应用

针对CCY - 1G型数字测磁仪的具体电路结构及功能 ,利用网络撕裂法对其进行故障诊断 ,实现了故障诊断快速、准确的目的     

基于Matlab神经网络的水下目标识别

为了实现对水下目标的识别,在现有特征提取方法的基础上,提出了目标像素灰度分布特征提取方法,并针对水下光信号衰减的情况,采用了色彩"补偿"的解决方案.对图像矩阵通过奇异值分解得到了目标有效维特征向量,分类器设计采用了Matlab环境下的BP神经网络,识别结果是令人满意的.这对猎雷具装备的发展具有一定的参考价值.     

A forward network simplex algorithm for solving multiperiod network flow problems

An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于不同能量值特征优选的水声目标识别

采用Bartlet平均周期图、小波变换和经验模态分解方法分别提取信号的频段能量值特征、IMF能量值特征，重点对IMF能量值特征进行特征优选。通过设计BP神经网络分类器，对实测的四类舰船目标的辐射噪声信号进行测试，取得了较好的识别效果。     

A new importance sampling Monte Carlo method for a flow network reliability problem

The exact evaluation of the probability that the maximum st‐flow is greater than or equal to a fixed demand in a stochastic flow network is an NP‐hard problem. This limitation leads one to consider Monte Carlo alternatives. In this paper, we propose a new importance sampling Monte Carlo method. It is based on a recursive use of the state space decomposition methodology of Doulliez and Jamoulle during the simulation process. We show theoretically that the resulting estimator belongs to the variance‐reduction family and we give an upper bound on its variance. As shown by experimental tests, the new sampling principle offers, in many cases, substantial speedups with respect to a previous importance sampling based on the same decomposition procedure and its best performances are obtained when highly reliable networks are analyzed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 204–228, 2002; DOI 10.1002/nav.10004     

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

Decomposition algorithms for finding a shortest path between a source node and a sink node of an arbitrary distance network are developed. Different decomposition algorithms are proposed for different network topologies. Since Shier's algorithm compares very favorably with other decomposition algorithms in all the network topologies, we compare our algorithms against Shier's algorithm. It is shown that the efficiency of the proposed algorithms compares very favorably with Shier's algorithm. For special types of networks the computational requirements of the proposed algorithm is a polynomial of O(n²).     

聚磷酸铵热分解动力学模型研究

用热重法（TG）对聚磷酸铵的热分解进行了分析。结果表明,聚磷酸铵受热分三步分解,其热分解机理均为三维扩散分解,并用微分法中的Achar法对热分解的数据进行处理,用多种机理方程进行了拟合,得到了聚磷酸铵第一热分解阶段的热分解动力学参数及分解动力学模型。     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Sandwich structure for enhancing the interface reaction of hexanitrohexaazaisowurtzitane and nanoporous carbon scaffolds film to improve the thermal decomposition performance

Improving the thermal decomposition performance of hexanitrohexaazaisowurtzitane (CL-20) by appropriate methods is helpful to promote the combustion performance of CL-20-based solid propellants. In this study, we synthesized a sandwich structure of CL-20 and nanoporous carbon scaffolds film (NCS) and emphatically studied the thermal decomposition performance of the composite structure. Thermogravimetric analysis and differential scanning calorimetry were used to measure the thermal decomposition process of the composite structure. The kinetic parameters of thermal decomposition were calculated by the thermal dynamic analysis software AKTS. These results showed that the thermal decomposition performance of the sandwich structure of CL-20 and NCS was better than CL-20. Among the tested samples, NCS with a pore size of 15 nm had the best catalytic activity for the thermal decomposition of CL-20. Moreover, the thermal decomposition curve of the composite structure at the heating rate of 1 K/min was deconvoluted by mathematical method to study the thermal decomposition process. And a possible catalytic mechanism was proposed. The excellent thermal decomposition performance is due to the sandwich structure enhances the interface reaction of CL-20 and NCS. This work may promote the extensive use of CL-20 in the field of solid rocket propellant.     

A multi‐objective model for bank ATM networks

In this paper we present an application of the core solution concepts for multi‐objective games to a bank ATM network model. In these games, the worth of a coalition is given by a subset of vectors of the k‐dimensional space rather than by a scalar. The paper investigates how an ATM network model based on multi‐objective cooperative game theory could be used as an alternative way of setting interchange fees paid by the customer's bank to the one that owns the ATM. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A concave‐cost production planning problem with remanufacturing options

We focus on the concave‐cost version of a production planning problem where a manufacturer can meet demand by either producing new items or by remanufacturing used items. Unprocessed used items are disposed. We show the NP‐hardness of the problem even when all the costs are stationary. Utilizing the special structure of the extreme‐point optimal solutions for the minimum concave‐cost problem with a network flow type feasible region, we develop a polynomial‐time heuristic for the problem. Our computational study indicates that the heuristic is a very efficient way to solve the problem as far as solution speed and quality are concerned. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Analysis of a production system in a general configuration

We consider a production system comprising multiple stations (or workshops) such as an entry station, a set of work stations, a central station, and an exit station, which are arranged in a general configuration. A worker (or a vehicle tool) is assigned to each station, who sends a part from the station to the destination station according to the required process path of the part. Any part is allowed to visit a work station more than once if its process path requires. We propose a new control strategy with the push policy for instructing each worker to send a part and the kanban mechanism for controlling the work‐in‐process (WIP) in each work station. As all work stations have limited local buffers, the central station is used for storing blocked parts temporarily. Such a production system is modeled as an open queueing network in a general configuration with a Markovian part sending policy and a machine no blocking mechanism. The queueing network is analytically characterized. Some important performance measures are compared with other control strategies. A semi‐open decomposition approach is applied to the queueing network for computing the blocking probabilities when parts arrive at the work stations. An algorithm is developed based on the semi‐open decomposition approach. Numerical experiments show the quality of the solutions obtained by the algorithm as well as a property of a performance measure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 128–143, 2001     

基于功能-原理-行为-结构的产品模块化设计方法

把机械产品的迭代设计分解拓扑模型与模块化设计方法相结合,提出了基于功能-原理-行为-结构的机械产品模块化设计方法.主要讨论了基于功能-原理-行为-结构的产品迭代设计分解原理;分析了设计分解过程中功能→原理←→行为→结构→功能的演进的纵向迭代过程;探讨了产品设计分解的横向动态建模方法;产品迭代设计分解过程引入模块化方法,建立了基于功能-原理-行为-结构的复杂机械系统模块化设计基本方法.     

Knowledge-oriented modeling for influencing factors of battle damage in military industrial logistics: An integrated method

Modeling influencing factors of battle damage is one of essential works in implementing military industrial logistics simulation to explore battle damage laws knowledge. However, one of key challenges in designing the simulation system could be how to reasonably determine simulation model input and build a bridge to link battle damage model and battle damage laws knowledge. In this paper, we propose a novel knowledge-oriented modeling method for influencing factors of battle damage in military industrial logistics, integrating conceptual analysis, conceptual modeling, quantitative modeling and simulation implementation. We conceptualize influencing factors of battle damage by using the principle of hierarchical decomposition, thus classifying the related battle damage knowledge logically. Then, we construct the conceptual model of influencing factors of battle damage by using Entity-Relationship approach, thus describing their interactions reasonably. Subsequently, we extract the important influencing factors by using social network analysis, thus evaluating their importance quantitatively and further clarifying the elements of simulation. Finally, we develop an agent-based military industry logistics simulation system by taking the modeling results on influencing factors of battle damage as simulation model input, and obtain simulation model output, i.e., new battle damage laws knowledge, thus verifying feasibility and effectiveness of the proposed method. The results show that this method can be used to support human decision-making and action.     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

分解炉内煤粉燃烧和CaCO3分解流场的数值模拟

针对国内某大型水泥高性能分解炉,基于Fluent软件,采用有限速率/涡耗散模型模拟了炉内煤粉燃烧和生料分解的湍动多相流场,给出了炉内速度矢量、温度、压力和组分分布,结果显示,炉内流动趋势合理,可为分解炉的研究提供参考.     

膨胀型阻燃聚丙烯的制备及热分解动力学研究

以五氧化二磷／季戊四醇／三聚氰胺为原料合成了聚合型膨胀阻燃剂，并制备了膨胀型阻燃聚丙烯。比较和讨论了热分解动力学方法，通过测定体积流速评价了流变性，用热重分析方法研究了膨胀型阻燃聚丙烯的热分解特点。