Cánovas, L. and García, S. and Marín, A. (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 03772217 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|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
H Social Sciences > HA Statistics > HA33 Management Science
|Divisions:||Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
|Depositing User:||Cathy Norman|
|Date Deposited:||21 Sep 2012 11:20|
|Last Modified:||15 Oct 2012 08:31|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/30841 (The current URI for this page, for reference purposes)|
- Depositors only (login required):