Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

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     

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 virtual dimension of contemporary insurgency and counterinsurgency

This paper looks at the virtual dimension of contemporary insurgency and counterinsurgency. It argues that the West is faltering in the ‘War of Ideas’ with global Jihad for the main reason that the messages that we wish to convey lack narrative coherence. This is a result of the fact that we misapprehend the nature of the virtual operational environment whereas our opponents possess an intuitive grasp of it as a result of which their structure and method of operations are better adapted and more effective than our own. There is no reason, beyond inertia, that this should remain the case.     

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.     

Myth and the small war tradition: Reassessing the discourse of British counter-insurgency

In recent years a number of commentators have posited that the British reputation for conducting small wars has suffered in the wake of setbacks in Iraq and Afghanistan. The argument here contests whether such a tradition can be truly said to have ever existed. A close examination of this supposed tradition reveals it to be a myth. In fact, rarely have the British armed forces claimed a facility for counter-insurgency or small war. Invariably, commentators outside the Army have ascribed the tradition to them. Most notably, commentators in the United States keen to discern practices of minimum force or rapid institutional learning generated the narrative of British COIN expertise. Ultimately, what this myth reveals is that, when deconstructed, it is political will, not an ingrained understanding of fighting insurgencies, that has determined Britain's success, or otherwise, in so-called small wars.