Spatial analysis of single allocation hub location problems

Simple item page
dc.citation.epage1101en_US
dc.citation.issueNumber4en_US
dc.citation.spage1075en_US
dc.citation.volumeNumber16en_US
dc.contributor.authorPeker, M.en_US
dc.contributor.authorKara, B. Y.en_US
dc.contributor.authorCampbell, J. F.en_US
dc.contributor.authorAlumur, S. A.en_US
dc.date.accessioned2018-04-12T10:57:00Z
dc.date.available2018-04-12T10:57:00Zen_US
dc.date.issued2016en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractHubs 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.en_US
dc.identifier.doi10.1007/s11067-015-9311-9en_US
dc.identifier.eissn1572-9427
dc.identifier.issn1566-113X
dc.identifier.urihttp://hdl.handle.net/11693/36903en_US
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s11067-015-9311-9en_US
dc.source.titleNetworks and Spatial Economicsen_US
dc.subjectClustering nodesen_US
dc.subjectHub location problemen_US
dc.subjectSingle allocationen_US
dc.subjectSpatial distributionen_US
dc.subjectEconomicsen_US
dc.subjectHeuristic methodsen_US
dc.subjectLocationen_US
dc.subjectMathematical programmingen_US
dc.subjectOptimizationen_US
dc.subjectSite selectionen_US
dc.subjectSpatial distributionen_US
dc.subjectClustering nodesen_US
dc.subjectEconomies of scaleen_US
dc.subjectHub location problemsen_US
dc.subjectMany-to-many distribution systemsen_US
dc.subjectQualitative analysisen_US
dc.subjectSingle allocationen_US
dc.subjectSpatial proximityen_US
dc.subjectTransportation costen_US
dc.subjectProblem solvingen_US
dc.titleSpatial analysis of single allocation hub location problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Spatial_analysis_of_Single_allocation_hub_location_problems.pdf
Size:
966.8 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering