Heuristics for convoy movement problem

Convoy movement problem involves routing and scheduling military convoys across a limited route network, adhering to certain strategic constraints. This article suggests using heuristics for solving the dynamic version of the problem where the network changes over time. The performance of heuristics evaluated against lower bounds, when applied to a number of hypothetical data-sets, is found to be encouraging. © 2009 Institute for Defence Studies and Analyses.