{"id":"https://openalex.org/W4403535498","doi":"https://doi.org/10.1109/clei64178.2024.10700162","title":"A Tabu Search Heuristic for the Clustered Prize-Collecting Arc Routing Problem","display_name":"A Tabu Search Heuristic for the Clustered Prize-Collecting Arc Routing Problem","publication_year":2024,"publication_date":"2024-08-12","ids":{"openalex":"https://openalex.org/W4403535498","doi":"https://doi.org/10.1109/clei64178.2024.10700162"},"language":"en","primary_location":{"id":"doi:10.1109/clei64178.2024.10700162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei64178.2024.10700162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 L Latin American Computer Conference (CLEI)","raw_type":"proceedings-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/A5069520441","display_name":"Guillermo Palma","orcid":"https://orcid.org/0000-0002-8111-2439"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guillermo Palma","raw_affiliation_strings":["Universidad Sim&#x00F3;n Bol&#x00ED;var,Department of Computer Science and Information Technology,Caracas,Venezuela"],"affiliations":[{"raw_affiliation_string":"Universidad Sim&#x00F3;n Bol&#x00ED;var,Department of Computer Science and Information Technology,Caracas,Venezuela","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069520441"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26221264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9873999953269958,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9873999953269958,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9858999848365784,"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/T10539","display_name":"Sustainable Supply Chain Management","score":0.9749000072479248,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and 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"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.9023654460906982},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.8798604011535645},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6199122667312622},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5884730219841003},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5838550925254822},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.553871750831604},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5485842227935791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43851515650749207},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29288554191589355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23009851574897766},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09499210119247437}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9023654460906982},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.8798604011535645},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6199122667312622},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5884730219841003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5838550925254822},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.553871750831604},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5485842227935791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43851515650749207},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29288554191589355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23009851574897766},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09499210119247437},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clei64178.2024.10700162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei64178.2024.10700162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 L Latin American Computer Conference (CLEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1987877777","https://openalex.org/W2370323645","https://openalex.org/W4247343174","https://openalex.org/W2168643831","https://openalex.org/W4243772339","https://openalex.org/W1559717033","https://openalex.org/W2139271550","https://openalex.org/W2075514833","https://openalex.org/W192716354","https://openalex.org/W2566005704"],"abstract_inverted_index":{"The":[0,32,73,95],"Clustered":[1],"Prize-collecting":[2],"Arc":[3],"Routing":[4],"Problem":[5],"(CPARP)":[6],"is":[7,21,35,42,75,110],"an":[8,14],"arc":[9],"routing":[10],"problem":[11,56],"defined":[12],"on":[13,29,99],"undirect":[15],"graph.":[16],"In":[17,83],"the":[18,30,40,55,69,78,93,100,105,113],"CPARP":[19],"there":[20,45],"a":[22,26,88],"cost":[23],"function":[24,28,34],"and":[25,51],"profit":[27,33],"edges.":[31],"applied":[36],"only":[37],"once":[38],"when":[39],"edge":[41],"serviced.":[43,72],"Also,":[44],"are":[46,63,71],"clusters":[47],"of":[48,68],"required":[49],"edges,":[50],"for":[52,92],"each":[53],"cluster,":[54],"requires":[57],"that":[58,104],"either":[59],"all":[60],"its":[61],"edges":[62,67],"serviced":[64],"or":[65],"no":[66],"cluster":[70],"aim":[74],"to":[76,112],"find":[77],"tour":[79],"with":[80],"maximum":[81],"benefit.":[82],"this":[84],"paper,":[85],"we":[86],"propose":[87],"Tabu":[89,107],"Search":[90,108],"Heuristic":[91,109],"CPARP.":[94],"experimental":[96],"results":[97],"obtained,":[98],"existent":[101],"benchmark,":[102],"show":[103],"proposed":[106],"competitive":[111],"state-of-the-art":[114],"methods.":[115]},"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}
