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

L. Cánovas, S. García, A. Marín

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

This paper 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 CAB and AP data sets) are included, showing the great effectiveness of this approach: instances with up to 120 nodes are solved.
Original languageEnglish
Pages (from-to)990-1007
Number of pages18
JournalEuropean Journal of Operational Research
Volume179
Issue number3
DOIs
Publication statusPublished - 16 Jun 2007

Fingerprint

Dive into the research topics of 'Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique'. Together they form a unique fingerprint.

Cite this