{"id":"https://openalex.org/W2967615599","doi":"https://doi.org/10.1109/cec.2019.8789946","title":"An Evolutionary Algorithm with Heuristic Longest Cycle Crossover for Solving the Capacitated Vehicle Routing Problem","display_name":"An Evolutionary Algorithm with Heuristic Longest Cycle Crossover for Solving the Capacitated Vehicle Routing Problem","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2967615599","doi":"https://doi.org/10.1109/cec.2019.8789946","mag":"2967615599"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8789946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8789946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","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/A5045717030","display_name":"Thammarsat Visutarrom","orcid":"https://orcid.org/0009-0006-4173-7350"},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Thammarsat Visutarrom","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I134161618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069510989","display_name":"Tsung-Che Chiang","orcid":"https://orcid.org/0000-0001-8253-795X"},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsung-Che Chiang","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I134161618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134161618"],"apc_list":null,"apc_paid":null,"fwci":0.8841,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80158421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"196","issue":null,"first_page":"673","last_page":"680"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9894999861717224,"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/crossover","display_name":"Crossover","score":0.9439655542373657},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7810671329498291},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6918459534645081},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6494718194007874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.571327805519104},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.522331178188324},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4974422752857208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49680617451667786},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46092602610588074},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4518236815929413},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4478680193424225},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.44697463512420654},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.43582671880722046},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4203783869743347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3472819924354553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16372844576835632}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9439655542373657},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7810671329498291},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6918459534645081},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6494718194007874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.571327805519104},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.522331178188324},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4974422752857208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49680617451667786},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46092602610588074},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4518236815929413},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4478680193424225},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.44697463512420654},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.43582671880722046},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4203783869743347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3472819924354553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16372844576835632},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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},{"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/cec.2019.8789946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8789946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W99032621","https://openalex.org/W174230839","https://openalex.org/W1570101531","https://openalex.org/W1946015899","https://openalex.org/W1968545115","https://openalex.org/W1999406036","https://openalex.org/W2006487034","https://openalex.org/W2009561534","https://openalex.org/W2028002822","https://openalex.org/W2029681015","https://openalex.org/W2037749870","https://openalex.org/W2043459322","https://openalex.org/W2045445456","https://openalex.org/W2046064436","https://openalex.org/W2049065056","https://openalex.org/W2054473623","https://openalex.org/W2060422572","https://openalex.org/W2060740922","https://openalex.org/W2063520056","https://openalex.org/W2066173445","https://openalex.org/W2081230102","https://openalex.org/W2090069860","https://openalex.org/W2092325930","https://openalex.org/W2100419215","https://openalex.org/W2111174053","https://openalex.org/W2111563176","https://openalex.org/W2134946882","https://openalex.org/W2141544009","https://openalex.org/W2146870367","https://openalex.org/W4232044272","https://openalex.org/W6604038483","https://openalex.org/W6634083519"],"related_works":["https://openalex.org/W1966449253","https://openalex.org/W2090855774","https://openalex.org/W21080393","https://openalex.org/W1985939653","https://openalex.org/W1606499289","https://openalex.org/W2017649536","https://openalex.org/W2911578165","https://openalex.org/W1990067406","https://openalex.org/W2626282817","https://openalex.org/W4297582752"],"abstract_inverted_index":{"Crossover":[0],"is":[1],"one":[2],"of":[3,8,38,49,109],"the":[4,25,36,46,50,59,67,73,81,96,102],"most":[5],"important":[6],"parts":[7],"an":[9],"evolutionary":[10],"algorithm":[11],"(EA)":[12],"for":[13,23],"solving":[14,24],"optimization":[15],"problems.":[16],"Many":[17],"crossover":[18,52,78],"operators":[19],"have":[20],"been":[21],"proposed":[22,74],"capacitated":[26],"vehicle":[27],"routing":[28],"problem":[29,34],"(CVRP),":[30],"a":[31,91,106],"classical":[32],"NP-hard":[33],"in":[35,95],"field":[37],"operations":[39],"research.":[40],"This":[41],"paper":[42],"aims":[43],"to":[44,65,100],"improve":[45,66],"search":[47,92],"ability":[48],"cycle":[51,56,77],"(CX).":[53],"The":[54],"longest":[55,76],"selection":[57],"and":[58,84],"nearest":[60],"neighbor":[61],"heuristic":[62,75],"are":[63],"utilized":[64],"performance.":[68],"Experimental":[69],"results":[70],"show":[71],"that":[72],"(HLCX)":[79],"outperforms":[80],"original":[82],"CX":[83],"four":[85],"other":[86],"operators.":[87],"Additionally,":[88],"we":[89],"apply":[90],"reduction":[93],"strategy":[94],"local":[97],"refinement":[98],"procedure":[99],"reduce":[101],"computation":[103],"time":[104],"at":[105],"little":[107],"cost":[108],"solution":[110],"quality.":[111]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}