A branch-and-cut algorithm for the hub location and routing problem

Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande

doi:10.1016/j.cor.2014.04.014

Cited by 82 publications

(34 citation statements)

References 50 publications

(86 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Catanzaro et al (2011) study a incomplete hub network design problem with additional graph partitioning and routing decisions. Rodríguez-Martín et al (2014) introduce a BC algorithm for a hub location-routing problem, which is able to solve instances with up to 50 nodes.…”

Section: Lower Bounding Procedures and Exact Algorithmsmentioning

confidence: 99%

Hub Location Problems

Contreras

2015

Location Science

View full text Add to dashboard Cite

Hub Location Problems (HLPs) lie at the heart of network design planning in transportation and telecommunication systems. They are a challenging class of optimization problems that focus on the location of hub facilities and on the design of hub networks. This chapter overviews the key distinguishing features, assumptions and properties commonly considered in HLPs. We highlight the role location and network design decisions play in the formulation and solution of HLPs. We also provide a concise overview of the main developments and most recent trends in hub location research. We cover various topics such as hub network topologies, flow dependent discounted costs, capacitated models, uncertainty, dynamic and multi-modal models, and competition and collaboration. We also include a summary of the most successful integer programming formulations and efficient algorithms that have been recently developed for the solution of HLPs.

show abstract

Section: Lower Bounding Procedures and Exact Algorithmsmentioning

confidence: 99%

Hub Location Problems

Contreras

2015

Location Science

View full text Add to dashboard Cite

show abstract

“…O'Kelly and Bryan (1998) dealt with flowdependent costs and congestion cost was considered by de Camargo et al (2009), De Camargo et al (2011) , de Camargo and Miranda (2012) among others. Rodríguez-Martín et al (2014) proposed a model of hub location and routing; Correia et al (2014) dealt with multi-product and capacity; and Sasaki et al (2014) studied a competitive hub location based on Stackelberg games.…”

Section: Literature Reviewmentioning

confidence: 99%

Bi-objective load balancing multiple allocation hub location: a compromise programming approach

et al. 2020

View full text Add to dashboard Cite

In this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

show abstract

“…Rodríguez-Martín et al [16] propose a family of valid inequalities that dominate constraints (8). Let {i, i } ∈ E, S ⊂ V such that i ∈ S and i ∈ V \ S.…”

Section: Valid Inequalitiesmentioning

confidence: 99%

Hierarchical Survivable Network Design Problems

Rodríguez-Martín

Salazar-González

Yaman

2016

Electronic Notes in Discrete Mathematics

Self Cite

View full text Add to dashboard Cite

We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals must be assigned to hubs and connected to them through access networks, being the objective to minimize the total cost. We consider two survivable structures, two-edge connected (2EC) networks and rings, in both levels of the network. We present an integer programming formulation for these problems, solve them using a branch-and-cut algorithm, and show some computational results.

show abstract

A branch-and-cut algorithm for the hub location and routing problem

Cited by 82 publications

References 50 publications

Hub Location Problems

Hub Location Problems

Bi-objective load balancing multiple allocation hub location: a compromise programming approach

Hierarchical Survivable Network Design Problems

Contact Info

Product

Resources

About