Journal of Transportation Security

, Volume 3, Issue 1, pp 41–55 | Cite as

Ambush avoidance in vehicle routing for valuable delivery

  • Matteo Salani
  • Gaëtan Duyckaerts
  • Peter Goodings Swartz


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 Vehicle routing 


  1. Bell MGH (2004) Games, heuristics, and risk averseness in vehicle routing problems. J Urban Plann Dev 130(1):37–41CrossRefGoogle Scholar
  2. Carotenuto P, Giordani S, Ricciardelli S (2007) Finding minimum and equitable risk routes for hazmat shipments. Comput Oper Res 34(5):1304–1327CrossRefGoogle Scholar
  3. Erkut E, Verter V (1998) Modeling of transport risk for hazardous materials. Oper Res 46(5):625–642CrossRefGoogle Scholar
  4. Gentry SE, Feron E (2004) Modeling musically meaningful choreography. In: Systems, man and cybernetics, 2004 IEEE international conference on, pp 3880–3885Google Scholar
  5. Joseph FA (2005) Path-planning strategies for ambush avoidance. Master’s thesis, Massachusetts Institute of TechnologyGoogle Scholar
  6. Likhachev M, Stentz A (2007) Goal directed navigation with uncertainty in adversary locations. In: IROS, pp 4127–4134Google Scholar
  7. 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–114CrossRefGoogle Scholar
  8. Root P, De Mot J, Feron E (2005) Randomized path planning with deceptive strategies. In: American control conference, 2005, vol 3, pp 1551–1556Google Scholar
  9. Ruckle WH (1983) Gemoetric games and their applications. Pitman Advanced Publishing Program, BostonGoogle Scholar
  10. Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM, PhiladelphiaGoogle Scholar
  11. 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–364CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2010

Authors and Affiliations

  • Matteo Salani
    • 1
  • Gaëtan Duyckaerts
    • 1
  • Peter Goodings Swartz
    • 1
  1. 1.ENACEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations