{"id":"https://openalex.org/W4294717261","doi":"https://doi.org/10.1007/s00500-022-07448-3","title":"An improved genetic algorithm with local refinement for solving hierarchical single-allocation hub median facility location problem","display_name":"An improved genetic algorithm with local refinement for solving hierarchical single-allocation hub median facility location problem","publication_year":2022,"publication_date":"2022-09-04","ids":{"openalex":"https://openalex.org/W4294717261","doi":"https://doi.org/10.1007/s00500-022-07448-3"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-022-07448-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-07448-3","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5073492122","display_name":"Arup Kumar Bhattacharjee","orcid":"https://orcid.org/0000-0002-8374-1175"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arup Kumar Bhattacharjee","raw_affiliation_strings":["Department of Computer Science and Engineering, RCC Institute of Information Technology, Kolkata, West Bengal, 700015, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, RCC Institute of Information Technology, Kolkata, West Bengal, 700015, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016363044","display_name":"Anirban Mukhopadhyay","orcid":"https://orcid.org/0000-0001-8128-3521"},"institutions":[{"id":"https://openalex.org/I77501641","display_name":"University of Kalyani","ror":"https://ror.org/03v783k16","country_code":"IN","type":"education","lineage":["https://openalex.org/I77501641"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Anirban Mukhopadhyay","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal, 741235, India"],"raw_orcid":"https://orcid.org/0000-0001-8128-3521","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal, 741235, India","institution_ids":["https://openalex.org/I77501641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016363044"],"corresponding_institution_ids":["https://openalex.org/I77501641"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.712,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.85212154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"27","issue":"3","first_page":"1493","last_page":"1509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9994000196456909,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/simulated-annealing","display_name":"Simulated annealing","score":0.7753154039382935},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6807501316070557},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6740611791610718},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6606522798538208},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6395331621170044},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6216912269592285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5868271589279175},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5436112880706787},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5244041681289673},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5215311050415039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4777747392654419},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.45210736989974976},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44631442427635193},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4411042034626007},{"id":"https://openalex.org/keywords/location-allocation","display_name":"Location-allocation","score":0.42244669795036316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24638298153877258}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7753154039382935},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6807501316070557},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6740611791610718},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6606522798538208},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6395331621170044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6216912269592285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5868271589279175},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5436112880706787},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5244041681289673},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5215311050415039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4777747392654419},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.45210736989974976},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44631442427635193},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4411042034626007},{"id":"https://openalex.org/C2778212267","wikidata":"https://www.wikidata.org/wiki/Q6664764","display_name":"Location-allocation","level":2,"score":0.42244669795036316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24638298153877258},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-022-07448-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-07448-3","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W273872335","https://openalex.org/W1482186473","https://openalex.org/W1848394459","https://openalex.org/W2005452735","https://openalex.org/W2015462215","https://openalex.org/W2017705568","https://openalex.org/W2028274662","https://openalex.org/W2037551729","https://openalex.org/W2051085860","https://openalex.org/W2118543814","https://openalex.org/W2128361327","https://openalex.org/W2149702755","https://openalex.org/W2170271059","https://openalex.org/W2235802937","https://openalex.org/W2606682693","https://openalex.org/W2798127844"],"related_works":["https://openalex.org/W2031422533","https://openalex.org/W1519721544","https://openalex.org/W2949474276","https://openalex.org/W1985012061","https://openalex.org/W3050209628","https://openalex.org/W2273445235","https://openalex.org/W2802765707","https://openalex.org/W4313891683","https://openalex.org/W2123115451","https://openalex.org/W4297093299"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}
