Exact and heuristic algorithms for the design of hub networks with multiple lines

DOI10.1016/J.EJOR.2015.04.017zbMath1346.90509OpenAlexW1970712172MaRDI QIDQ319742

Elisangela Martins de Sá, Jean-François Cordeau, Iván A. Contreras

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.017

zbMATH Keywords

network designlineshub locationhub-and-spoke networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (15)

An exact algorithm for the modular hub location problem with single assignments ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ \(p\)-hub median problem for non-complete networks ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Exact solution of hub network design problems with profits ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network ⋮ On carriers collaboration in hub location problems

Cites Work

• Tight bounds from a path based formulation for the tree of hub location problem
• Urban rapid transit network design: accelerated Benders decomposition
• An extension to rapid transit network design problem
• Urban rapid transit network capacity expansion
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• The tree of hubs location problem
• A quadratic integer program for the location of interacting hub facilities
• A probabilistic heuristic for a computationally difficult set covering problem
• Partitioning procedures for solving mixed-variables programming problems
• A review of extensive facility location in networks
• A multi-modal approach to the location of a rapid transit line
• Exact and heuristic approaches for the cycle hub location problem
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Topological design of a two-level network with ring-star configuration
• Network hub location problems: The state of the art
• Analysis of the Parameters of Transfers in Rapid Transit Network Design
• Hub Location as the Minimization of a Supermodular Set Function
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Solving the hub location problem in a star–star network
• Variable neighborhood search: Principles and applications

This page was built for publication: Exact and heuristic algorithms for the design of hub networks with multiple lines