Communicating strategically in the face of terrorism: The Spanish government’s response to the 2004 Madrid bombing attacks

With the re-emergence of insurgency tied to terrorism, governments need to strategically manage their communications. This paper analyzes the effect of the Spanish government’s messaging in the face of the Madrid bombing of March 11, 2004: unlike what happened with the 9/11 bombings in the USA and the 7/07 London attacks, the Spanish media did not support the government’s framing of the events. Taking framing as a strategic action in a discursive form (Pan & Kosicki, 2003), and in the context of the attribution theory of responsibilities, this research uses the “cascading activation” model (Entman, 2003, 2004) to explore how a framing contest was generated in the press. Analysis of the coverage shows that the intended government frame triggered a battle among the different major newspapers, leading editorials to shift their frame over the four days prior to the national elections. This research analyzes strategic contests in framing processes and contributes insight into the interactions among the different sides (government, parties, media, and citizens) to help bring about an understanding of the rebuttal effect of the government’s intended frame. It also helps to develop an understanding of the role of the media and the influence of citizens’ frames on media content.

Determining departure times in dynamic and stochastic maritime routing and scheduling problem

In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.

Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search.

Heuristics for stochastic and dynamic vehicle routing problems are often kept relatively simple, in part due to the high computational burden resulting from having to consider stochastic information in some form. In this work, three existing heuristics are extended by three different local search variations: a first improvement descent using stochastic information, a tabu search using stochastic information when updating the incumbent solution, and a tabu search using stochastic information when selecting moves based on a list of moves determined through a proxy evaluation. In particular, the three local search variations are designed to utilize stochastic information in the form of sampled scenarios. The results indicate that adding local search using stochastic information to the existing heuristics can further reduce operating costs for shipping companies by 0.5–2 %. While the existing heuristics could produce structurally different solutions even when using similar stochastic information in the search, the appended local search methods seem able to make the final solutions more similar in structure.