{"id":"https://openalex.org/W2117522162","doi":"https://doi.org/10.1109/tsmcb.2011.2158307","title":"A Memetic Algorithm for Periodic Capacitated Arc Routing Problem","display_name":"A Memetic Algorithm for Periodic Capacitated Arc Routing Problem","publication_year":2011,"publication_date":"2011-07-20","ids":{"openalex":"https://openalex.org/W2117522162","doi":"https://doi.org/10.1109/tsmcb.2011.2158307","mag":"2117522162","pmid":"https://pubmed.ncbi.nlm.nih.gov/21768050"},"language":"en","primary_location":{"id":"doi:10.1109/tsmcb.2011.2158307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmcb.2011.2158307","pdf_url":null,"source":{"id":"https://openalex.org/S4210170378","display_name":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","issn_l":"1083-4419","issn":["1083-4419","1941-0492"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/A_memetic_algorithm_for_periodic_capacitated_arc_routing_problem/27453804","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073282655","display_name":"Yi Mei","orcid":"https://orcid.org/0000-0003-0682-1363"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yi Mei","raw_affiliation_strings":["Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021254405","display_name":"Ke Tang","orcid":"https://orcid.org/0000-0002-6236-2002"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Tang","raw_affiliation_strings":["Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["CN","GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["CERCIA, the School of Computer Science, University of Birmingham, Birmingham, UK","Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CERCIA, the School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.1934,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.9924815,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"41","issue":"6","first_page":"1654","last_page":"1667"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9829999804496765,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9805999994277954,"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.9392868280410767},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.895727813243866},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5366278290748596},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4754057824611664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45966824889183044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45887744426727295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40902069211006165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3109515905380249},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.24331921339035034},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08038091659545898},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0588679313659668}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.9392868280410767},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.895727813243866},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5366278290748596},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4754057824611664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45966824889183044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45887744426727295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40902069211006165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3109515905380249},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.24331921339035034},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08038091659545898},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0588679313659668}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/tsmcb.2011.2158307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmcb.2011.2158307","pdf_url":null,"source":{"id":"https://openalex.org/S4210170378","display_name":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","issn_l":"1083-4419","issn":["1083-4419","1941-0492"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)","raw_type":"journal-article"},{"id":"pmid:21768050","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/21768050","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society","raw_type":null},{"id":"pmh:oai:researchbank.rmit.edu.au:rmit:17016","is_oa":false,"landing_page_url":"http://researchbank.rmit.edu.au/view/rmit:17016","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.3120","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.3120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/%7Exin/papers/MeiTangYao2011TSMCB.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.700.3261","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.700.3261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.ecs.vuw.ac.nz/%7Eyimei/Papers/TSMCB11_MeiTangYao.pdf","raw_type":"text"},{"id":"pmh:oai:alma.61RMIT_INST:11246557100001341","is_oa":false,"landing_page_url":"http://doi.org/10.1109/TSMCB.2011.2158307","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27453804","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_memetic_algorithm_for_periodic_capacitated_arc_routing_problem/27453804","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27453804","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_memetic_algorithm_for_periodic_capacitated_arc_routing_problem/27453804","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","score":0.4000000059604645,"display_name":"Responsible consumption and production"}],"awards":[{"id":"https://openalex.org/G3295527180","display_name":null,"funder_award_id":"EP/E058884/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3714347586","display_name":null,"funder_award_id":"U0835002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5095686374","display_name":"Evolutionary Algorithms for Dynamic Optimisation Problems: Design, Analysis and Applications","funder_award_id":"EP/E058884/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5288479916","display_name":null,"funder_award_id":"61028009","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W1564832479","https://openalex.org/W1570187551","https://openalex.org/W1582334898","https://openalex.org/W1591506270","https://openalex.org/W1967687507","https://openalex.org/W1973088783","https://openalex.org/W1974123359","https://openalex.org/W1975828823","https://openalex.org/W1990701788","https://openalex.org/W1993413197","https://openalex.org/W2017209461","https://openalex.org/W2017695941","https://openalex.org/W2018236017","https://openalex.org/W2021117098","https://openalex.org/W2036924136","https://openalex.org/W2039011874","https://openalex.org/W2039621427","https://openalex.org/W2041183433","https://openalex.org/W2044807391","https://openalex.org/W2050708578","https://openalex.org/W2060846245","https://openalex.org/W2061212893","https://openalex.org/W2069775569","https://openalex.org/W2071463225","https://openalex.org/W2075691918","https://openalex.org/W2076616086","https://openalex.org/W2082593294","https://openalex.org/W2088679389","https://openalex.org/W2101097701","https://openalex.org/W2101314043","https://openalex.org/W2131069987","https://openalex.org/W2151339633","https://openalex.org/W2155262811","https://openalex.org/W2158458634","https://openalex.org/W2161676453","https://openalex.org/W2162168857","https://openalex.org/W2169528473","https://openalex.org/W4236483317"],"related_works":["https://openalex.org/W2016140509","https://openalex.org/W2018236017","https://openalex.org/W4300069228","https://openalex.org/W1964589465","https://openalex.org/W2043405286","https://openalex.org/W4299619884","https://openalex.org/W3014387625","https://openalex.org/W2205286750","https://openalex.org/W2027838616","https://openalex.org/W2094916922"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,15,24,51,61,122,126,162,172,178,185,193],"Periodic":[4],"Capacitated":[5,26],"Arc":[6,27],"Routing":[7,28],"Problem":[8,29],"(PCARP),":[9],"which":[10,45],"is":[11,20,40,72,77,117],"often":[12],"encountered":[13],"in":[14,121,165,192],"waste":[16],"collection":[17],"application.":[18],"PCARP":[19,39,70,144],"an":[21],"extension":[22],"of":[23,53,176,196],"well-known":[25],"(CARP)":[30],"from":[31],"a":[32,36,41,47,57,90,101,107,113,148,189],"single":[33],"period":[34],"to":[35,86,124],"multi-period":[37],"horizon.":[38],"hierarchical":[42],"optimization":[43],"problem":[44],"has":[46,135],"primary":[48,75],"objective":[49,59,76,128],"(minimizing":[50,60],"number":[52],"vehicles":[54],")":[55],"and":[56,83,106,119,147,169],"secondary":[58],"total":[62],"cost":[63],").":[64],"An":[65],"important":[66],"factor":[67],"that":[68,73,156,184],"makes":[69],"challenging":[71],"its":[74],"little":[78],"affected":[79],"by":[80],"existing":[81,139],"operators":[82],"thus":[84],"difficult":[85],"improve.":[87],"We":[88],"propose":[89],"new":[91,102],"Memetic":[92],"Algorithm":[93],"(MA)":[94],"for":[95],"solving":[96],"PCARP.":[97],"The":[98,130,152],"MA":[99,131],"adopts":[100],"solution":[103],"representation":[104],"scheme":[105],"novel":[108],"crossover":[109],"operator.":[110],"Most":[111],"importantly,":[112],"Route-Merging":[114],"(RM)":[115],"procedure":[116,187],"devised":[118],"embedded":[120],"algorithm":[123],"tackle":[125],"insensitive":[127],".":[129],"with":[132,138],"RM":[133,186],"(MARM)":[134],"been":[136],"compared":[137,163],"meta-heuristic":[140],"approaches":[141],"on":[142],"two":[143],"benchmark":[145,179],"sets":[146],"real-world":[149],"data":[150],"set.":[151],"experimental":[153],"results":[154],"show":[155],"MARM":[157],"obtained":[158],"better":[159],"solutions":[160,175],"than":[161],"algorithms":[164],"much":[166],"less":[167],"time,":[168],"even":[170],"updated":[171],"best":[173],"known":[174],"all":[177],"instances.":[180],"Further":[181],"study":[182],"reveals":[183],"plays":[188],"key":[190],"role":[191],"superior":[194],"performance":[195],"MARM.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}