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     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

Environmental regulation in project‐based industries

We study the environmental regulation of industrial activities that are organized as projects. Applications arise in construction, ship and aircraft building, and film making, among other industries. Relative to manufacturing, environmental regulation is different in project‐based industries, due to the uniqueness and geographical diversity of projects, and a lack of product takeback programs. Because the amount of waste and pollution generated by project companies can be large, regulators need environmental policies to ensure reduction of waste and pollution. We consider a regulator who attempts to maximize social welfare. We model this problem as a bilevel nonlinear program. The upper level regulator specifies waste reduction targets, which the lower level project companies meet using waste stream reduction and remediation of pollution, while attempting to control their project costs. We find that high waste diversion targets lead to outcomes with little pollution, but excessive project costs and only modest waste stream reduction. Projects that have lower task precedence density, or that have pollutants with different environmental impacts, show larger increases in project cost and time resulting from regulation. We describe a subsidy for waste stream reduction that coordinates the system, and we estimate the value of coordination. We also describe a bonus that encourages truthful reporting by project companies, and evaluate the relative cost and effectiveness of the subsidy and the bonus. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 228–247, 2015     

THE PEACE DIVIDEND EFFECT OF TURKISH CONVERGENCE TO THE EU: A MULTI‐REGION DYNAMIC CGE MODEL ANALYSIS FOR GREECE AND TURKEY

This paper examines the peace dividend effect of Turkish convergence to EU membership. By employing a multi‐region dynamic CGE model, we examine the prospect for conflict resolution if Turkey becomes an EU member. The model allows us to analyse several scenarios that imply varying amounts of reduction of the military expenditure/GDP ratios. On the one hand, this change will cause a decrease in sectoral demand for military expenditures, while on the other hand, reallocation of the reduced expenditure on (i) education, (ii) tax decrease, and (iii) infrastructure, should have a huge growth impact. Our dynamic CGE simulation experiments emphasize the economic gain for all parties involved.     

Automated integration of real-time and non-real-time defense systems

Various application domains require the integration of distributed real-time or near-real-time systems with non-real-time systems.Smart cities,smart homes,ambient intelligent systems,or network-centric defense systems are among these application domains.Data Distribution Service(DDS)is a communi-cation mechanism based on Data-Centric Publish-Subscribe(DCPS)model.It is used for distributed systems with real-time operational constraints.Java Message Service(JMS)is a messaging standard for enterprise systems using Service Oriented Architecture(SOA)for non-real-time operations.JMS allows Java programs to exchange messages in a loosely coupled fashion.JMS also supports sending and receiving messages using a messaging queue and a publish-subscribe interface.In this article,we pro-pose an architecture enabling the automated integration of distributed real-time and non-real-time systems.We test our proposed architecture using a distributed Command,Control,Communications,Computers,and Intelligence(C4I)system.The system has DDS-based real-time Combat Management System components deployed to naval warships,and SOA-based non-real-time Command and Control components used at headquarters.The proposed solution enables the exchange of data between these two systems efficiently.We compare the proposed solution with a similar study.Our solution is superior in terms of automation support,ease of implementation,scalability,and performance.     

The Evolution of US Extended Deterrence and South Korea’s Nuclear Ambitions

ABSTRACT

Extended deterrence has been a main pillar of the security alliance between the United States and South Korea (Republic of Korea [ROK]) since the end of the Korean War. The changing dynamics of US extended deterrence in Korea, however, affected Seoul’s strategic choices within its bilateral alliance relationship with Washington. Examining the evolution of US extended deterrence in the Korean Peninsula until the Nixon administration, this article explains why South Korea began its nuclear weapons programme in a historical context of the US–ROK alliance relationship. This article argues that President Park Chung-hee’s increasing uncertainty about the US security commitment to South Korea in the 1960s led to his decision to develop nuclear weapons in the early 1970s despite the fact that US tactical nuclear weapons were still stationed in South Korea.     

Collaborative procurement among competing buyers

Collaborative procurement emerged as one of the many initiatives for achieving improved inter‐firm coordination and collaboration. In this article, we adopt a game‐theoretical approach to study the interaction between two firms who procure jointly, but produce independently and remain competitors in a product market characterized by price‐sensitive demand. We study the underlying economics behind collaborative procurement, examine the effects of collaboration on buyer and supplier profitability, and derive conditions under which collaboration is beneficial to each participant. We find that a necessary and sufficient condition for a buyer to collaborate is to increase its sales. We identify the conditions that lead equal size buyers (i.e., consortia consisting of only large buyers or only small buyers) versus different size buyers to collaborate. We also determine the conditions that make collaboration profitable for the supplier, and show that rather than selling a large quantity to a single buyer, the supplier prefers to sell to multiple buyers in smaller quantities. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time

In this article, we study a queueing system serving multiple classes of customers. Each class has a finite‐calling population. The customers are served according to the preemptive‐resume priority policy. We assume general distributions for the service times. For each priority class, we derive the steady‐state system size distributions at departure/arrival and arbitrary time epochs. We introduce the residual augmented process completion times conditioned on the number of customers in the system to obtain the system time distribution. We then extend the model by assuming that the server is subject to operation‐independent failures upon which a repair process with random duration starts immediately. We also demonstrate how setup times, which may be required before resuming interrupted service or picking up a new customer, can be incorporated in the model. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model

In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015