The Dynamic Uncapacitated Hub Location Problem

Authors:
Ivan Contreras;Jean-François Cordeau;Gilbert Laporte
Affiliations:
HEC Montréal, Montréal, Québec H3T 2A7, Canada, and Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montréal, Quebec H3T 2A7, Ca ...;HEC Montréal, Montréal, Québec H3T 2A7, Canada, and Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montréal, Quebec H3T 2A7, Ca ...;HEC Montréal, Montréal, Québec H3T 2A7, Canada, and Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Montréal, Quebec H3T 2A7, Ca ...
Venue:
Transportation Science
Year:
2011

Citing 5
Cited 6

A generalized subgradient method with relaxation step

Mathematical Programming: Series A and B
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm

Journal of Global Optimization
Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning

Computers and Operations Research
The multi-period incremental service facility location problem

Computers and Operations Research

Twenty-Five Years of Hub Location Research

Transportation Science
Choosing point-to-point versus hub-and-spoke flights: a genetic algorithmic approach

Proceedings of the 2012 Symposium on Emerging Applications of M&S in Industry and Academia Symposium
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels

Transportation Science
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering
The Vanpool Assignment Problem: Optimization models and solution algorithms

Computers and Industrial Engineering
A Stackelberg hub arc location model for a competitive environment

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangian relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangian function exploits the structure of the problem and can be decomposed into smaller subproblems that can be solved efficiently. In addition, some reduction procedures based on the Lagrangian bounds are implemented. These yield a considerable reduction of the size of the problem and thus help reduce the computational burden. Numerical results on a set of instances with up to 100 nodes and 10 time periods are reported.