{"id":"https://openalex.org/W4313143336","doi":"https://doi.org/10.1145/3555962.3555965","title":"Effective and Efficient Heuristic Approaches for Solving the Capacitated P-Median Clustering Problem","display_name":"Effective and Efficient Heuristic Approaches for Solving the Capacitated P-Median Clustering Problem","publication_year":2022,"publication_date":"2022-08-18","ids":{"openalex":"https://openalex.org/W4313143336","doi":"https://doi.org/10.1145/3555962.3555965"},"language":"en","primary_location":{"id":"doi:10.1145/3555962.3555965","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3555962.3555965","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3555962.3555965","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 6th International Conference on Cloud and Big Data Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3555962.3555965","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053225136","display_name":"Alfredo Cuzzocrea","orcid":"https://orcid.org/0000-0002-7104-6415"},"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":false,"raw_author_name":"Alfredo Cuzzocrea","raw_affiliation_strings":["University of Calabria, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026981405","display_name":"Edoardo Fadda","orcid":"https://orcid.org/0000-0002-5599-6349"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Edoardo Fadda","raw_affiliation_strings":["Politecnico di Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101851101","display_name":"Emilio Leonardi","orcid":"https://orcid.org/0000-0002-3070-4274"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Emilio Leonardi","raw_affiliation_strings":["Politecnico di Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.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.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/cluster-analysis","display_name":"Cluster analysis","score":0.7111459374427795},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6507460474967957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6002686619758606},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4649540185928345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31928491592407227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26794153451919556}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7111459374427795},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6507460474967957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6002686619758606},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4649540185928345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31928491592407227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26794153451919556}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3555962.3555965","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3555962.3555965","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3555962.3555965","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 6th International Conference on Cloud and Big Data Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3555962.3555965","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3555962.3555965","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3555962.3555965","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 6th International Conference on Cloud and Big Data Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4313143336.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1607536537","https://openalex.org/W1967308242","https://openalex.org/W2038841623","https://openalex.org/W2044294446","https://openalex.org/W2073316024","https://openalex.org/W2077510448","https://openalex.org/W2086683901","https://openalex.org/W2088553860","https://openalex.org/W2149846061","https://openalex.org/W2910330388","https://openalex.org/W3004414331","https://openalex.org/W4224551309"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"The":[0,34],"Capacitated":[1,81],"Clustering":[2],"Problem":[3],"(CCP)":[4],"involves":[5],"the":[6,15,21,31,43,47,57,60,64,75,80,86,94,118,124,139,145],"definition":[7],"of":[8,59,66,74,85,96,127],"capacity-constrained":[9],"weighted":[10],"individuals\u2019":[11,35],"sets":[12],"such":[13],"that":[14],"maximum":[16],"similarity":[17],"with":[18],"respect":[19,149],"to":[20,30,46,51,143,148],"cluster":[22,49,69],"center":[23,65],"value":[24],"is":[25,70,98],"granted":[26],"among":[27],"points":[28],"belonging":[29,45],"same":[32,48],"cluster.":[33,76],"weights":[36],"are":[37,137],"represented":[38],"by":[39,89],"their":[40,133],"demand,":[41],"all":[42],"demands":[44],"have":[50],"be":[52],"covered.":[53],"This":[54],"work":[55],"concerns":[56],"application":[58],"CCP":[61],"problem":[62,87,110],"where":[63,93],"a":[67,71,113],"given":[68],"particular":[72],"individual":[73],"We":[77],"focused":[78],"on":[79,132],"p-Median":[82],"(CpMP)":[83],"variant":[84],"proposed":[88],"Mulvay":[90],"and":[91],"Beck,":[92],"number":[95,126],"clusters":[97,128,147],"given.":[99],"Specifically,":[100],"we":[101],"propose":[102],"its":[103],"mathematical":[104],"programming":[105],"formulation":[106],"and,":[107],"being":[108],"this":[109],"NP":[111],"hard,":[112],"two-phase":[114],"polynomial":[115],"heuristic":[116],"algorithm:":[117],"first":[119],"phase":[120],"consists":[121],"in":[122],"generating":[123],"desired":[125],"without":[129],"any":[130],"constraint":[131],"capacity":[134,150],"(different":[135],"variations":[136],"provided);":[138],"second":[140],"one":[141],"aims":[142],"capacitate":[144],"former":[146],"limits.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
