{"id":"https://openalex.org/W9632173","doi":null,"title":"A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows","display_name":"A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows","alternate_titles":[],"publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W9632173","mag":"9632173"},"language":"en","primary_location":{"id":"mag:9632173","doi":null,"is_oa":false,"landing_page_url":"https://www.econbiz.de/archiv/ha/fuha/winformatik/metaheuristic_vehicle_routing.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W9632173"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5019667805","display_name":"Hermann Gehring","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Hermann Gehring","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019667805"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6086,"has_fulltext":false,"cited_by_count":274,"citation_normalized_percentile":{"value":0.92116058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":1.0,"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":1.0,"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":9.999999747378752e-05,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"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/vehicle-routing-problem-with-time-windows","display_name":"vehicle routing problem with time windows","score":1.0},{"id":"https://openalex.org/keywords/parallel-metaheuristics","display_name":"parallel metaheuristics","score":0.8500000238418579},{"id":"https://openalex.org/keywords/tabu-search","display_name":"tabu search","score":0.9929999709129333},{"id":"https://openalex.org/keywords/cooperative-autonomy","display_name":"cooperative autonomy","score":0.8410000205039978},{"id":"https://openalex.org/keywords/solution-exchange","display_name":"solution exchange","score":0.8289999961853027},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.7710000276565552},{"id":"https://openalex.org/keywords/vehicle-count-minimization","display_name":"vehicle count minimization","score":0.7789999842643738},{"id":"https://openalex.org/keywords/travel-distance-reduction","display_name":"travel distance minimization","score":0.8899999856948853}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.9291286468505859},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6846870183944702},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6800634860992432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6725243330001831},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6505205631256104},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5430294275283813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5088465213775635},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.48494723439216614},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43200817704200745},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4112565517425537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37500035762786865},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:9632173","doi":null,"is_oa":false,"landing_page_url":"https://www.econbiz.de/archiv/ha/fuha/winformatik/metaheuristic_vehicle_routing.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.617.1364","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.617.1364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.econbiz.de/archiv/ha/fuha/winformatik/metaheuristic_vehicle_routing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W159794904","https://openalex.org/W1993257498","https://openalex.org/W2007401074","https://openalex.org/W2014343564","https://openalex.org/W2014412090","https://openalex.org/W2049967755","https://openalex.org/W2084977713","https://openalex.org/W2096305430","https://openalex.org/W2104670598","https://openalex.org/W2111581650","https://openalex.org/W2143731413","https://openalex.org/W2144076135","https://openalex.org/W2146870367","https://openalex.org/W3036211873"],"related_works":["https://openalex.org/W2018743970","https://openalex.org/W1562854602","https://openalex.org/W159794904","https://openalex.org/W1597183383","https://openalex.org/W1480380789","https://openalex.org/W2167710444","https://openalex.org/W625989349","https://openalex.org/W1532651649","https://openalex.org/W2313316345","https://openalex.org/W3162858982"],"abstract_inverted_index":{"The":[0,21,59,95,140],"vehicle":[1,14,170],"routing":[2,15],"problem":[3,16],"with":[4,17],"time":[5,172],"windows":[6],"(VRPTW)":[7],"is":[8,57,65,88,151],"an":[9],"extension":[10],"of":[11,24,32,35,61,68,71,75,97,105,118,122,143,155],"the":[12,25,30,33,40,55,62,66,69,82,85,103,116,126,130,145,148],"well-known":[13,156],"a":[18,49,76,91],"central":[19],"depot.":[20],"objective":[22],"function":[23],"VRPTW":[26,56],"considered":[27],"here":[28],"combines":[29],"minimization":[31,67],"number":[34,70],"vehicles":[36],"(primary":[37],"criterion)":[38],"and":[39,147,157],"total":[41,86],"travel":[42],"distance":[43,87],"(secondary":[44],"criterion).":[45],"In":[46],"this":[47,98],"paper,":[48],"two-phase":[50],"procedural":[51],"approach":[52,150],"for":[53],"solving":[54],"parallelized.":[58],"aim":[60],"first":[63],"phase":[64,84],"ve-hicles":[72],"by":[73,153],"means":[74,154],"(1,":[77],"\u03bb)-evolution":[78],"strategy,":[79,164],"whereas":[80],"in":[81,129],"second":[83],"minimized":[89],"using":[90],"tabu":[92,166],"search":[93],"algorithm.":[94],"parallelization":[96],"sequential":[99,111,146],"hybrid":[100],"procedure":[101],"follows":[102],"concept":[104],"cooperative":[106],"autonomy,":[107],"i.e.,":[108],"several":[109],"autonomous":[110],"solution":[112,131],"pro-cedures":[113],"cooperate":[114],"through":[115],"exchange":[117],"solutions.":[119],"However,":[120],"exchanges":[121],"solutions":[123],"lead":[124],"to":[125],"corresponding":[127],"jumps":[128],"space":[132],"only":[133],"if":[134],"certain":[135],"acceptance":[136],"conditions":[137],"are":[138],"met.":[139],"good":[141],"performance":[142],"both":[144],"parallel":[149],"demonstrated":[152],"new":[158],"benchmark":[159],"problems.":[160],"Key":[161],"words:":[162],"Evolution":[163],"metaheuristic,":[165],"search,":[167],"hybridization,":[168],"parallelization,":[169],"routing,":[171],"windows.":[173]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W9632173","counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":10}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
