On Solution of the Capacitated Single Allocation Hub Location Problem

摘要

The capacitated single allocation hub location problem (CSAHLP) is a decision problem of number of hub facilities and location-allocation, considering that each hub has its capacity constraint. A problem related to the CSAHLP is the uncapacitated single allocation hub location problem (USAHLP). We have proposed a hybrid heuristic for solving the USAHLP with good results obtained. In this paper, an allocation procedure is developed to embed in the hybrid heuristic to resolve the CSAHLP. Computational characteristics of the presented heuristic are evaluated through computational experiments using the AP data set from the literature.