Toward a Reference Experimental Benchmark for Solving Hub Location Problems

Abstract

Our study provides an experimental benchmark for state-of-the-art solution algorithms with hub location problems. Such problems are fundamental optimization problems in location science with widespread application areas, such as transportation, telecommunications, economics, and geography. Given they combine aspects of facility location and quadratic assignment problems, the majority of hub location problems are NP-hard and, accordingly, several solution techniques have been proposed for solving these problems. In this study, we report on the results of a large benchmark and reproduction effort to investigate 12 fundamental hub location problems that combine single or multiple allocation, a p-hub median objective or fixed hub set-up costs, capacitated or uncapacitated hubs, and complete or incomplete networks. We implemented four standard exact algorithms on these 12 problems as proposed in the literature. Algorithms are evaluated on subsets of three standard data sets in the field (CAB, TR, and AP); we computed more than 5,000 optimal solutions for these data sets. We report comparisons of solution techniques regarding wall clock time, convergence speed, memory use, and the impact of data features. In addition, we identify patterns in optimal solutions across these 12 problems, extracting insights regarding solution similarity, hub set candidates, and economies of scale. All results and programs are being made available to the public for free academic use.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 44 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.