Aggregation in hub location problems

Abstract

Because of their widespread use in real-world transportation situations, hub location models have been extensively studied in the last two decades. Many types of hub location problems are NP-hard and remain unmanageable when the number of nodes exceeds 200. We present a way to tackle large-sized problems using aggregation, explore the resulting error, and show how to reduce it. Furthermore, we develop a heuristic based on aggregation for k -hub center problems and present computational results.