Variable neighborhood descent

We investigate a variant of the many-to-many hub location‐routing problem which consists in partitioning the set of nodes of a graph into routes containing exactly one hub each, and determining an extra route interconnecting all hubs. A variable …