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

Sá, Elisangela Martins de; Camargo, Ricardo Saraiva de; Miranda, Gilberto de

doi:10.1016/j.ejor.2012.10.051

Cited by 85 publications

(45 citation statements)

References 80 publications

(110 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using Bender's decomposition, they solve the problem for up to 100 nodes. In addition to the ring structure, a tree topology on the sub-network induced by the hubs has been also studied by several researchers ( Contreras et al, 2009;de Sá et al, 2013 ).…”

Section: Related Literaturementioning

confidence: 99%

Routing and scheduling decisions in the hierarchical hub location problem

Dükkancı

Kara

2017

Computers & Operations Research

View full text Add to dashboard Cite

a b s t r a c tHubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and the allocations of demand (non-hub) nodes to these hubs. We propose a hierarchical multimodal hub network structure, and based on this network, we define a hub covering problem with a service time bound. The hierarchical network consists of three layers in which we consider a ring-star-star (RSS) network. This multimodal network may have different types of vehicles in each layer. For the proposed problem, we present and strengthen a mathematical model with some variable fixing rules and valid inequalities. Also, we develop a heuristic solution algorithm based on the subgradient approach to solve the problem in more reasonable times. We conduct the computational analysis over the Turkish network and the CAB data sets.

show abstract

Section: Related Literaturementioning

confidence: 99%

Routing and scheduling decisions in the hierarchical hub location problem

Dükkancı

Kara

2017

Computers & Operations Research

View full text Add to dashboard Cite

show abstract

“…The formulation introduces new constraints (10), (11), (12), (13) to build a small tree to connect the hubs, and to require the flow to use its edges. Constraints (10) and (11) impose the condition that h jl is a hub arc (equivalently, an edge of the small tree), when both j and l are nonempty data hubs.…”

Section: Tree Of Hubsmentioning

confidence: 99%

“…Constraints (12) ensure that the flow is routed only through hub arcs, that is, the edges of the small tree. Constraint (13) restricts the number of edges to p − 1 so that the resulting graph of hubs is a tree. Note that these edges are connected due to the constraints (6) and (12).…”

Section: Tree Of Hubsmentioning

confidence: 99%

See 1 more Smart Citation

Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem

et al. 2016

View full text Add to dashboard Cite

We consider a content distribution network (CDN) in which data hubs or servers are established in multiple locations to cater to local demands. The distributions of data to these hubs along with related network design problems (such as hub location and user assignment) are the key decision problems to consider to minimize the total routing cost. A new model for allocation of segments is introduced in Sen, Krishnamoorthy, Rangaraj and Narayanan, Comput Oper 62 (2015), 282–295, in which local preferences guide the database partitioning process, and the servers are fully connected to each other. In this article, we develop a simulated annealing (SA) approach (referred to as SA‐mesh) to solve this problem and compare its performance with the corresponding mixed‐integer linear programming (MILP) formulation. We also formulate a much harder variant of the problem in which servers are interconnected by a tree. We develop a SA algorithm (referred to as SA‐tree) for this variant, in which a local search is incorporated to find a suboptimal tree backbone. We use a customized data structure based on linked lists to represent a solution in our algorithms. This enables our algorithms to scale to much larger instances of the problem. We use optimal solutions and the benchmarks obtained by CPLEX to justify the performance of our algorithms. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(1), 4–22 2016

show abstract

“…But, because the CLSCN design involves large investment and greatly influences the operational and tactical costs as well as efficiency of service, developing efficient exact algorithms for solving larger and more realistic cases is worthwhile (de Sá et al, 2013). Among these exact solution approaches, the branch-and-bound algorithm has been a popular methodology combined with other heuristics or Lagrangian relaxation methods to obtain better bounds.…”

Section: Solution Algorithmsmentioning

confidence: 99%