{"id":"https://openalex.org/W2159160413","doi":"https://doi.org/10.1109/tai.2003.1250187","title":"A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows","display_name":"A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2159160413","doi":"https://doi.org/10.1109/tai.2003.1250187","mag":"2159160413"},"language":"en","primary_location":{"id":"doi:10.1109/tai.2003.1250187","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","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/A5101906756","display_name":"Kenny Q. Zhu","orcid":"https://orcid.org/0000-0003-3782-3230"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"K.Q. Zhu","raw_affiliation_strings":["Department of Computer Science, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101906756"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":10.1613,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.98105035,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9983999729156494,"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.9976999759674072,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.809073805809021},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6957629323005676},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6891965270042419},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.6811532974243164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6088296175003052},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.590680718421936},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5898243188858032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5601290464401245},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5157876014709473},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.458213746547699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4543643593788147},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.4195113778114319},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3486243486404419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24431142210960388},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1391219198703766},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07249817252159119}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.809073805809021},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6957629323005676},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6891965270042419},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.6811532974243164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6088296175003052},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.590680718421936},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5898243188858032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5601290464401245},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5157876014709473},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.458213746547699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4543643593788147},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.4195113778114319},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3486243486404419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24431142210960388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1391219198703766},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07249817252159119},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tai.2003.1250187","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/40498","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/40498","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W159794904","https://openalex.org/W1482541200","https://openalex.org/W1497256448","https://openalex.org/W1568952562","https://openalex.org/W1589038126","https://openalex.org/W1639032689","https://openalex.org/W1643230496","https://openalex.org/W1644767244","https://openalex.org/W1836400055","https://openalex.org/W2017209461","https://openalex.org/W2095812434","https://openalex.org/W2096305430","https://openalex.org/W2132525177","https://openalex.org/W2150154654","https://openalex.org/W3023540311","https://openalex.org/W4285719527","https://openalex.org/W6606618622","https://openalex.org/W6628727844","https://openalex.org/W6634017107","https://openalex.org/W6635289253","https://openalex.org/W6637025183"],"related_works":["https://openalex.org/W1966449253","https://openalex.org/W2090855774","https://openalex.org/W21080393","https://openalex.org/W2110531080","https://openalex.org/W2352852890","https://openalex.org/W2354374578","https://openalex.org/W2124708775","https://openalex.org/W2379101572","https://openalex.org/W2389531610","https://openalex.org/W1968801396"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"adaptive":[4,50,106],"genetic":[5,107],"algorithm":[6,23,68,94],"(GA)":[7],"to":[8,18,44],"solve":[9],"the":[10,30,37,41,45,77,86],"vehicle":[11],"routing":[12],"problem":[13],"with":[14,29,85],"time":[15],"windows":[16],"(VRPTW)":[17],"near":[19],"optimal":[20],"solutions.":[21],"The":[22,49],"employs":[24],"a":[25,70],"unique":[26],"decoding":[27],"scheme":[28],"integer":[31],"strings.":[32],"It":[33],"also":[34],"automatically":[35],"adapts":[36],"crossover":[38],"probability":[39],"and":[40,58,69,97],"mutation":[42],"rate":[43],"changing":[46],"population":[47,53,80],"dynamics.":[48],"control":[51],"maintains":[52],"diversity":[54,81],"at":[55],"user-defined":[56],"levels,":[57],"therefore":[59],"prevents":[60],"premature":[61],"convergence":[62],"in":[63],"search.":[64],"Comparison":[65],"between":[66],"this":[67,93],"normal":[71],"fixed":[72],"parameter":[73],"GA":[74],"clearly":[75],"demonstrates":[76],"advantage":[78],"of":[79],"control.":[82],"Our":[83],"experiments":[84],"56":[87],"Solomon":[88],"benchmark":[89],"problems":[90],"indicate":[91],"that":[92],"is":[95],"competitive":[96],"it":[98],"paves":[99],"way":[100],"for":[101],"future":[102],"research":[103],"on":[104],"population-based":[105],"algorithm.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}