Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1287/trsc.1100.0326 | Transportation Science |
Keywords | Field | DocType |
reduction procedure,hub location problem,lagrangian bound,branch-and-bound algorithm,numerical result,computational burden,lagrangian relaxation,dynamic uncapacitated hub location,smaller subproblems,considerable reduction,lagrangian function,location,dynamic analysis,branch and bound,network design | Mathematical optimization,Branch and bound,Lagrangian,Network planning and design,Lagrangian relaxation,Hub location problem,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
45 | 1 | 0041-1655 |
Citations | PageRank | References |
23 | 0.92 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Contreras | 1 | 307 | 17.90 |
| Jean-François Cordeau | 2 | 2604 | 127.77 |
| Gilbert Laporte | 3 | 8666 | 612.13 |