A new efficient metaheuristic for solving the Uncapacitated Single Allocation p-Hub Median Problem

Hub location problem is an NP-hard problem, it deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin-destination pair. In this paper, we study the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) variant of the hub location problems. Thus, we present a new and robust solution based on artificial immune system (AIS) framework for this problem. The outcome of this paper is a new approach in the form of clonal selection algorithm (CSA) to solve this location-allocation problem. The algorithm maintains the feasibility of individuals by using a specific representation. To the best of our knowledge, this methodology of solving the USApHMP is introduced to the literature for the first time.