A note on solution of the capacitated single allocation hub location problem
Hub-and-spoke designs are frequently used in many types of transportation and communication networks. The challenge to academics is to develop effective solution procedures for determining the number of hubs, locating hub facilities and allocating the non-hubs to the hubs. In this note, we deal with the capacitated single allocation hub location problem (CSAHLP) in which each non-hub can only be allocated to a single hub, each hub has its capacity constraint, and the objective function includes fixed costs for establishing hubs. A problem closely related to the CSAHLP is the uncapacitated single allocation hub location problem (USAHLP). We have proposed a hybrid heuristic for solving the USAHLP with competitive results obtained. In this note, an effective procedure to allocate the non-hubs to the capacitated hubs is developed to be embedded in the previous hybrid heuristic to solve the CSAHLP. Computational results show the presented heuristic is capable of obtaining optimal solutions for almost all small-scale problems and outperforms a simulated annealing algorithm from the literature in solving the large-scale CSAHLP. It is expected that this note can provide distribution managers an effective heuristic to design hub-and-spoke networks where the volume of traffic that a hub can collect is restricted.
Volume (Year): 1 (2008)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=286|
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:1:y:2008:i:2:p:198-216. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)
If references are entirely missing, you can add them using this form.