A hub location problem in designing digital data service networks: Lagrangian relaxation approach

Lee, Young-Ho; Lim, Byung Ha; Park, June S.

doi:10.1016/s0966-8349(96)00009-5

Cited by 41 publications

(14 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hub edges are considered as different types of physical media, like optical fiber, coaxial cable etc. There are some study in this area such as Carello et al (2004), and Lee et al (1996). In transportation applications, like public transportation systems, airlines, air freight, express shipmentovernight deliver-, large trucking system, postal delivery and rapid transit, the demands are physical flows in form of passengers or goods to be transferred between any of the origins and destinations.…”

Section: Fig 1 An Example Of Hub Location With 4 Hub Nodesmentioning

confidence: 99%

A literature survey of HUB location problems and methods with emphasis on the marine transportations

Zabihi¹,

Gharakhani²

2018

10.5267/j.uscm

View full text Add to dashboard Cite

This article presents a broad review of Hub location problem (HLP), and its applications. The goal of this article is to provide a review on the newest and most recent publications on Hub location and its application in real world practices since 2013. While, there are some articles which reviewed hub location problem literature but some models were not covered in those articles. In this paper, we try to include capacitated models. We survey advances in analysis and modeling of the hub location problem including its variants and solution algorithm of HLPs. We emphasize the most applicable areas for Marine Transpiration. We show that first, majority of the articles consider network domain, while there are some articles which execute HLP in discrete and continuous domain. Also, the capacitated case attracts more attention in recent years. Finally, the contribution of any type of HLP in the literature is shown schematically.

show abstract

Section: Fig 1 An Example Of Hub Location With 4 Hub Nodesmentioning

confidence: 99%

A literature survey of HUB location problems and methods with emphasis on the marine transportations

Zabihi¹,

Gharakhani²

2018

10.5267/j.uscm

View full text Add to dashboard Cite

show abstract

“…Pirkul and Schilling [37] present a successful implementation of Lagrangian Relaxation for UHLP. Lee et al [32] apply Lagrangian Relaxation to the problem of designing a network with a tree backbone and star access networks.…”

Section: Lagrangian Relaxation Heuristicmentioning

confidence: 99%

“…Lee et al [32] also consider the same topology. They present a formulation to determine a network that minimizes the cost of installing hubs, the cost of assigning terminals to these hubs, and the cost of establishing the links of the spanning tree.…”

Section: Introductionmentioning

confidence: 99%

Solving the hub location problem in a star–star network

Yaman¹

2007

Networks

View full text Add to dashboard Cite

We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals and routing the traffic between hubs and the central node. We present two formulations and show that the constraints are facet-defining inequalities in both cases. We test the formulations on a set of instances. Finally, we present a heuristic based on Lagrangian relaxation.

show abstract

“…For instance, depending on the criterion used for establishing the inter-hub connections, many related applications can then be seen as special cases of hub-and-spoke systems: (i) Multi-modal urban transportation (Bruno et al, 1998;Nickel et al, 2000;cGelareh, 2008;Chen et al, 2008;Marí n and Jaramillo, 2009), (ii) telecommunication networks (Hu, 1974;Kim and Tcha, 1992;Lee et al, 1994Lee et al, , 1996Klincewicz, 1998), (iii) tree-shaped facilities location problems (Kim et al, 1996;Puerto and Tamir, 2005), (iv) ring-star network designs Laporte and Martı´n, 2007), and (v) incomplete hub networks (Campbell et al, 2005a,b;Yoon and Current, 2008;Alumur and Kara, 2008a;Calik et al, 2009;Alumur et al, 2009).…”

Section: Introductionmentioning

confidence: 99%

An improved Benders decomposition algorithm for the tree of hubs location problem

Sá

Camargo

Miranda

2013

European Journal of Operational Research

View full text Add to dashboard Cite

A hub location problem in designing digital data service networks: Lagrangian relaxation approach

Cited by 41 publications

References 5 publications

A literature survey of HUB location problems and methods with emphasis on the marine transportations

A literature survey of HUB location problems and methods with emphasis on the marine transportations

Solving the hub location problem in a star–star network

An improved Benders decomposition algorithm for the tree of hubs location problem

Contact Info

Product

Resources

About