{"id":"https://openalex.org/W124018583","doi":null,"title":"A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem","display_name":"A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem","publication_year":2012,"publication_date":"2012-01-26","ids":{"openalex":"https://openalex.org/W124018583","mag":"124018583"},"language":"en","primary_location":{"id":"mag:124018583","doi":null,"is_oa":false,"landing_page_url":"https://cai.type.sk/content/2010/1/a-genetic-algorithm-approach-for-the-capacitated-single-allocation-p-hub-median-problem/1663.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computing and Informatics / Computers and Artificial Intelligence","raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076458660","display_name":"Zorica Stanimirovi\u0107","orcid":"https://orcid.org/0000-0001-5658-4111","observed_orcids":["https://orcid.org/0000-0001-5658-4111"]},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Zorica Stanimirovi\u0107","raw_affiliation_strings":["University of Belgrade"],"raw_orcid":"https://orcid.org/0000-0001-5658-4111","affiliations":[{"raw_affiliation_string":"University of Belgrade","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076458660"],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":null,"apc_paid":null,"fwci":11.064,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.9777315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"117","last_page":"132"},"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.9955999851226807,"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.9955999851226807,"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.001500000013038516,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hub-location","display_name":"hub location","score":0.7710000276565552},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9480000138282776},{"id":"https://openalex.org/keywords/heuristic-optimization","display_name":"heuristic optimization","score":0.6259999871253967},{"id":"https://openalex.org/keywords/binary-encoding","display_name":"binary encoding","score":0.9070000052452087},{"id":"https://openalex.org/keywords/telecommunications-network-design","display_name":"telecommunications network design","score":0.9269999861717224},{"id":"https://openalex.org/keywords/transportation-network-design","display_name":"transportation network design","score":0.8550000190734863}],"concepts":[{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.7454048991203308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6071951389312744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5918697714805603},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5570804476737976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.536062479019165},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5092207193374634},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4743165671825409},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.442148357629776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21977150440216064},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12564441561698914},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08249938488006592},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:124018583","doi":null,"is_oa":false,"landing_page_url":"https://cai.type.sk/content/2010/1/a-genetic-algorithm-approach-for-the-capacitated-single-allocation-p-hub-median-problem/1663.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computing and Informatics / Computers and Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6773999929428101,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"sustainable_development_goals_aurora":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W158510796","https://openalex.org/W1572785861","https://openalex.org/W1968911485","https://openalex.org/W2002012598","https://openalex.org/W2021117098","https://openalex.org/W2021993623","https://openalex.org/W2037160560","https://openalex.org/W2037551729","https://openalex.org/W2077138150","https://openalex.org/W2090762670","https://openalex.org/W2116660011","https://openalex.org/W2164744463","https://openalex.org/W2484559226"],"related_works":["https://openalex.org/W1968911485","https://openalex.org/W2164744463","https://openalex.org/W1496571302","https://openalex.org/W2312256379","https://openalex.org/W25088793","https://openalex.org/W2030778985","https://openalex.org/W7095333156","https://openalex.org/W3012155451","https://openalex.org/W25941741","https://openalex.org/W2005053025"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"the":[3,22,43,62,74],"Capacitated":[4],"Single":[5],"Allocation":[6],"p-Hub":[7],"Median":[8],"Problem":[9],"(CSApHMP)":[10],"is":[11,39,58,91],"considered.":[12],"This":[13],"problem":[14],"has":[15],"a":[16,34],"wide":[17],"range":[18],"of":[19,24],"applications":[20],"within":[21],"design":[23],"telecommunication":[25],"and":[26,51],"transportation":[27],"systems.":[28],"A":[29],"heuristic":[30],"method,":[31],"based":[32],"on":[33,94],"genetic":[35,53],"algorithm":[36,47,90],"(GA)":[37],"approach,":[38],"proposed":[40],"for":[41,81],"solving":[42],"CSApHMP.":[44],"The":[45,55,89],"described":[46],"uses":[48],"binary":[49],"encoding":[50],"modified":[52],"operators.":[54],"caching":[56],"technique":[57],"also":[59,92],"implemented":[60],"in":[61,64],"GA":[63,75],"order":[65],"to":[66,86,101,108],"improve":[67],"its":[68],"effectiveness.":[69],"Computational":[70],"experiments":[71],"demonstrate":[72],"that":[73,104],"method":[76],"quickly":[77],"reaches":[78],"optimal":[79],"solutions":[80],"hub":[82,97],"instances":[83,98],"with":[84,99],"up":[85,100],"50":[87],"nodes.":[88],"benchmarked":[93],"large":[95],"scale":[96],"200":[102],"nodes":[103],"are":[105],"not":[106],"solved":[107],"optimality":[109],"so":[110],"far.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2016-06-24T00:00:00"}