An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case

The dynamics of the environment in which supply chains evolve requires that companies frequently redesign their logistics distribution networks. In this paper we address a multiperiod single‐sourcing problem that can be used as a strategic tool for evaluating the costs of logistics network designs in a dynamic environment. The distribution networks that we consider consist of a set of production and storage facilities, and a set of customers who do not hold inventories. The facilities face production capacities, and each customer's demand needs to be delivered by a single facility in each period. We deal with the assignment of customers to facilities, as well as the location, timing, and size of inventories. In addition, to mitigate start and end‐of‐study effects, we view the planning period as a typical future one, which will repeat itself. This leads to a cyclic model, in which starting and ending inventories are equal. Based on an assignment formulation of the problem, we propose a greedy heuristic, and prove that this greedy heuristic is asymptotically feasible and optimal in a probabilistic sense. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 412–437, 2003     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

A fluid queueing model for link travel time moments

We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

级联失效下非对称依赖网络鲁棒性研究

研究级联失效下网络化信息物理系统的鲁棒性具有重要的现实意义。针对具有单向依赖关系的信息物理系统构建双层非对称依赖网络模型,综合依赖失效和过载失效设计级联失效模型,提出一种更贴近实际的非对称攻击方式,并给出一种资源限制下的节点容量分配方式。针对无标度子网构成的非对称依赖网络进行了仿真实验,结果表明:网络鲁棒性与子网络平均度、度指数、节点容量等呈正相关关系;同配依赖网络以及按度值分配节点容量的网络具有更高的鲁棒性;非对称依赖网络面对蓄意攻击时具有脆弱性;以同等力度单独攻击被依赖子网时,网络受到的损伤更大。构建的模型及发现的规律对于研究网络鲁棒性、优化网络设计具有一定的参考价值。     

Scheduling prowler training

The U.S. Navy Prowler aircraft is designed for electronic surveillance and countermeasures. In this paper, we describe the problem of scheduling Prowler crew training, and we present two integer programming models to solve it. The first model maximizes the number of aviators trained above 75% in each mission area, subject to the available number of flights, over a single month. The second model distinguishes peacetime from mobilization, and minimizes the number of flights done in mobilization subject to the available number of flights in peacetime. Our models distinguish different types of crew and allow more than one qualification to be earned on a given flight. We give numerical results using real data, comparing our results to the actual readiness of a squadron. We found that crew readiness of Prowler squadrons can be increased by 10%, simply by better scheduling. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 289–305, 2003.     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

I-TCP:一个高速长距离网络的AIMD算法

针对互联网中高速长距离网络上的拥塞控制问题,基于同步AIMD源在Drop-Tail网络环境下竞争带宽的网络模型,提出了一个新的AIMD拥塞控制算法,I-TCP。通过合理地设计高速和低速模式以及模式切换规则,使得该算法适合于配置到高速长距离网络,同时在传统低速网络中也具有很好的性能。仿真试验表明,I-TCP中的AIMD算法在高速长距离网络中表现出了很好的效率、公平性和网络响应性。     

海战场移动自组织网络构建设计

面向海战场信息网络建设需求，结合移动自组织网络无中心、组网灵活，抗毁性强等特点，从移动自组织网络体系结构设计入手，研究海上移动自组织网络的组网技术，并提出一种适用于海战场信息网络动态组网的构建方法。     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

多约束条件下互联网骨干网路由器级拓扑生成方法

互联网骨干网是网络流量的中枢传输系统,其路由器级拓扑结构对于网络抗毁性分析具有重要意义。由于难以获取互联网骨干网路由器级的真实拓扑,通过分析骨干网的形成因素,将地理位置、节点间联系强度、基础设施费用、鲁棒性等因素结合起来,提出一种多约束条件下的互联网骨干网路由器级拓扑生成方法。该方法既可以构造难以公开获取网络测量数据的骨干网,也可以用来生成某一骨干网的多种替身拓扑集。通过现实中的互联网骨干网作为实例,验证了方法的有效性。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

Facility location models for immobile servers with stochastic demand

This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

弹药贮存微环境温度智能化预测

高效、准确获取弹药贮存微环境温度变化规律是开展弹药寿命评估与延寿的关键。结合神经网络算法以及传热学原理,研究了弹药贮存微环境温度预测模型,并基于此模型开发了一套弹药包装箱微环境预测软件,用以预测不同气候环境下包装箱内部的温度变化。在敦煌、漠河进行了相关试验,用以验证软件预测正确性以及参数优化。结果表明：应用基于神经网络算法开发的包装箱微环境预测软件,根据不同包装箱材料,调控贮存地点以及控制贮存起始温度,可以实现对箱内温度的控制。     

Outbound supply chain network design with mode selection and lead time considerations

We present a large‐scale network design model for the outbound supply chain of an automotive company that considers transportation mode selection (road vs. rail) and explicitly models the relationship between lead times and the volume of flow through the nodes of the network. We formulate the problem as a nonlinear zero‐one integer program, reformulate it to obtain a linear integer model, and develop a Lagrangian heuristic for its solution that gives near‐optimal results in reasonable time. We also present scenario analyses that examine the behavior of the supply chain under different parameter settings and the performance of the solution procedures under different experimental conditions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

多媒体传感器网络中基于ACO的QoS路由协议

针对目前无线多媒体传感器网络QoS路由协议算法复杂、能耗较大等缺点,提出将蚁群优化算法用于改进无线多媒体传感器网络的路由选择.首先,抽象出多媒体传感器网络QoS 路由模型,进而,利用蚁群算法设计了一个运用带网络约束条件的权值去更新信息素浓度增量的路由算法--AntWMSN算法,AntWMSN算法利用正向蚂蚁F_(ant)收集链路带宽、时延、丢包率等参数,结合精华蚂蚁系统更新本地节点的网络状态模型以及每个访问过的节点上的信息素,从而找到满足多约束QoS条件下的最佳路由.仿真结果表明,该算法具有分布式全局优化网络路由选择的特性,比传统的QoS路由协议具有更好的收敛性,并且在满足网络对QoS参数需求的前提下,有效地提高了网络的生命周期.     

Minimum-cost flows in convex-cost networks

An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max-Flow Min-Cut Theorem may all be formulated into minimum-cost flow problems in convex-cost networks.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

复杂网络波动扩展衍射欠定采样预测模型

复杂网络环境中对网络波动的准确预测可以有效监测网络环境,防范网络入侵和拥堵。由于在复杂网络受到干扰的可能性更大,其网络波动具有扩展衍射特征,不可预测性强。传统方法中采用自回归移动平均模型进行复杂网络波形预测算法设计,在波动信号的时频重叠调制过程中未能纳入杂波先验信息,波动序列的扩展衍射特征形成欠定采样,预测效果不好。提出基于空间扩展自回归移动平均模型的复杂网络波动欠定预测算法,采用LTE线性均衡滤波,进行降噪去除杂波干扰,提取波动序列的扩展衍射特征形成欠定采样样本序列,设计网络波动时空序列扩展衍射点阵,准确预测网络波动的参数信息。以病毒入侵,网络监听和拥塞堵塞等波动产生模型为实例,进行仿真实验,结果表明该算法具有较高预测精度,监测点波动误差较小,实现复杂网络波动状态的动态跟踪和评估。