Hub location problems in transportation networks

Gelareh, Shahin; Nickel, Stefan

doi:10.1016/j.tre.2011.04.009

Cited by 137 publications

(69 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, different transportation vehicles can be considered for hub level facilities like, buses, trucks, trains, taxis, planes, fast-lanes etc. Some works which have been done in this area of knowledge are Nickel et al (2001), Gelareh and Nickel (2011), Campbell (2009), Gelareh and Nickel (2008, Yaman et al (2007), Lumsden et al (1999). The hub facilities in postal delivery applications are post offices where the items for different destinations are collected, sorted into several groups and then distributed among 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

“…Equation (4) ensures that each node can be associated with one hub only. Equation (5) indicates the number of hubs is .…”

Section: Classical Single Allocation Problemmentioning

confidence: 99%

“…One hub is swapped between HS 1 and HS 2 . If they are 4 and 6, then new hub arrays are HS 1 = [6, 7, 9] and HS 2 = [4,7,8]. Next, we combine the left part of AY 1 with the right part of AY 2 , and new assignment array AY 1 is generated.…”

Section: Genetic Algorithmsmentioning

confidence: 99%

“…These problems are highly relevant in several fields, such as transportation [2][3][4][5][6] and telecommunication [7,8]; see [9][10][11] for some excellent surveys. In general, flows are routed from origin nodes to destination nodes through a "spoke-hub-hub-spoke" structure.…”

Section: Introductionmentioning

confidence: 99%

“…For complete (CSA, CMA, RSA, and RMA) problems, we set the numbers of hubs for three datasets ∈ {3, 5, 7}. For ISA problems, we set ( , ) ∈ {(2, 1), (3, 2), (3, 3), (4, 4), (4,5), (4,6), (5, 6), (5, 7), (5,8), (5, 9), (5, 10)} [18]. The visualizations of all three datasets are shown in Figure 4.…”

Section: Introduction Of Datasets and Experimentsmentioning

confidence: 99%

See 2 more Smart Citations

Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques

Sun

Dai

Zhang

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations.

show abstract

A branch‐and‐cut algorithm for hub network design problems with profits

Gao

Xia

2021

Naval Research Logistics

View full text Add to dashboard Cite

Hub network design problems with profits (HNDPPs) extend the classical hub location problems (HLPs), with the profit maximization objective. HNDPPs aim to design a service network with hub nodes and hub links, select the commodities to be served, and determine the transportation routes for the selected commodities. In this article, we allow the transportation route of each commodity to contain more than one hub link, which generalizes existing HNDPPs and is known to be more profitable. A new path-based formulation is proposed, which is then reformulated in a Benders decomposition fashion, and an exact branch-and-cut algorithm is developed to solve the Benders master problem. At the nodes of the enumeration tree, Benders decomposition algorithm is used to solve a linear relaxation of the Benders master problem. When implementing the Benders decomposition algorithm, the special structure of the subproblem is explored, based on which an efficient method is proposed to generate Benders cuts. In addition, refinements and a heuristic strategy are used to speed up the branch-and-cut algorithm. Extensive numerical experiments on benchmark instances have been carried out to verify the effectiveness and efficiency of the proposed solution method.

show abstract

Hub location problems in transportation networks

Cited by 137 publications

References 54 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

Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques

A branch‐and‐cut algorithm for hub network design problems with profits

Contact Info

Product

Resources

About