3992. Multi-period p-hub center problem with nesting property
Invited abstract in session HE-51: Hub and Service Network Design, stream Hub Location and Network Design.
Thursday, 14:15-15:45Room: HG – Seminar-Raum Geschichte 1 (1st floor, st. 10)
Authors (first author is the speaker)
| 1. | Nader Ghaffarinasab
|
| Department of Industrial Engineering, Middle East Technical University |
Abstract
We introduce the multiple allocation nested p-hub center problem, a variant of multi-period hub location problems. Over a planning horizon with a given set of origin-destination flows, hubs must be selected for each period with non-decreasing cardinality and nesting property, i.e., the hubs in period t must be a subset of hubs in period t+1. The goal is to minimize the sum of maximum transportation costs across all periods. A mixed-integer programming model and an accelerated Benders decomposition algorithm are proposed to efficiently solve large-scale instances.
Keywords
- Location Problems
- Mixed Integer Programming
- Decomposition Techniques
Status: accepted
Back to the list of papers