{"id":"https://openalex.org/W4309263202","doi":"https://doi.org/10.1109/pais56586.2022.9946880","title":"A partial tours based path-scanning heuristic for the capacitated arc routing problem","display_name":"A partial tours based path-scanning heuristic for the capacitated arc routing problem","publication_year":2022,"publication_date":"2022-10-12","ids":{"openalex":"https://openalex.org/W4309263202","doi":"https://doi.org/10.1109/pais56586.2022.9946880"},"language":"en","primary_location":{"id":"doi:10.1109/pais56586.2022.9946880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pais56586.2022.9946880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 4th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5036911995","display_name":"Badis Bensedira","orcid":null},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]},{"id":"https://openalex.org/I4210160465","display_name":"Universit\u00e9 Constantine 2","ror":"https://ror.org/056mctw68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210160465"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Badis Bensedira","raw_affiliation_strings":["08 May 1945 University,Department of Computer Science,Guelma,Algeria","Department of Computer Science, 08 May 1945 University, Guelma, Algeria","LISIA Laboratory, University of Abdelhamid Mehri, Constantine, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"08 May 1945 University,Department of Computer Science,Guelma,Algeria","institution_ids":["https://openalex.org/I4210097536"]},{"raw_affiliation_string":"Department of Computer Science, 08 May 1945 University, Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]},{"raw_affiliation_string":"LISIA Laboratory, University of Abdelhamid Mehri, Constantine, Algeria","institution_ids":["https://openalex.org/I4210160465"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016921626","display_name":"Abdesslem Layeb","orcid":"https://orcid.org/0000-0002-6553-8253"},"institutions":[{"id":"https://openalex.org/I4210160465","display_name":"Universit\u00e9 Constantine 2","ror":"https://ror.org/056mctw68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210160465"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdesslam Layeb","raw_affiliation_strings":["University of Abdelhamid Mehri,LISIA Laboratory,Constantine,Algeria","LISIA Laboratory, University of Abdelhamid Mehri, Constantine, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Abdelhamid Mehri,LISIA Laboratory,Constantine,Algeria","institution_ids":["https://openalex.org/I4210160465"]},{"raw_affiliation_string":"LISIA Laboratory, University of Abdelhamid Mehri, Constantine, Algeria","institution_ids":["https://openalex.org/I4210160465"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024393163","display_name":"Zakaria Zendaoui","orcid":null},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Zakaria Zendaoui","raw_affiliation_strings":["08 May 1945 University,Department of Computer Science,Guelma,Algeria","Department of Computer Science, 08 May 1945 University, Guelma, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"08 May 1945 University,Department of Computer Science,Guelma,Algeria","institution_ids":["https://openalex.org/I4210097536"]},{"raw_affiliation_string":"Department of Computer Science, 08 May 1945 University, Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]}]}],"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":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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/arc-routing","display_name":"Arc routing","score":0.7742293477058411},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6924507021903992},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6421631574630737},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6329010128974915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.611190915107727},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.551247239112854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46820929646492004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2306768000125885},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19317996501922607},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1441306173801422}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.7742293477058411},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6924507021903992},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6421631574630737},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6329010128974915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.611190915107727},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.551247239112854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46820929646492004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2306768000125885},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19317996501922607},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1441306173801422},{"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/pais56586.2022.9946880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pais56586.2022.9946880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 4th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2006140965","https://openalex.org/W2017695941","https://openalex.org/W2036924136","https://openalex.org/W2039011874","https://openalex.org/W2039621427","https://openalex.org/W2044807391","https://openalex.org/W2055882545","https://openalex.org/W2056839836","https://openalex.org/W2070561727","https://openalex.org/W2071463225","https://openalex.org/W2078408696","https://openalex.org/W2080182237","https://openalex.org/W2092395565","https://openalex.org/W2155597893","https://openalex.org/W2903469954","https://openalex.org/W2974075905","https://openalex.org/W3040363661"],"related_works":["https://openalex.org/W1822681810","https://openalex.org/W2059958986","https://openalex.org/W2737096452","https://openalex.org/W2473635752","https://openalex.org/W2355014420","https://openalex.org/W2101261067","https://openalex.org/W4243384718","https://openalex.org/W1644076281","https://openalex.org/W2075582476","https://openalex.org/W3084598562"],"abstract_inverted_index":{"The":[0,72,90,111],"Capacitated":[1],"Arc":[2],"Routing":[3],"Problem":[4],"(CARP)":[5],"is":[6,16,49,56],"known":[7],"to":[8,19,38,82],"be":[9,20],"NP-Hard":[10],"combinatorial":[11],"optimization":[12],"problem,":[13],"and":[14,32,102],"hence":[15],"not":[17],"expected":[18],"resolved":[21],"in":[22,87],"polynomial":[23],"time":[24],"for":[25,51,69],"the":[26,52,59,64,84,103,116],"general":[27],"case.":[28],"Consequently":[29],"numerous":[30],"heuristics":[31,68],"metaheuristics":[33],"approaches":[34],"have":[35],"been":[36],"developed":[37],"solve":[39],"it.":[40],"In":[41],"this":[42,70,93],"paper":[43],"an":[44],"\u201cpartial":[45,117],"tours\u201d":[46,118],"based":[47,57],"heuristic":[48],"proposed":[50],"CARP.":[53],"This":[54],"approach":[55,95,119],"on":[58,98],"path-scanning":[60,109],"heuristic,":[61],"one":[62],"of":[63,76,92],"mostly":[65],"used":[66],"greedy":[67],"problem.":[71],"innovation":[73],"consists":[74],"basically":[75],"creating":[77],"a":[78,121],"partial":[79],"tours":[80],"set":[81],"determine":[83],"promising":[85],"segments":[86],"all":[88],"tours.":[89],"quality":[91],"new":[94],"was":[96],"tested":[97],"nine":[99],"standard":[100],"datasets":[101],"results":[104],"were":[105],"compared":[106],"against":[107],"two":[108],"heuristics.":[110],"empirical":[112],"study":[113],"indicate":[114],"that":[115],"gives":[120],"good":[122],"results.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}