Solving the hub location problem in a star–star network

Yaman, Hande

doi:10.1002/net.20193

Cited by 63 publications

(37 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then all three levels of the network have star structures. Variants of this problem where the root node is given a priori are studied in the literature (see e.g., Labbé and Yaman, 2008;Yaman, 2008).…”

Section: A Nonlinear 0-1 Model For Sa-h-hmmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

Self Cite

110

View full text Add to dashboard Cite

a b s t r a c tWe study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and central hubs, respectively. The problem is to decide on the locations of a predetermined number of hubs and central hubs and the connections in order to minimize the total routing cost in the resulting network. This problem includes the classical p-hub median problem as a special case. We also consider a version of this problem where service quality considerations are incorporated through delivery time restrictions. We propose mixed integer programming models for these two problems and report the outcomes of a computational study using the CAB data and the Turkey data.

show abstract

Section: A Nonlinear 0-1 Model For Sa-h-hmmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

Self Cite

110

View full text Add to dashboard Cite

show abstract

“…The important question is how does LD r compare to the bounds of the LP relaxations of SM1 and SM2. The proof of the below statement is similar to the proof of Proposition 2 in [1] and so is omitted.…”

Section: We Open the P Hubs With Smallest Lr J ( ) Values) Let Ld = mentioning

confidence: 98%

“…If S is a minimum cut with capacity (S), then LR r j ( ) = + (S) − i∈I \{j } (− ij ) + (see [1] for a detailed explanation). Hence LR r ( ) can be computed by solving n mincut problems.…”

Section: Proposition 1 Ld R Is Equal To the Bound Of The Lp Relaxatimentioning

confidence: 99%

“…The problem SM has applications in telecommunications and transportation [1]. Our motivation to study this problem comes from the cargo delivery sector.…”

Section: Introductionmentioning

confidence: 99%

“…Labbé and Yaman [1] study a closely related problem to SM where there is a cost for routing the traffic in the network rather than a cost for installing links. In their problem, the number of hubs is not fixed and the cost of locating hubs is included in the total cost.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Star p-hub median problem with modular arc capacities

Yaman

2008

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuristic algorithm to solve this problem. The heuristic is based on Lagrangian relaxation and local search. We present computational results where formulations are compared and the quality of the heuristic solutions are tested. ᭧

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

Solving the hub location problem in a star–star network

Cited by 63 publications

References 45 publications

The hierarchical hub median problem with single assignment

The hierarchical hub median problem with single assignment

Star p-hub median problem with modular arc capacities

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

Contact Info

Product

Resources

About