Multi-Objective Resolution of Hub Location Problem with Hop-Constraints

This paper investigates a flexible hub location problem within an incomplete inter-hub network, considering the multiple allocation of non-hub nodes to hubs. It assumes unlimited capacity for both hubs and links, with no direct links permitted. Although research on hub location problems with hop constraints is scarce, most studies in the literature incorporates the number of hops as a constraint into the mathematical model. This paper extends the last findings by addressing it as a multiobjective problem, aiming to balance the number of hops and the total cost. The problem is solved using the CPLEX solver, utilizing the CAB data set.