Skip to main content
Kent Academic Repository

Solving the Uncapacitated Multiple Allocation Hub Location Problem by Means of a Dual-ascent Technique

Cánovas, Lázaro, García-Quiles, Sergio, Marín, Alfredo (2007) Solving the Uncapacitated Multiple Allocation Hub Location Problem by Means of a Dual-ascent Technique. European Journal of Operational Research, 179 (3). pp. 990-1007. ISSN 0377-2217. (doi:10.1016/j.ejor.2005.08.028) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30841)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1016/j.ejor.2005.08.028

Abstract

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. © 2006 Elsevier B.V. All rights reserved.

Item Type: Article
DOI/Identification number: 10.1016/j.ejor.2005.08.028
Additional information: Unmapped bibliographic data: PY - 2007/// [EPrints field already has value set] AD - Departamento de Estadística e Investigación Operativa, Universidad de Murcia, 30100 Murcia, Spain [Field not mapped to EPrints] JA - Eur J Oper Res [Field not mapped to EPrints]
Uncontrolled keywords: Dual-ascent technique, Hub location, Integer programming, Location, Algorithms, Computation theory, Heuristic methods, Integer programming, Problem solving, Trees (mathematics), Dual-ascent technique, Hub location, Tracking (position)
Subjects: H Social Sciences > HA Statistics > HA33 Management Science
Divisions: Divisions > Kent Business School - Division > Department of Marketing, Entrepreneurship and International Business
Depositing User: Catherine Norman
Date Deposited: 21 Sep 2012 11:20 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30841 (The current URI for this page, for reference purposes)

University of Kent Author Information

García-Quiles, Sergio.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.