Route bundling consists of compounding multiple paths into a single route by finding optimal anchoring points at intermediate joints, which serve as coordinating locus for joint transport of goods/people. Route bundling is a significant construct in a number of planning scenarios where transport resource is scarce. We present the problem of route bundling and propose a new method for finding such compounded routes. Computational experiments in scenarios with/without obstacles show the feasibility and efficiency of our approach.