Article ID: | iaor20023139 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 6 |
Start Page Number: | 715 |
End Page Number: | 739 |
Publication Date: | May 2002 |
Journal: | Computers and Operations Research |
Authors: | Mayer Gabriela, Wagner Bernd |
Keywords: | heuristics |
HubLocator is a new branch-and-bound procedure for the uncapacitated multiple allocation hub location problem. An existing optimal method developed by Klincewicz is based on dual ascent and dual adjustment techniques applied to a disaggregated model formulation. These techniques have already successfully been used to solve the closely related simple plant location problem. However, due to the specific structure of the problem at hand, the success of these techniques in reducing the computational effort is rather restricted. Therefore, HubLocator additionally considers an aggregated model formulation enabling us to significantly tighten the lower bounds. Upper bounds which satisfy complementary slackness conditions for some constraints are constructed and improved by means of a simple heuristic procedure. Computational experiments demonstrate that optimal solutions for problems with up to 40 nodes can be found in a reasonable amount of time.