Hub location under capacity constraints

Rodríguez, Victoria María Sueiro; Álvarez, Mario; Redín, Lucía Barcos

doi:10.1016/j.tre.2006.01.005

Cited by 71 publications

(33 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence applying the OA technique only requires the replacement of τ k (g k ) by ξ k for each k on the objective function and the addition of constraints (46) in the form (52). These are responsible for the OA of function τ k (g k ).…”

Section: The Hybrid Oa/benders Techniquementioning

confidence: 99%

See 1 more Smart Citation

Addressing congestion on single allocation hub-and-spoke networks

Camargo

Miranda

2012

Pesqui. Oper.

View full text Add to dashboard Cite

ABSTRACT. When considering hub-and-spoke networks with single allocation, the absence of alternative routes makes this kind of systems specially vulnerable to congestion effects. In order to improve the design of such networks, congestion costs must be addressed. This article deploys two different techniques for addressing congestion on single allocation hub-and-spoke networks: the Generalized Benders Decomposition and the Outer Approximation method. Both methods are able to solve large scale instances. Computational experiments show how the adoption of advanced solution strategies, such as Pareto-optimal cut generation on the Master Problem branch-and-bound tree, may be decisive. They also demonstrate that the solution effort is not only associated with the size of the instances, but also with their combination of the installation and congestion costs.

show abstract

Section: The Hybrid Oa/benders Techniquementioning

confidence: 99%

“…A common way of addressing congestion in SAHLP and SApHLP networks is to limit the amount of traffic a installed hub can handle [7,8,20,30,41,44,52]. Unfortunately, capacity constraints do not mimic the explosive nature of congestion: the more flow a hub attracts, the harder the handling process becomes, the greater the costs.…”

Section: Introductionmentioning

confidence: 99%

Addressing congestion on single allocation hub-and-spoke networks

Camargo

Miranda

2012

Pesqui. Oper.

View full text Add to dashboard Cite

show abstract

“…In general, a network is designed for efficient and cost effective flow of certain commodities between their origin-destination (O-D) pairs. The hubs have limited capacity for channelling flows between the nodes served by the system (Klincewicz, 1998;Elihedli and Hu, 2005;Rodriguez et al, 2007). In hub-and-spoke (HS) terminology, hubs are facilities that serve as switching, transshipment and sorting points whereas the source and destination nodes are collectively referred to as spoke nodes (See Figure 1).…”

Section: Introductionmentioning

confidence: 99%

Simulated annealing-based algorithm for the capacitated hub routing problem

Kumar

Sivakumar

2013

IJSOM

View full text Add to dashboard Cite

Routing traffic across a capacitated hub-and-spoke network is very common in freight transportation and telecommunications. Most of the hub-and-spoke network models available in the literature assume a fully inter-connected hub network and allow traffic to pass through a maximum of two hubs. In the absence of a fully inter-connected hub network, the traffic may have to be routed through more than two hubs. In this paper, we develop a mathematical model and a simulated annealing (SA)-based solution methodology for routing freight through not more than three hubs in a given capacitated network. We generate test problem instances to evaluate the efficacy of the mathematical model and the meta-heuristic procedure. The effect of each network parameter on the performance of the SA procedure is analysed thoroughly with extensive computational experiments and relevant statistical tests. The results show that near-optimal solutions for large problem instances can be derived in little computational time.

show abstract

“…Due to the computational complexity of these constraints, they have linearized them and then solved the resulting model by a tabu search algorithm. A similar work has been proposed by Rodriguez et al [65], but a simulated annealing algorithm has been used.…”

mentioning

confidence: 99%

Hub location under hub congestion and demand uncertainty: the Brazilian case study

et al. 2011

View full text Add to dashboard Cite

ABSTRACT. In this work, a mixed integer nonlinear programming model combining direct service links, demand uncertainty and congestion effects is proposed. This model is efficiently solved by Generalized Benders Decomposition, for instances of moderate sizes and reasonable number of scenarios. The deployed algorithms are further used for re-designing the Brazilian air transportation network, enabling the analysis of future demand scenarios and providing decision support about the optimal investment policy for Brazil.

show abstract

Hub location under capacity constraints

Cited by 71 publications

References 9 publications

Addressing congestion on single allocation hub-and-spoke networks

Addressing congestion on single allocation hub-and-spoke networks

Simulated annealing-based algorithm for the capacitated hub routing problem

Hub location under hub congestion and demand uncertainty: the Brazilian case study

Contact Info

Product

Resources

About