{"id":"https://openalex.org/W2903604785","doi":"https://doi.org/10.1080/01605682.2017.1415648","title":"A fast heuristic for large-scale capacitated arc routing problems","display_name":"A fast heuristic for large-scale capacitated arc routing problems","publication_year":2018,"publication_date":"2018-01-24","ids":{"openalex":"https://openalex.org/W2903604785","doi":"https://doi.org/10.1080/01605682.2017.1415648","mag":"2903604785"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2017.1415648","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2017.1415648","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/ws/files/137660485/A_fast_heuristic_for_large_scale_capacitated_arc_routing_problems_AM18.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060125434","display_name":"Sanne W\u00f8hlk","orcid":"https://orcid.org/0000-0003-3847-7528"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Sanne W\u00f8hlk","raw_affiliation_strings":["CORAL \u2013 Cluster for Operations Research and Logistics, Department of Economics and Business Economics, Aarhus University, Aarhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-3847-7528","affiliations":[{"raw_affiliation_string":"CORAL \u2013 Cluster for Operations Research and Logistics, Department of Economics and Business Economics, Aarhus University, Aarhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076313841","display_name":"Gilbert Laporte","orcid":"https://orcid.org/0000-0003-0869-1507"},"institutions":[{"id":"https://openalex.org/I108192572","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27","country_code":"CA","type":"education","lineage":["https://openalex.org/I108192572"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Gilbert Laporte","raw_affiliation_strings":["GERAD and Canada Research Chair in Distribution Management, HEC Montr\u00e9al, Montr\u00e9al, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GERAD and Canada Research Chair in Distribution Management, HEC Montr\u00e9al, Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I108192572"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060125434"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":2.4224,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90691835,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"69","issue":"12","first_page":"1877","last_page":"1887"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9882000088691711,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9571999907493591,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6629921197891235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6511215567588806},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5479476451873779},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5385988354682922},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5175946950912476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5113153457641602},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5039374232292175},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4880615472793579},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.45844554901123047},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45251160860061646},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.4471028745174408},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4409210681915283},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.44074100255966187},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41108202934265137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3370763063430786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24135509133338928},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.2028319537639618},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16470938920974731},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16028925776481628},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.13411366939544678},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06660526990890503}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6629921197891235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6511215567588806},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5479476451873779},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5385988354682922},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5175946950912476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5113153457641602},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5039374232292175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4880615472793579},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.45844554901123047},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45251160860061646},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.4471028745174408},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4409210681915283},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.44074100255966187},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41108202934265137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3370763063430786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24135509133338928},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2028319537639618},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16470938920974731},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16028925776481628},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.13411366939544678},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06660526990890503},{"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/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/01605682.2017.1415648","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2017.1415648","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/f0110b72-5971-4640-805a-36d7ace0a335","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/f0110b72-5971-4640-805a-36d7ace0a335","pdf_url":"https://pure.au.dk/ws/files/137660485/A_fast_heuristic_for_large_scale_capacitated_arc_routing_problems_AM18.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"W\u00f8hlk, S & Laporte, G 2018, 'A fast heuristic for large-scale capacitated arc routing problems', Journal of the Operational Research Society, vol. 69, no. 12, pp. 1877-1887. https://doi.org/10.1080/01605682.2017.1415648","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:purehost.bath.ac.uk:openaire/125631a1-8b39-4b3e-a034-f82debb734e0","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/125631a1-8b39-4b3e-a034-f82debb734e0","pdf_url":"https://purehost.bath.ac.uk/ws/files/221484173/FastCARP_revise_1_.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"W\u00f8hlk, S & Laporte, G 2018, 'A fast heuristic for large-scale capacitated arc routing problems', Journal of the Operational Research Society, vol. 69, no. 12, pp. 1877-1887. https://doi.org/10.1080/01605682.2017.1415648","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:69:y:2018:i:12:p:1877-1887","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/01605682.2017.1415648","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:purehost.bath.ac.uk:publications/125631a1-8b39-4b3e-a034-f82debb734e0","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85049054018&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/f0110b72-5971-4640-805a-36d7ace0a335","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/f0110b72-5971-4640-805a-36d7ace0a335","pdf_url":"https://pure.au.dk/ws/files/137660485/A_fast_heuristic_for_large_scale_capacitated_arc_routing_problems_AM18.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"W\u00f8hlk, S & Laporte, G 2018, 'A fast heuristic for large-scale capacitated arc routing problems', Journal of the Operational Research Society, vol. 69, no. 12, pp. 1877-1887. https://doi.org/10.1080/01605682.2017.1415648","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G240519436","display_name":null,"funder_award_id":"2015\u201306189","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G4634149532","display_name":null,"funder_award_id":"4182--00021","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"}],"funders":[{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2903604785.pdf","grobid_xml":"https://content.openalex.org/works/W2903604785.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W327539564","https://openalex.org/W1435704996","https://openalex.org/W1963643500","https://openalex.org/W1973343935","https://openalex.org/W1974516623","https://openalex.org/W1977642073","https://openalex.org/W2002616150","https://openalex.org/W2003464925","https://openalex.org/W2017175049","https://openalex.org/W2026566718","https://openalex.org/W2027352549","https://openalex.org/W2039011874","https://openalex.org/W2040247760","https://openalex.org/W2041183433","https://openalex.org/W2044807391","https://openalex.org/W2053875756","https://openalex.org/W2062403584","https://openalex.org/W2070926233","https://openalex.org/W2075691918","https://openalex.org/W2088003110","https://openalex.org/W2096910555","https://openalex.org/W2101314043","https://openalex.org/W2153216775","https://openalex.org/W2489183199","https://openalex.org/W2605705048","https://openalex.org/W2611802323","https://openalex.org/W2616101379","https://openalex.org/W2616756911","https://openalex.org/W2622841700","https://openalex.org/W3121988186","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2019018557","https://openalex.org/W2017694061","https://openalex.org/W3215808204","https://openalex.org/W4386259575","https://openalex.org/W2139558309","https://openalex.org/W3123643494","https://openalex.org/W1971470866","https://openalex.org/W2983794855","https://openalex.org/W2806019368","https://openalex.org/W2078941772"],"abstract_inverted_index":{"The":[0,70],"purpose":[1],"of":[2,16,130],"this":[3],"paper":[4],"is":[5,29],"to":[6,80],"develop":[7],"a":[8,32,39,44],"fast":[9],"heuristic":[10,71,97],"called":[11,98],"FastCARP":[12,42,91],"for":[13],"the":[14,48,68,136],"solution":[15,131],"large-scale":[17],"capacitated":[18],"arc":[19],"routing":[20],"problems,":[21],"with":[22,94,101],"or":[23],"without":[24],"duration":[25],"constraints.":[26],"This":[27],"study":[28],"motivated":[30],"by":[31],"waste":[33],"collection":[34],"problem":[35],"in":[36,128],"Denmark.":[37],"After":[38],"preprocessing":[40],"phase,":[41],"creates":[43],"giant":[45],"tour,":[46],"partitions":[47],"graph":[49],"into":[50],"districts,":[51],"and":[52,62,66,88,100,122],"construct":[53],"routes":[54],"within":[55],"each":[56],"district.":[57],"It":[58,133],"then":[59],"iteratively":[60],"merges":[61],"splits":[63],"adjacent":[64],"districts":[65],"reoptimises":[67],"routes.":[69],"was":[72,92,109,119],"tested":[73],"on":[74],"264":[75],"benchmark":[76],"instances":[77],"containing":[78],"up":[79],"11,640":[81],"nodes,":[82],"12,675":[83],"edges,":[84,87],"8581":[85],"required":[86],"323":[89],"vehicles.":[90],"compared":[93],"an":[95],"alternative":[96],"Base":[99,127],"several":[102],"Path-Scanning":[103,137],"algorithms.":[104,138],"On":[105,115],"small":[106],"graphs,":[107,117],"it":[108,118],"better":[110],"but":[111],"slower":[112],"than":[113,126],"Base.":[114],"larger":[116],"much":[120],"faster":[121],"only":[123],"slightly":[124],"worse":[125],"terms":[129],"quality.":[132],"also":[134],"outperforms":[135]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}