Heuristic algorithms for routing yard‐side equipment for minimizing loading times in container terminals

This paper discusses a method of routing yard‐side equipment during loading operations in container terminals. Both the route of yard‐side equipment (such as transfer cranes or straddle carriers) and the number of containers picked up at each yard‐bay is determined simultaneously. The objective of the problem in this paper is to minimize the total container‐handling time in a yard. The size of the search space can be greatly reduced by utilizing inherent properties of the optimal solution. An encoding method is introduced to represent solutions in the search space. A genetic algorithm and a beam search algorithm are suggested to solve the above problem. Numerical experiments have been conducted to compare the performances of the proposed heuristic algorithms against each other and against that of the optimal solution. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 498–514, 2003     

State information lag markov decision process with control limit rule

In the framework of a discrete Markov decision process with state information lag, this article suggests a way for selecting an optimal policy using the control limit rule. The properties sufficient for an optimal decision rule to be contained in the class of control limit rules are also studied. The degradation in expected reward from that of the perfect information process provides a measure of the potential value of improving the information system.     

The (s,Q) inventory model with Erlang lead time and deterministic demand

We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Dynamic proximity calculations for situation awareness

We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Network disconnection problems in a centralized network

We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Deterrence under nuclear asymmetry: THAAD and the prospects for missile defense on the Korean peninsula

The 2016 decision to deploy Terminal High Altitude Area Defense (THAAD) to South Korea has generated multitude of intensely politicized issues and has proved highly controversial. This has made it challenging to alleviate, let alone clarify, points of analytical and policy tensions. We instead disaggregate and revisit two fundamental questions. One is whether THAAD could really defend South Korea from North Korean missiles. We challenge the conventional “qualified optimism” by giving analytical primacy to three countermeasures available to defeat THAAD–use of decoys, tumbling and spiral motion, and outnumbering. These countermeasures are relatively inexpensive to create but exceedingly difficult to offset. Second, we assess the optimal way to ensure South Korean national security against North Korean missiles. By examining the balance of capability and issues of credibility/commitment, we show that the U.S. extended deterrence by punishment remains plentiful and sufficiently credible even without enhancing the current defense capability.     

Inventory policies for a make‐to‐order system with a perishable component and fixed ordering cost

We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (s_n,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (s_n,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Economic and environmental impacts of vertical and horizontal competition and integration

We explore the economic and environmental impacts of market structures (competition or integration at vertical and horizontal levels). We consider a bilateral duopoly consisting of two manufacturers and two retailers in which each manufacturer offers a wholesale price contract to the respective retailer. The manufacturers decide on wholesale prices and abatement efforts concerning pollution emissions related to manufacturing processes, whereas the retailers compete in quantities in the consumer market. To understand the comprehensive effects of market structures on economic competitiveness and environmental sustainability, we examine a measure of eco‐friendly social welfare, which is the ratio of social welfare and environmental pollution. Interestingly, we find that the market structures that have been believed to be more efficient are less efficient from a broader perspective: (1) double marginalization can generate higher eco‐friendly social welfare, and (2) horizontal competition between firms can result in lower eco‐friendly social welfare. Although vertical integration and horizontal competition yield greater social welfare by facilitating more production activities, these market structures often fail to induce sufficient abatement efforts to balance the polluting effect of the large volume, resulting in more significant environmental degradation. We also show that, despite the pollution‐curbing effect, higher emission penalties can result in less eco‐friendly social welfare. They can even curtail the abatement efforts of firms under particular circumstances. When products become more substitutable, the eco‐friendly social welfare can decrease depending upon the market structure.