scispace - formally typeset
Book ChapterDOI

Hub Location Problems

Ivan Contreras
- pp 311-344
TLDR
This chapter overviews the key distinguishing features, assumptions and properties commonly considered in HLPs, and highlights the role location and network design decisions play in the formulation and solution of HLPs.
Abstract
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.

read more

Citations
More filters
Journal Article

Integer programming formulations of discrete hub location problems

James F. Campbell
- 01 Jan 1996 - 
TL;DR: In this paper, integer programming formulations for four types of discrete hub location problems are presented: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
Book ChapterDOI

intermodal transportation

TL;DR: In this paper , the authors provide an overview of the evolution of the field and presenting methodological developments proposed to address a number of important operations and planning issues: system and service design, container fleet management, planning of container terminal operations, and national planning.
Journal ArticleDOI

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

TL;DR: A mixed integer programming formulation for this hub location and routing problem is proposed and a branch-and-cut algorithm is developed which is tested on CAB and AP instances from the literature and shown to be strong and able to solve instances with up to 50 nodes.
Journal ArticleDOI

Robust intermodal hub location under polyhedral demand uncertainty

TL;DR: In this article, the robust uncapacitated multiple allocation p-hub median problem under polyhedral demand uncertainty is considered, and two Benders decomposition based exact solution algorithms are proposed.
Journal ArticleDOI

A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities

TL;DR: In this article, the authors focus on the development of a modeling framework for multi-period stochastic capacitated multiple allocation hub location problems, where uncertainty is assumed for the demands and the goal is to minimize the total expected cost.
References
More filters
Journal ArticleDOI

A Quadratic Integer Program for the Location of Interacting Hub facilities

TL;DR: In this paper, a new formulation of a general hub location model as a quadratic integer program was reported, and a variety of alternative solution strategies were discussed. But the non-convexity of the objective function makes the problem difficult.
Journal ArticleDOI

Network hub location problems : The state of the art

TL;DR: This paper classifies and surveys network hub location models, includes some recent trends on hub location and provides a synthesis of the literature.
Journal ArticleDOI

Fifty Years of Vehicle Routing

TL;DR: In this article, the authors provide a brief account of the development in the field of exact algorithms and heuristics for the VRP and present a metaheuristic for the problem.

Fifty Years of Vehicle Routing

TL;DR: The Vehicle Routing Problem was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem” and has given rise to major developments in the fields of exact algorithms and heuristics.
Journal ArticleDOI

Integer programming formulations of discrete hub location problems

TL;DR: In this article, the authors present integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.
Related Papers (5)