{"id":"https://openalex.org/W2026023516","doi":"https://doi.org/10.1145/1570256.1570385","title":"Preserving population diversity for the multi-objective vehicle routing problem with time windows","display_name":"Preserving population diversity for the multi-objective vehicle routing problem with time windows","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2026023516","doi":"https://doi.org/10.1145/1570256.1570385","mag":"2026023516"},"language":"en","primary_location":{"id":"doi:10.1145/1570256.1570385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","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/A5018308542","display_name":"Abel Garc\u00eda-N\u00e1jera","orcid":"https://orcid.org/0000-0002-3220-0782"},"institutions":[{"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":["GB"],"is_corresponding":true,"raw_author_name":"Abel Garcia-Najera","raw_affiliation_strings":["University of Birmingham, Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018308542"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":3.7755,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91880258,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2689","last_page":"2692"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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.998199999332428,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9767000079154968,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9664000272750854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8253950476646423},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7721208333969116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5984382629394531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5775060653686523},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5335121154785156},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5331363677978516},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5084894895553589},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4870879650115967},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4837082028388977},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4634172320365906},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4514719843864441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27027627825737},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21910667419433594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21127772331237793},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0712486207485199}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8253950476646423},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7721208333969116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5984382629394531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5775060653686523},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5335121154785156},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5331363677978516},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5084894895553589},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4870879650115967},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4837082028388977},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4634172320365906},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4514719843864441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27027627825737},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21910667419433594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21127772331237793},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0712486207485199},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1570256.1570385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","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":9,"referenced_works":["https://openalex.org/W143070698","https://openalex.org/W1512383952","https://openalex.org/W1532651649","https://openalex.org/W2037932849","https://openalex.org/W2070637511","https://openalex.org/W2102818760","https://openalex.org/W2111563176","https://openalex.org/W2126105956","https://openalex.org/W2232769049"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","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"],"abstract_inverted_index":{"The":[0],"Vehicle":[1],"Routing":[2],"Problem's":[3],"main":[4],"objective":[5],"is":[6,99,141],"to":[7,14,17,95,105,119,148],"find":[8],"the":[9,36,40,46,69,82,107,116,123,135],"lowest-cost":[10],"set":[11],"of":[12,28,39,42,64,71,78,84,122],"routes":[13,43],"deliver":[15],"goods":[16],"customers,":[18],"which":[19,98],"have":[20,66],"a":[21,26,62,131],"service":[22],"time":[23],"window,":[24],"using":[25],"fleet":[27],"identical":[29],"vehicles":[30],"with":[31,45],"restricted":[32],"capacity.":[33],"We":[34,86],"consider":[35],"simultaneous":[37],"minimization":[38],"number":[41],"along":[44],"total":[47],"travel":[48],"distance.":[49],"Although":[50],"previous":[51],"research":[52],"has":[53,80],"used":[54],"evolutionary":[55,103],"methods":[56],"for":[57,125],"solving":[58],"this":[59],"problem,":[60],"only":[61],"few":[63],"them":[65,79],"concentrated":[67],"on":[68],"optimization":[70],"more":[72],"than":[73,138,153],"one":[74,90,121],"objective,":[75],"and":[76,88,92],"none":[77],"considered":[81],"similarity":[83,117],"solutions.":[85],"propose":[87],"analyze":[89],"simple":[91],"straightforward":[93],"method":[94],"measure":[96,118],"similarity,":[97],"incorporated":[100],"into":[101],"an":[102],"algorithm":[104],"solve":[106],"multi-objective":[108],"problem.":[109],"Results":[110],"show":[111],"that":[112],"when":[113,139],"we":[114],"use":[115],"select":[120],"parents":[124],"crossover,":[126],"solutions":[127,146],"are":[128],"spread":[129],"over":[130],"wider":[132],"area":[133],"in":[134],"search":[136],"space":[137],"it":[140],"not":[142],"used.":[143],"Additionally,":[144],"our":[145],"result":[147],"be":[149],"competitive":[150],"or":[151],"better":[152],"others":[154],"previously":[155],"published.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}