Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A location‐inventory model with lateral transshipments

We study an infinite horizon periodic stochastic inventory system consisting of retail outlets and customers located on a homogenous line segment. In each period, the total demand, generated by the customers on the line, is normally distributed. To better match supply and demand, we incorporate lateral transshipments. We propose a compact model in which the strategic decisions—the number and locations of retail outlets—are determined simultaneously with the operational decisions—the inventory replenishment and transshipment quantities. We find the optimal balance between the risk‐pooling considerations, which drive down the optimal number of retail outlets, and lateral transshipments, which drive up the optimal number of retail outlets. We also explore the sensitivity of the optimal number of retail outlets to various problem parameters. This article presents a novel way of integrating lateral transshipments in the context of an inventory‐location model. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Impact of transfer pricing methods for tax purposes on supply chain performance under demand uncertainty

Transfer pricing refers to the pricing of an intermediate product or service within a firm. This product or service is transferred between two divisions of the firm. Thus, transfer pricing is closely related to the allocation of profits in a supply chain. Motivated by the significant impact of transfer pricing methods for tax purposes on operational decisions and the corresponding profits of a supply chain, in this article, we study a decentralized supply chain of a multinational firm consisting of two divisions: a manufacturing division and a retail division. These two divisions are located in different countries under demand uncertainty. The retail division orders an intermediate product from the upstream manufacturing division and sets the retail price under random customer demand. The manufacturing division accepts or rejects the retail division's order. We specifically consider two commonly used transfer pricing methods for tax purposes: the cost‐plus method and the resale‐price method. We compare the supply chain profits under these two methods. Based on the newsvendor framework, our analysis shows that the cost‐plus method tends to allocate a higher percentage of profit to the retail division, whereas the resale‐price method tends to achieve a higher firm‐wide profit. However, as the variability of demand increases, our numerical study suggests that the firm‐wide and divisional profits tend to be higher under the cost‐plus method than they are under the resale‐price method. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

Country survey VI: Australia

Australia is a geographically large country, with the world's longest national coastline to defend, but a relatively small economy of some 17.5 million people. Since World War II, Australia has faced the dilemma of how to structure defence policy in the absence of an identifiable threat. Its policy of self‐reliance aims to permit Australia to conduct defensive operations in the event of low/medium level threats without depending immediately on its allies. This is to be achieved through the technological sophistication of defence equipment, a highly professional but small defence force and local industry support.

The burden of defence, measured as the share of defence outlay in GDP declined from about 3% in 1971–72 to about 2.3% in 1993–94. It has been the Government's policy to encourage the development of local defence‐related industry, in particular in areas such as: electronics/optics; communications and information technology; aerospace; shipbuilding and repair, munitions; and land vehicles. However, defence procurement has a small impact on the Australian economy as a whole.     

Country survey VIII: Federal republic of Yugoslavia

This survey article focuses on defence economics issues and provides data and analysis on the Federal Republic of Yugoslavia's (FRY) defence policy, defence spending, the size of its armed forces, its defence industries and the cost of the civil war. The main section is devoted to the period from 1990 to the present and deals with the following aspects: the situation after the break‐up of the former Yugoslavia, general economic data; the cost of the civil war, the defence budget; the armed forces; the manufacture of armaments and the structure of the defence industry.     

The future challenges of NATO: An economic viewpoint

This article identifies and evaluates likely challenges facing NATO today and into the next millennium. These contingencies include ethnic‐based civil wars in Europe, transnational terrorism, rogue states, increased world income inequality, out‐of‐area conflicts, and environmental and resource security. Using concepts and tools from collective action, I assess these challenges and suggest effective policies for addressing them. NATO still has a crucial role to play in maintaining world security in the post‐Cold War era.     

RAISING THE COST OF REBELLION: THE ROLE OF THIRD‐PARTY INTERVENTION IN INTRASTATE CONFLICT

This paper presents a simple model to characterize explicitly the role that an intervening third party plays in raising the cost of rebellion in an intrastate conflict. Extending the Gershenson‐Grossman (2000 Gershenson, D. and Grossman, H.I. 2000. Civil conflict: ended or never ending?. Journal of Conflict Resolution, 44(6): 807–821.  [Google Scholar]) framework of conflict in a two‐stage game to the case involving outside intervention in a three‐stage game as in Chang et al. (2007b Chang, Y.‐M., Potter, J. and Sanders, S. 2007b. War and peace: third‐party intervention in conflict. European Journal of Political Economy, 23(4): 954–974.  [Google Scholar]), we examine the conditions under which an outside party optimally intervenes such that (i) the strength of the rebel group is diminished or (ii) the rebellion is deterred altogether. We also find conditions in which a third party optimally intervenes but at a level insufficient to deter rebellion. Such behavior, which improves the incumbent government’s potential to succeed in conflict, is overlooked in some conflict studies evaluating the effectiveness of intervention. One policy implication of the model is that an increase in the strength of inter‐governmental trade partnerships increases the likelihood that third‐party intervention deters rebellion.