Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475301 | Computers & Operations Research | 2009 | 7 Pages |
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 kk-hub center problems and present computational results.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Elena O. Gavriliouk,