Benders decomposition for the uncapacitated multiple allocation hub location problem

In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destinatio...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 35; no. 4; pp. 1047 - 1064
Main Authors de Camargo, R.S., Miranda, G., Luna, H.P.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 01.04.2008
Elsevier Science
Pergamon Press Inc
Subjects
Algorithms
Allocations
Applied sciences
Benders decomposition
Exact sciences and technology
Hub-and-spoke networks
Large-scale optimization
Logistics
Network hubs
Operational research and scientific management
Operational research. Management science
Studies
Benders decomposition
Hub-and-spoke networks
Large-scale optimization
Channel capacity
Partition method
Transportation system
Network hub
Distribution cost
Telecommunication
Topology
Location problem
Optimization
Economy
Information flow
Large scale
Logistics
Online AccessGet full text

Cover

More Information
Summary:In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported on links established between hubs, being then splitted and delivered to its final destination. Systems with this sort of topology are named hub-and-spoke (HS) systems or hub-and-spoke networks. They are designed to exploit the scale economies attainable through the shared use of high capacity links between hubs. Therefore, the problem is to find the least expensive HS network, selecting hubs and assigning traffic to them, given the demands between each origin–destination pair and the respective transportation costs. In the present paper, we present efficient Benders decomposition algorithms based on a well known formulation to tackle the UMAHLP. We have been able to solve some large instances, considered ‘out of reach’ of other exact methods in reasonable time.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2006.07.002