{"id":"https://openalex.org/W1984474567","doi":"https://doi.org/10.1145/1569901.1569982","title":"Comparison of similarity measures for the multi-objective vehicle routing problem with time windows","display_name":"Comparison of similarity measures for the multi-objective vehicle routing problem with time windows","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W1984474567","doi":"https://doi.org/10.1145/1569901.1569982","mag":"1984474567"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569982","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569982","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 on Genetic and evolutionary computation","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/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"],"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083534588","display_name":"John A. Bullinaria","orcid":null},"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":false,"raw_author_name":"John A. Bullinaria","raw_affiliation_strings":["University of Birmingham, Birmingham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018308542"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":1.5126,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84766404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"579","last_page":"586"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9861999750137329,"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.9812999963760376,"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.8214788436889648},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7956951856613159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.572208821773529},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5420769453048706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5217089056968689},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.4939621090888977},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.49293088912963867},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47667980194091797},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4404568076133728},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.42048385739326477},{"id":"https://openalex.org/keywords/similarity-measure","display_name":"Similarity measure","score":0.41749319434165955},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3857535421848297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35211607813835144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22777536511421204},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21528339385986328},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21227380633354187},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.19789576530456543}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8214788436889648},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7956951856613159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.572208821773529},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5420769453048706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5217089056968689},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.4939621090888977},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.49293088912963867},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47667980194091797},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4404568076133728},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.42048385739326477},{"id":"https://openalex.org/C2776517306","wikidata":"https://www.wikidata.org/wiki/Q29017317","display_name":"Similarity measure","level":2,"score":0.41749319434165955},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3857535421848297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35211607813835144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22777536511421204},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21528339385986328},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21227380633354187},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.19789576530456543},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1569901.1569982","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569982","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 on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.2894","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2894","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/~jxb/PUBS/CSM.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7d28a4dc-341c-4617-a6f7-def35f784c2c","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/7d28a4dc-341c-4617-a6f7-def35f784c2c","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Najera, A & Bullinaria, J 2009, 'Comparison of Similarity Measures for the Multi-objective Vehicle Routing Problem with Time Windows', Paper presented at Proceedings of the 11th Conference on Genetic and Evolutionary Computation (GECCO '09), New York, New York, USA, 12/07/09 pp. 579-586. https://doi.org/10.1145/1569901.1569982","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1532651649","https://openalex.org/W1601649239","https://openalex.org/W1647671624","https://openalex.org/W1860095220","https://openalex.org/W1970026646","https://openalex.org/W1972755385","https://openalex.org/W2018743970","https://openalex.org/W2031232041","https://openalex.org/W2037932849","https://openalex.org/W2040678783","https://openalex.org/W2066086285","https://openalex.org/W2070637511","https://openalex.org/W2096305430","https://openalex.org/W2098907614","https://openalex.org/W2102818760","https://openalex.org/W2116675171","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2133671109","https://openalex.org/W2232769049","https://openalex.org/W2994964425","https://openalex.org/W3029591682","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2155376099","https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2341709160","https://openalex.org/W2758988501","https://openalex.org/W1596059437","https://openalex.org/W3013791021"],"abstract_inverted_index":{"The":[0],"Vehicle":[1],"Routing":[2],"Problem":[3,19],"can":[4],"be":[5,153],"seen":[6,151],"as":[7],"a":[8,63,134],"fusion":[9],"of":[10,36,50,65,76,79,99,106,138],"two":[11,111],"well":[12],"known":[13],"combinatorial":[14],"problems,":[15],"the":[16,28,34,47,73,77,83,104,125],"Travelling":[17],"Salesman":[18],"and":[20,141],"Bin":[21],"Packing":[22],"Problem.":[23],"It":[24],"has":[25,90,101],"several":[26],"variants,":[27],"one":[29],"with":[30,68,82],"Time":[31],"Windows":[32],"being":[33],"case":[35],"study":[37],"in":[38],"this":[39,96,131],"paper.":[40],"Its":[41],"main":[42],"objective":[43],"is":[44],"to":[45,52,55,113,123,133,152],"find":[46],"lowest-distance":[48],"set":[49,137],"routes":[51,80],"deliver":[53],"goods":[54],"customers,":[56],"which":[57,116],"have":[58,129],"service":[59],"time":[60],"windows,":[61],"using":[62],"fleet":[64],"identical":[66],"vehicles":[67],"restricted":[69],"capacity.":[70],"We":[71,108,128],"consider":[72],"simultaneous":[74],"minimisation":[75],"number":[78],"along":[81],"total":[84],"travel":[85],"distance.":[86],"Although":[87],"previous":[88],"research":[89],"considered":[91],"evolutionary":[92,121],"methods":[93,112],"for":[94],"solving":[95],"problem,":[97],"none":[98],"them":[100],"concentrated":[102],"on":[103],"similarity":[105,144],"solutions.":[107],"analyse":[109],"here":[110],"measure":[114],"similarity,":[115],"are":[117,146,150],"incorporated":[118],"into":[119],"an":[120],"algorithm":[122,132],"solve":[124],"multi-objective":[126],"problem.":[127],"applied":[130],"publicly":[135],"available":[136],"benchmark":[139],"instances,":[140],"when":[142],"these":[143],"measures":[145],"considered,":[147],"our":[148],"solutions":[149],"competitive":[154],"or":[155],"better":[156],"than":[157],"others":[158],"previously":[159],"published.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}