A vehicle routing heuristic: Derived from altered problem constraints

We present an heuristic algorithm for producing solutions to the Vehicle Routing Problem which is motivated by examination of routing problems within tree structures. We first examine conditions related to solution efficacy within graphs based on minimum distance trees, and subsequently introduce an adaptation that extends operational efficiency within non-tree graphs. Whereas most practical algorithms for solving VRPs utilize the tour constraint, clustering, or other cycle-building method to construct a solution, we presume a partial path solution, and develop decision criteria for completion of the delivery set trajectory which can be implemented as a bounded recursive search. Our algorithm approaches the common pragmatic CVRP domain, and is phrased in such a way as to make the procedure flexible in terms of fleet capacities.