The Dynamic Uncapacitated Hub Location Problem

The Dynamic Uncapacitated Hub Location Problem

0.00 Avg rating0 Votes
Article ID: iaor20112161
Volume: 45
Issue: 1
Start Page Number: 18
End Page Number: 32
Publication Date: Feb 2011
Journal: Transportation Science
Authors: , ,
Keywords: programming: branch and bound, location
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.

Reviews

Required fields are marked *. Your email address will not be published.