Abstract
In many areas od transportation analysis one is interested in a group of vehicles which are proceeding along a common route (i.e. a convoy). This paper presents: (1) a set of heuristic definitions which attempt to characterize different types of convoys, (2) a mathematical formulation of the convoy problem which complements the definitions, (3) a general algorithmic solution to a class of convoy problems and (4) two specific examples. The methodology which is presented is useful for analyzing or designing a non-stationary convoy, perturbed by stochastic forces and subject to internal and external deterministic forces. (Author/publisher)