Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique

This problem deals with the uncapacitated multiple allocation hub location problem. The dual problem of a four-indexed formulation is considered and a heuristic method, based on a dual-ascent technique, is designed. This heuristic, which is reinforced with several specifical subroutines and does not require any external linear problem solver, is the core tool embedded in an exact branch-and-bound framework. Besides, the heuristic provides the branch-and-bound algorithm with good lower bounds for the nodes of the branching tree. The results of the computational experience (with the classical AP and CAB data sets) are included, showing the great effectiveness of this approach: instances of up to 120 nodes are solved.


European Journal of Operational Research, to appear.