{"id":"https://openalex.org/W7104037726","doi":"https://doi.org/10.5281/zenodo.17530157","title":"An Exact Method for the Uncapacitated Single Allocation Planar Hub Location Problem","display_name":"An Exact Method for the Uncapacitated Single Allocation Planar Hub Location Problem","publication_year":2025,"publication_date":"2025-11-05","ids":{"openalex":"https://openalex.org/W7104037726","doi":"https://doi.org/10.5281/zenodo.17530157"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.17530157","doi":"https://doi.org/10.5281/zenodo.17530157","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.17530157","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"volume":null,"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.17530157","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Derya Dinler","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Derya Dinler","raw_affiliation_strings":["University of Calabria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51998224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hub-location-problem","display_name":"hub location problem","score":0.7649999856948853},{"id":"https://openalex.org/keywords/hub-and-spoke-networks","display_name":"hub-and-spoke networks","score":0.968999981880188},{"id":"https://openalex.org/keywords/exact-algorithms","display_name":"exact algorithms","score":0.6639999747276306},{"id":"https://openalex.org/keywords/mixed-integer-second-order-cone-programming","display_name":"mixed-integer second-order cone programming","score":0.9120000004768372},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.5049999952316284},{"id":"https://openalex.org/keywords/linearization-of-nonlinear-terms","display_name":"linearization of nonlinear terms","score":0.7760000228881836},{"id":"https://openalex.org/keywords/genetic-algorithm-comparison","display_name":"genetic algorithm comparison","score":0.6460000276565552}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7193999886512756},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.6779000163078308},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4832000136375427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43470001220703125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41110000014305115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.40790000557899475},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.40790000557899475},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.37529999017715454},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3734000027179718},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C108713360","wikidata":"https://www.wikidata.org/wiki/Q1824206","display_name":"Supply chain","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5281/zenodo.17530157","doi":"https://doi.org/10.5281/zenodo.17530157","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.17530157","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.5281/zenodo.17530157","doi":"https://doi.org/10.5281/zenodo.17530157","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.17530157","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.428600013256073}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hub-and-spoke":[0],"networks":[1],"play":[2],"a":[3,84,111,134,175,218,224],"significant":[4],"role":[5],"in":[6,39,198,207],"various":[7],"fields":[8],"such":[9],"as":[10,83,133],"transportation,":[11],"telecommunications,":[12],"and":[13,69,94,110,213],"supply":[14],"chain":[15],"management.":[16],"In":[17],"this":[18,149],"study,":[19],"we":[20],"address":[21],"the":[22,26,76,107,118,122,128,144,151,158,169,180,190,204],"problem":[23,80,129,159],"of":[24,28,91,124,146,209],"meeting":[25],"demand":[27],"n":[29],"given":[30],"customers":[31,46,60],"(spokes)":[32],"through":[33,63],"p":[34],"hubs":[35,65,70],"to":[36,50,104,116],"be":[37,48,72],"located":[38],"continuous":[40],"space.":[41],"It":[42],"is":[43,81,114,130,150,172,228],"assumed":[44],"that":[45,189],"must":[47],"assigned":[49],"single":[51],"hub,":[52],"hub":[53],"capacities":[54],"are":[55,61,66,102,163],"unlimited,":[56],"all":[57],"flows":[58],"between":[59],"routed":[62],"hubs,":[64],"fully":[67],"connected,":[68],"can":[71],"positioned":[73],"anywhere":[74],"on":[75,182],"plane.":[77],"The":[78,186],"considered":[79],"formulated":[82],"nonlinear":[85],"mathematical":[86],"program":[87],"which":[88],"involves":[89],"products":[90,123],"decision":[92,125],"variables":[93],"Euclidean":[95,108],"distances.":[96],"Second":[97,137],"Order":[98,138],"Cone":[99,139],"(SOC)":[100],"constraints":[101],"employed":[103],"accurately":[105],"represent":[106],"distances,":[109],"linearization":[112],"approach":[113],"introduced":[115],"handle":[117],"nonlinearities":[119],"arising":[120],"from":[121,179],"variables.":[126],"Thus,":[127],"efficiently":[131],"modeled":[132],"Mixed":[135],"Integer":[136],"Programming":[140],"(MISOCP)":[141],"formulation.":[142],"To":[143],"best":[145],"our":[147],"knowledge,":[148],"first":[152],"exact":[153,191],"solution":[154,211,227],"method":[155,192],"proposed":[156,170],"for":[157,217],"even":[160],"though":[161],"there":[162],"some":[164],"heuristics.":[165],"Through":[166],"computational":[167,214],"experiments,":[168],"MISOCP":[171],"compared":[173],"with":[174],"well-known":[176],"genetic":[177,205],"algorithm":[178,206],"literature":[181],"small":[183],"sized":[184],"instances.":[185],"results":[187],"demonstrate":[188],"not":[193],"only":[194],"yields":[195],"optimal":[196],"solutions":[197],"reasonable":[199],"time,":[200],"but":[201],"also":[202],"outperforms":[203],"terms":[208],"both":[210],"quality":[212],"time.":[215],"Furthermore,":[216],"larger":[219],"81-node":[220],"real-life":[221],"Turkish":[222],"dataset,":[223],"high-quality":[225],"feasible":[226],"obtained":[229],"within":[230],"2-hour":[231],"time":[232],"limit.":[233]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}