Network hub location problems: The state of the art

Alumur, Sibel A.; Kara, Bahar Y.

doi:10.1016/j.ejor.2007.06.008

Cited by 764 publications

(370 citation statements)

References 93 publications

Supporting

Mentioning

338

Contrasting

Unclassified

Order By: Relevance

“…Most of the researches formulate the railway express SSP as a hub-and-spoke network [1] or intermodal hub-andspoke network design problem [2][3][4][5][6]. The hub-and-spoke network problem was originally formulated to be a quadratic integer programming model by O'Kelly [7] and then later is referred to as a -hub median problem by Campbell [8].…”

Section: Literature Reviewmentioning

confidence: 99%

“…The collected data about the subindicators mentioned in Section 2 can be formulated as a information decision matrix = [ , ] × and then calculate the initial decision matrix as standardizing decision matrix = [ , ] × . There are two types of standardized methods: when the indicators are benefit-type, the calculation for normalization can be expressed as formula (1); if the indicators belong to cost-type, Mathematical Problems in Engineering 5 the calculation for normalization can be expressed as formula (2). From Section 3, we can find that all the subindicators belong to benefit-type, so all subindicators will be normalized by using the following:…”

Section: The Translation-corrected Improved Entropy Weightmentioning

confidence: 99%

See 1 more Smart Citation

Using Improved Entropy‐Cloud Model to Select High‐Speed Railway Express Freight Train Service Sites

Huang

Shen

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

High-speed railway (HSR) express freight train service sites selection is critical to the development of China's Third Party Logistics market. In this paper, we formulate an improved entropy-cloud model based approach to solve the HSR express sites selection problem for the first time. The basic data of the indicators, for example, existing railway network conditions, traffic environment, express freight market demand, and policy, will be used as the inputs. We apply improved entropy method to obtain each subindicator's weight. The cloud model will be used to select and classify each station under evaluation.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: The Translation-corrected Improved Entropy Weightmentioning

confidence: 99%

Using Improved Entropy‐Cloud Model to Select High‐Speed Railway Express Freight Train Service Sites

Huang

Shen

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Proof. Statements in (i) and (ii) follow from the fact that when nodes are fully reliable R-SAHLP reduces to traditional SA hub-and-spoke model, which has been proven to be NP-hard even hubs are fixed [2]. When hubs and all spoke allocations are fixed, (iii) simply follows from two facts that: first, optimal regular routes are completely determined by SA structure; second, optimal backup hubs and alternative routes can be determined by enumerating hubs in the network.…”

Section: Literature Reviewmentioning

confidence: 99%

“…We mention that [20] explore the polyhedral aspect of HLP and [21] develop a method of lifting facets from facility location problems(FLPs) to HLPs and derive a tighter formulation for MA fixed cost HLP. One may refer to [2] for a comprehensive review of modeling techniques and solution methods of HLP. In the remainder of this paper, unless we explicitly mention, the hub-and-spoke network design problem indicates p-hub problem.…”

Section: Literature Reviewmentioning

confidence: 99%

The reliable hub-and-spoke design problem: Models and algorithms

An¹,

Zhang²,

Zeng³

2015

Transportation Research Part B: Methodological

108

View full text Add to dashboard Cite

This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound methods are developed to efficiently obtain optimal solutions. Numerical studies of proposed solution methods on practical instances are reported, along with a few insights of system design.Key words: reliable network design; hub-and-spoke; Lagrangian Relaxation; Branch-and- Bound Background and MotivationThe hub-and-spoke system has been widely employed in various industrial applications.It is a fully connected network with material/information flow between any two nodes being processed at a small number of critical nodes (i.e. hubs) and moved through interhub links. Compared with the one built with the point-to-point structure, it has a much smaller number of links. Also, because traffic flows are consolidated by hubs and interhub links, significantly less operating cost can be achieved because of economies of scale.Given such advantages, industry companies including airlines, logistics companies, and telecommunications firms extensively utilize the hub-and-spoke architecture to reduce the construction and operating costs.

show abstract

“…Also, this kind of facility location is chiefly common in the transportation network, postal delivery network and express shipment. Alumur and Kara [4] provided a comprehensive survey about HLPs, in which most of the readers are referred to them.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Imperialism Competitive Algorithm for a Reliable Hub Covering Location Problem

Sadeghi¹,

Tavakkoli‐Moghaddam²

2015

IJMLC

View full text Add to dashboard Cite

Abstract-Hubs are critical elements that benefit networks by switching, distributing and concentrating flows. A hub location problem is common in a lot of industries, such as transportation networks, telecommunication networks, postal delivery networks and express shipment. Furthermore, a transportation network plays a vital role in each country. Nonetheless, during a day many factors such as traffic incidence, natural disasters cause some degradation in the transportation network. As a result, in this paper, we study a reliable hub covering location problem in a degradable transportation network to minimize the total transportation cost. For achieving near-optimal solutions for a real-sized problem an imperialism competitive algorithm (ICA) is proposed. Also the effectiveness of the proposed ICA is shown by some computational experiments. At last, conclusion is provided.

show abstract

Network hub location problems: The state of the art

Cited by 764 publications

References 93 publications

Using Improved Entropy‐Cloud Model to Select High‐Speed Railway Express Freight Train Service Sites

Using Improved Entropy‐Cloud Model to Select High‐Speed Railway Express Freight Train Service Sites

The reliable hub-and-spoke design problem: Models and algorithms

An Efficient Imperialism Competitive Algorithm for a Reliable Hub Covering Location Problem

Contact Info

Product

Resources

About