ADAPTIVE LARGE NEIGHBORHOOD SEARCH ALGORITHM APPLIED TO THE UNCAPACITATED p-HUB CENTER PROBLEM WITH MULTIPLE ALLOCATION

This article presents an algorithm based on the Adaptive Large Neighborhood Search metaheuristic to solve the uncapacitated multiple allocation p-hub center problem. The objective of the problem is to determine which nodes will be hubs and the assignment of each of the non-hub nodes to one or more hub nodes so that the maximum cost of meeting demands, among the costs associated with all origin-destination pairs, will be minimized. This problem can be applied to the planning of a distribution system involving perishable products or time-sensitive products, such as urgent cargo. Computational experiments are carried out to compare the execution time and objective function value of the proposed algorithm in relation to results found in the literature. The performed evaluations show that the algorithm provides good solutions in an adequate computational time.