Optimization of route bundling via differential evolution with a convex representation

Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.