Peker, M.Kara, B. Y.Campbell, J. F.Alumur, S. A.2018-04-122018-04-1220161566-113Xhttp://hdl.handle.net/11693/36903Hubs are special facilities that serve as switching, transshipment and sorting nodes in many-to-many distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between hubs. In this article, we first identify general features of optimal hub locations for single allocation hub location problems based on only the fundamental problem data (demand for travel and spatial locations). We then exploit this knowledge to develop a straightforward heuristic methodology based on spatial proximity of nodes, dispersion and measures of node importance to delineate subsets of nodes likely to contain optimal hubs. We then develop constraints for these subsets for use in mathematical programming formulations to solve hub location problems. Our methodology can also help narrow an organization’s focus to concentrate on more detailed and qualitative analyses of promising potential hub locations. Results document the value of including both demand magnitude and centrality in measuring node importance and the relevant tradeoffs in solution quality and time.EnglishClustering nodesHub location problemSingle allocationSpatial distributionEconomicsHeuristic methodsLocationMathematical programmingOptimizationSite selectionSpatial distributionClustering nodesEconomies of scaleHub location problemsMany-to-many distribution systemsQualitative analysisSingle allocationSpatial proximityTransportation costProblem solvingArticle10.1007/s11067-015-9311-91572-9427