{"id":"https://openalex.org/W1993705704","doi":"https://doi.org/10.1109/cec.2012.6252883","title":"A multiobjective evolutionary algorithm with enhanced reproduction operators for the vehicle routing problem with time windows","display_name":"A multiobjective evolutionary algorithm with enhanced reproduction operators for the vehicle routing problem with time windows","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1993705704","doi":"https://doi.org/10.1109/cec.2012.6252883","mag":"1993705704"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6252883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","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/A5086681133","display_name":"Wei-Huai Hsu","orcid":null},"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":"Wei-Huai Hsu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan","Dept. 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","institution_ids":["https://openalex.org/I134161618"]},{"raw_affiliation_string":"Dept. 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","Dept. 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","institution_ids":["https://openalex.org/I134161618"]},{"raw_affiliation_string":"Dept. 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":3.0356,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89753195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"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/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.9890999794006348,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.9194450974464417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6661161184310913},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6656773686408997},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6547927856445312},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6157110333442688},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.580679714679718},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5758458971977234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5609127879142761},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46599164605140686},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.43515831232070923},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42242366075515747},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.41285306215286255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36390072107315063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31241118907928467},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14208009839057922}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.9194450974464417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6661161184310913},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6656773686408997},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6547927856445312},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6157110333442688},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.580679714679718},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5758458971977234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5609127879142761},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46599164605140686},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.43515831232070923},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42242366075515747},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.41285306215286255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36390072107315063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31241118907928467},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14208009839057922},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/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.2012.6252883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W9632173","https://openalex.org/W26559378","https://openalex.org/W114492606","https://openalex.org/W159794904","https://openalex.org/W1526684662","https://openalex.org/W1532651649","https://openalex.org/W1759922299","https://openalex.org/W1978111418","https://openalex.org/W1979488556","https://openalex.org/W1994805899","https://openalex.org/W2010418932","https://openalex.org/W2017209461","https://openalex.org/W2018743970","https://openalex.org/W2037119827","https://openalex.org/W2037932849","https://openalex.org/W2066086285","https://openalex.org/W2070637511","https://openalex.org/W2079333601","https://openalex.org/W2096305430","https://openalex.org/W2099501018","https://openalex.org/W2101363262","https://openalex.org/W2104390625","https://openalex.org/W2116661285","https://openalex.org/W2116675171","https://openalex.org/W2126105956","https://openalex.org/W2126553821","https://openalex.org/W2132450795","https://openalex.org/W2143519380","https://openalex.org/W2144076135","https://openalex.org/W2146870367","https://openalex.org/W2152990704","https://openalex.org/W2154841487","https://openalex.org/W2158000627","https://openalex.org/W2160929773","https://openalex.org/W2168813528","https://openalex.org/W2403905232","https://openalex.org/W3023540311","https://openalex.org/W3125905360","https://openalex.org/W3141629058","https://openalex.org/W4240671633","https://openalex.org/W6637892708"],"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/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W2090178682","https://openalex.org/W2001591765"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,22,28,32,50,55,65,73,79,83,91,95,105,120,137,148,153],"vehicle":[4,33],"routing":[5],"problem":[6,163],"with":[7,166],"time":[8,39],"windows":[9],"(VRPTW).":[10],"The":[11],"task":[12],"is":[13,69,156],"to":[14,17,48,103,112,135],"assign":[15],"customers":[16,26],"multiple":[18],"vehicles":[19,29,53,68,86],"and":[20,36,54,88,110,143,175],"determine":[21],"visiting":[23],"sequences":[24],"of":[25,45,52,60,67,85,98,124,152],"for":[27,119],"without":[30,107],"violating":[31],"capacity":[34],"constraint":[35],"customer":[37],"service":[38],"window":[40],"constraints.":[41],"Two":[42],"common":[43],"objectives":[44,115],"VRPTW":[46,80,106],"are":[47],"minimize":[49,113],"number":[51,66,84,97],"total":[56,74,92],"traveling":[57],"distance.":[58,75],"Most":[59],"previous":[61],"studies":[62],"assumed":[63],"that":[64],"more":[70],"important":[71],"than":[72],"Hence,":[76],"they":[77],"solved":[78],"by":[81,146],"minimizing":[82,90],"first":[87],"then":[89],"distance":[93],"under":[94],"minimal":[96],"vehicles.":[99],"Recently,":[100],"researchers":[101],"started":[102],"solve":[104,136],"this":[108,127],"assumption":[109],"tried":[111],"both":[114],"simultaneously":[116],"through":[117],"searching":[118],"Pareto":[121,181],"optimal":[122,182],"set":[123],"solutions.":[125,183],"Following":[126],"perspective,":[128],"we":[129],"use":[130],"a":[131,159],"multiobjective":[132],"evolutionary":[133],"algorithm":[134,155,171],"VRPTW.":[138],"We":[139],"propose":[140],"enhanced":[141],"crossover":[142],"mutation":[144],"operators":[145],"incorporating":[147],"domain":[149],"knowledge.":[150],"Performance":[151],"proposed":[154],"verified":[157],"on":[158],"widely":[160],"used":[161],"benchmark":[162],"set.":[164],"Comparing":[165],"seven":[167],"existing":[168],"algorithms,":[169],"our":[170],"shows":[172],"competitive":[173],"performance":[174],"contributes":[176],"many":[177],"new":[178],"best":[179],"known":[180]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}