‘A Particularly exacting operation’: British Forces and the Battle of Surabaya,November 1945

In 1945, the Dutch government was not in a position to re‐impose its control upon its colonies in the East Indies after the surrender of Japan. In their stead, Allied forces were to take control of the islands, disarm Japanese troops and to maintain stability until the Dutch could return. The declaration of an independent Indonesia by nationalists left the British and Indian troops sent to re‐occupy the islands facing a complex situation. Increasing violence culminated in the murder of Brigadier A.W. S. Mallaby in Surabaya, which was followed by a major action by British forces to regain control. In extremely difficult circumstances, the British troops conducted a successful operation which held many lessons for the conduct of counter‐insurgency operations in the years that followed.     

United States special operations forces and the war on terrorism

Those leading the war on terrorism have emphasized from the beginning that this war would be unlike other wars. Special Operations Forces (SOF) are military forces unlike other military forces. The implication is that SOF and the war on terrorism are thus made for each other. This contribution examines this assumption, the war on terrorism and SOF in greater detail.     

Comparison between constant‐stress and step‐stress accelerated life tests under Time Constraint

By running life tests at higher stress levels than normal operating conditions, accelerated life testing (ALT) quickly yields information on the lifetime distribution of a test unit. The lifetime at the design stress is then estimated through extrapolation using a regression model. In constant‐stress testing, a unit is tested at a fixed stress level until failure or the termination time point of test, whereas step‐stress testing allows the experimenter to gradually increase the stress levels at some prefixed time points during the test. In this work, the optimal k‐level constant‐stress and step‐stress ALTs are compared for the exponential failure data under complete sampling and Type‐I censoring. The objective is to quantify the advantage of using the step‐stress testing relative to the constant‐stress one. Assuming a log‐linear life–stress relationship with the cumulative exposure model for the effect of changing stress in step‐stress testing, the optimal design points are determined under C/D/A‐optimality criteria. The efficiency of step‐stress testing to constant‐stress one is then discussed in terms of the ratio of optimal objective functions based on the information matrix. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

The cyber conceptual framework for developing military doctrine

Militaries rely on secure communications. Despite the permeation of cyber-systems throughout the operational environment, there is little readily available doctrine on cyber-warfare. Doctrine that does exist has not been coherently integrated. This paper introduces a Cyber Conceptual Framework, consisting of five questions pertinent to the future use of cyberspace. The authors enunciate a definition of cyberspace, expand on existing military doctrine to reject the conceptualisation of cyberspace as a domain, define cyber-conflict, define cyber-attack and describe the four components and five levels of a cyber-attack. This work develops a common framework from available doctrine and a lexicon for future discussion.     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015