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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bell MGH (2004) Games, heuristics, and risk averseness in vehicle routing problems. J Urban Plann Dev 130(1):37–41
Carotenuto P, Giordani S, Ricciardelli S (2007) Finding minimum and equitable risk routes for hazmat shipments. Comput Oper Res 34(5):1304–1327
Erkut E, Verter V (1998) Modeling of transport risk for hazardous materials. Oper Res 46(5):625–642
Gentry SE, Feron E (2004) Modeling musically meaningful choreography. In: Systems, man and cybernetics, 2004 IEEE international conference on, pp 3880–3885
Joseph FA (2005) Path-planning strategies for ambush avoidance. Master’s thesis, Massachusetts Institute of Technology
Likhachev M, Stentz A (2007) Goal directed navigation with uncertainty in adversary locations. In: IROS, pp 4127–4134
List GF, Mirchandani PB, Turnquist MA, Zografos KG (1991) Modeling and analysis for hazardous materials transportation: risk analysis, routing/scheduling and facility location. Transp Sci 25(2):100–114
Root P, De Mot J, Feron E (2005) Randomized path planning with deceptive strategies. In: American control conference, 2005, vol 3, pp 1551–1556
Ruckle WH (1983) Gemoetric games and their applications. Pitman Advanced Publishing Program, Boston
Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM, Philadelphia
Zoroa N, Zoroa P, Fernández-Sáez MJ (1999) A generalization of ruckle’s results for an ambush game. Eur J Oper Res 119(2):353–364
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Salani, M., Duyckaerts, G. & Swartz, P.G. Ambush avoidance in vehicle routing for valuable delivery. J Transp Secur 3, 41–55 (2010). https://doi.org/10.1007/s12198-010-0037-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12198-010-0037-0