基于均分簇算法的战争Ad Hoc网络广播风暴抑制

网络广播是维持网络正常运作的基本手段,但Ad Hoc网络拓朴的频繁变化,将使网络广播无法进行收敛,形成广播最终会使本来就受限的资源趋于濒绝,网络无法通信而瘫痪.为此,提出了一种自适应均分簇理论SACA,通过分层虚拟子网的过滤与阻隔算法,有效地抑制网络广播风暴.     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Integrated capacity,demand, and production planning with subcontracting and overtime options

Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Designing safety space in a supply chain to handle system‐wide disruptions

In some supply chains serious disruptions are system wide. This happens during periods of severe weather, as when storms cause shuttle tankers serving oil platforms in the North Sea to stop movements of crude oil, barges are frozen in the Mississippi, or all airplanes are grounded after a blizzard. Other notable instances of system‐wide disruption happened after the attack on the World Trade Center when all aircraft were grounded and the natural gas and crude‐oil pipelines were tangled by hurricanes in 2005. We model a situation where shutting down supply facilities is very difficult and expensive because of excessive inventory buildup from an inability to move out the production. We present a planning model that balances the cost of spare capacity versus shutting down production when planning for disruptions. The model uses an assignment model embedded in a simulation. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Dynamic pricing in a dual‐market environment

This article is concerned with the determination of pricing strategies for a firm that in each period of a finite horizon receives replenishment quantities of a single product which it sells in two markets, for example, a long‐distance market and an on‐site market. The key difference between the two markets is that the long‐distance market provides for a one period delay in demand fulfillment. In contrast, on‐site orders must be filled immediately as the customer is at the physical on‐site location. We model the demands in consecutive periods as independent random variables and their distributions depend on the item's price in accordance with two general stochastic demand functions: additive or multiplicative. The firm uses a single pool of inventory to fulfill demands from both markets. We investigate properties of the structure of the dynamic pricing strategy that maximizes the total expected discounted profit over the finite time horizon, under fixed or controlled replenishment conditions. Further, we provide conditions under which one market may be the preferred outlet to sale over the other. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 531–549, 2015     

Optimal and asymptotically optimal policies for assemble‐to‐order n‐ and W‐systems

We consider two specially structured assemble‐to‐order (ATO) systems—the N‐ and W‐systems—under continuous review, stochastic demand, and nonidentical component replenishment leadtimes. Using a hybrid approach that combines sample‐path analysis, linear programming, and the tower property of conditional expectation, we characterize the optimal component replenishment policy and common‐component allocation rule, present comparative statics of the optimal policy parameters, and show that some commonly used heuristic policies can lead to significant optimality loss. The optimality results require certain symmetry in the cost parameters. In the absence of this symmetry, we show that, for systems with high demand volume, the asymptotically optimal policy has essentially the same structure; otherwise, the optimal policies have no clear structure. For these latter systems, we develop heuristic policies and show their effectiveness. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 62: 617–645, 2015     

Inventory financing under Risk-Adjusted-Return-On-Capital criterion

Risk-Adjusted-Return-On-Capital (RAROC) is a loan-pricing criterion under which a bank sets the loan term such that a certain rate of return is achieved on the regulatory capital required by the Basel regulation. Some banks calculate the amount of regulatory capital for each loan under the standardized approach (“standardized banks,” the regulatory capital is proportional to the loan amount), and others under the internal rating-based (IRB) approach (“IRB banks,” the regulatory capital is related to the Value-at-Risk of the loan). This article examines the impact of the RAROC criterion on the bank's loan-pricing decision and the retailer's inventory decision. We find that among the loan terms that satisfy the bank's RAROC criterion, the one that benefits the retailer the most requires the bank to specify an inventory advance rate in addition to the interest rate. Under this loan term, the retailer's inventory level is more sensitive to his asset level when facing an IRB bank compared to a standardized bank. An IRB (standardized) loan leads to higher profit and inventory level for retailers with high (low) asset. For retailers with medium asset, an IRB loan results in a higher retailer profit but a lower consumer welfare. Calibrated numerical study reveals that the benefit of choosing standardized banks (relative to IRB banks) can be as high as 30% for industries with severe capital constraints, volatile demands, and low profit margins, highlighting the importance for retailers to carefully choose the type of banks to borrow from. When the interest rate is capped by regulation, retailers borrowing from a standardized bank are more likely to be influenced by the interest rate cap than those borrowing from an IRB bank. Under strong empire-building incentives (the bank will offer loan terms to maximize the size of the loan), retailers with medium initial asset level shift their preference from IRB banks to standardized banks.     

军事虚拟仓库应急保障仿真分析

在分析应急物流研究成果基础上,探索应用虚拟仓库理论和仿真技术研究应急物流中的协同库存问题.为此,构建了军事虚拟仓库系统及其协同控制系统动力学仿真模型,并针对军民、军军仓库间的应急物流协同保障策略进行仿真分析,结果表明这种方法可以在应急状态下合理调度和管理各类仓库资源,改进应急物流条件下仓库保障能力.