{"id":"https://openalex.org/W1966416998","doi":"https://doi.org/10.1080/00207160512331323380","title":"Genetic algorithm to solve thep-centre andp-radius problem on a network","display_name":"Genetic algorithm to solve thep-centre andp-radius problem on a network","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W1966416998","doi":"https://doi.org/10.1080/00207160512331323380","mag":"1966416998"},"language":"en","primary_location":{"id":"doi:10.1080/00207160512331323380","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160512331323380","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5000757805","display_name":"Sk. Md. Abu Nayeem","orcid":"https://orcid.org/0000-0002-3966-0941"},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"SK. MD. Abu Nayeem","raw_affiliation_strings":["a Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"a Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039205000","display_name":"Madhumangal Pal","orcid":"https://orcid.org/0000-0002-6709-836X"},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Madhumangal Pal","raw_affiliation_strings":["a Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"a Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming , Vidyasagar University , Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039205000"],"corresponding_institution_ids":["https://openalex.org/I41549804"],"apc_list":null,"apc_paid":null,"fwci":2.1755,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89386651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"82","issue":"5","first_page":"541","last_page":"550"},"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.9994999766349792,"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.9994999766349792,"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.9936000108718872,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6429637670516968},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.6007765531539917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5951663255691528},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5688123106956482},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5488534569740295},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4733714461326599},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39676254987716675},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2695884704589844},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1525374948978424}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6429637670516968},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.6007765531539917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5951663255691528},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5688123106956482},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5488534569740295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4733714461326599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39676254987716675},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2695884704589844},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1525374948978424},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160512331323380","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160512331323380","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1521571351","https://openalex.org/W1527658630","https://openalex.org/W1984953641","https://openalex.org/W2007572995","https://openalex.org/W2023672749","https://openalex.org/W2032624334","https://openalex.org/W2073623633","https://openalex.org/W2097571405","https://openalex.org/W2142183404","https://openalex.org/W2164043220","https://openalex.org/W2606195968","https://openalex.org/W2799004609","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W4210424113","https://openalex.org/W4213214460","https://openalex.org/W4239852074"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2002282073","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W2790190308","https://openalex.org/W1991411408"],"abstract_inverted_index":{"The":[0,26,50],"p-centre":[1],"problem":[2,27,43],"is":[3,28],"to":[4,13,22,40,62],"locate":[5],"p":[6,82],"facilities":[7],"on":[8],"a":[9,19],"network":[10,76],"so":[11],"as":[12,54],"minimize":[14],"the":[15,57,65,71],"largest":[16],"distance":[17],"from":[18,70],"demand":[20,58],"point":[21],"its":[23],"nearest":[24],"facility.":[25],"NP-complete":[29],"for":[30,74,87],"an":[31],"arbitrary":[32],"network.":[33],"In":[34],"this":[35,42],"paper,":[36],"genetic":[37],"algorithms":[38],"(GAs)":[39],"solve":[41],"are":[44,52,60,83],"developed":[45],"via":[46],"two":[47,88],"different":[48,75,79,89],"representations.":[49,90],"nodes":[51],"taken":[53],"weighted,":[55],"and":[56,78,85],"points":[59],"assumed":[61],"coincide":[63],"with":[64],"nodes.":[66],"Computational":[67],"results":[68],"obtained":[69],"proposed":[72],"GAs":[73],"sizes":[77],"values":[80],"of":[81],"presented":[84],"compared":[86]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2016-06-24T00:00:00"}