Abstract Optimal route planning under threat of ambush is essential for any vehicle carrying valuable persons or objects. Our paper proposes a planning method for such a vehicle in an urban environment where, starting from a depot, a set of predetermined destinations must be served. We develop a previously existent flow-based single-destination model, proposing a method for minimizing attacker payoff in the multi-destination case. Our method requires specification of destination ordering, and we propose a method for mixing of these possible orders. Such mixing further reduces attacker payoff. We then apply the method to a set of possible scenarios based on Cambridge, Massachusetts, and analyze the benefits of our mixed ordering strategy. Finally, we introduce a second-level optimization model which again reduces the overall risk of successful ambush.
Ambush avoidance in vehicle routing for valuable delivery
Journal of Transportation Security ; 3 , 1 ; 41-55
28.01.2010
15 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Explosion-proof engine cover of landmine-proof ambush-proof vehicle
Europäisches Patentamt | 2024
|An Attempted Amateur Ambush of Supersports 200
British Library Online Contents | 1997
Optimal Player Policies for Continuous Ambush Games
AIAA | 2018
|Bullet-proof and landmine-proof structure for vehicle and landmine-proof anti-ambush vehicle
Europäisches Patentamt | 2020
|Novel light double-V sandwich structure chassis of mine resistant ambush protected vehicle
Europäisches Patentamt | 2015
|