Abstract:

The cycle hub location problem is here addressed by a tailored parallel heuristics approach. This is a very important problem with many applications in cargo, passenger and telecommunication systems. There are many variants of this problem in the literature. We focus in the variant in which the fixed cost of hubs are not accounted, and the hub nodes are connected by cycle network and non hubs nodes must be allocated to exactly one hub. The devised solution framework outperforms the known heuristic for the problem on the selected instances, both in time and solutions’ quality.