A network reformulation of an electric utility expansion planning model

We reformulate a multiperiod capacity expansion model of electric utilities as a network model. We show how to reconstruct the dual solution of the original mathematical program from the network model solution. To formulate the network model, we use information about the properties of the optimal solution of the mathematical program to reduce the number of constraints. The remaining constraints are then readily converted into network constraints. © 1993 John Wiley & Sons. Inc.     

Ambulance location for maximum survival

This article proposes new location models for emergency medical service stations. The models are generated by incorporating a survival function into existing covering models. A survival function is a monotonically decreasing function of the response time of an emergency medical service (EMS) vehicle to a patient that returns the probability of survival for the patient. The survival function allows for the calculation of tangible outcome measures—the expected number of survivors in case of cardiac arrests. The survival‐maximizing location models are better suited for EMS location than the covering models which do not adequately differentiate between consequences of different response times. We demonstrate empirically the superiority of the survival‐maximizing models using data from the Edmonton EMS system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Can security vetting be extended to include the detection of financial misconduct?

An analysis of the security vetting files of 19 employees within a South African national department who had been found guilty of financial misconduct in the last five years uncovered that the existing security vetting processes did not detect the financial misconduct of which these employees have been found guilty. This research sets out to establish whether security vetting can be extended to include the detection of financial misconduct within the department and, if so, how. Moreover, if security vetting can indeed be so extended, can it possibly enhance the management of fraud risk across all South African public sector departments? Qualitative interviews were conducted with 27 employees who are key to fraud risk management and security vetting within the researched department. During the interviews, the following five themes emerged: (1) the reasons why employees commit financial misconduct; (2) why it is not detected by the security vetting process; (3) the potential alignment of the security vetting process to facilitate the detection of financial misconduct; (4) the following through on security vetting findings; and (5) sharing these findings with the internal audit and risk management functions within state departments. These themes were probed and are reported on, establishing firstly that security vetting can indeed be extended to include the detection of financial misconduct within the researched department, and secondly that it can enhance the management of fraud risk across all South African public sector departments, given the specific mandate of the State Security Agency (SSA) and the national security vetting strategy.     

Nuclear weapons,the United States and alliances in Europe and Asia: Toward an institutional perspective

America’s alliances in Europe and East Asia all involve some institutional cooperation on U.S. nuclear weapons policy, planning or employment—from consultative fora in Asia to joint policy and sharing of nuclear warheads in NATO. Such cooperation is often analyzed through the prism of “extended nuclear deterrence,” which focuses on the extension of U.S. security guarantees and their effect on potential adversaries. This article argues that this underplays the importance of institutional factors: Allies have historically addressed a range of objectives through such cooperation, which has helped to catalyze agreements about broader alliance strategy. The varied form such cooperation takes in different alliances also flows from the respective bargaining power of allies and the relative importance of consensus, rather than perceived threats. The article concludes that nuclear weapons cooperation will remain crucial in successful U.S. alliance management, as allies negotiate their relationship with each other in the face of geostrategic change.     

Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

Does Income Inequality Derive the Separatist Terrorism in Turkey?

Separatist terrorism has been a severe problem for Turkey since the mid-1980s. The conventional wisdom contends that economic deprivation in southeastern Turkey is the fundamental reason for the long-running battle against the Kurdish rebels. Considering that there is limited empirical literature on the roots of terrorism in Turkey, yielding conflicting results about the claim that the main cause of terrorism is deprived economic conditions, this study aims to answer whether there is a causal relationship between income inequality and separatist terrorism in Turkey. To this end, the Global Terrorism Data Base for the period of 1973–2006, two Theil indices of pay inequality as proxy for income inequality, and the vector autoregression and Autoregressive Moving Average (ARMA) methods are utilized. The results support the early findings that income inequality, a particular focus in this paper and an essential indicator of economic deprivation, is not a main cause of escalation of separatist terrorism in Turkey.