{"id":"https://openalex.org/W2053628374","doi":"https://doi.org/10.1007/s12159-008-0003-4","title":"A distributed routing concept for vehicle routing problems","display_name":"A distributed routing concept for vehicle routing problems","publication_year":2008,"publication_date":"2008-11-03","ids":{"openalex":"https://openalex.org/W2053628374","doi":"https://doi.org/10.1007/s12159-008-0003-4","mag":"2053628374"},"language":"en","primary_location":{"id":"doi:10.1007/s12159-008-0003-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12159-008-0003-4","pdf_url":null,"source":{"id":"https://openalex.org/S63515265","display_name":"Logistics Research","issn_l":"1865-035X","issn":["1865-035X","1865-0368"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313874","host_organization_name":"Bundesvereinigung Logistik","host_organization_lineage":["https://openalex.org/P4310313874"],"host_organization_lineage_names":["Bundesvereinigung Logistik"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logistics Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5076029270","display_name":"Henning Rekersbrink","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Rekersbrink","raw_affiliation_strings":["BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","BIBA an der Universit\u00e4t Bremen"],"affiliations":[{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043593419","display_name":"Thomas Makuschewitz","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Makuschewitz","raw_affiliation_strings":["BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","BIBA an der Universit\u00e4t Bremen"],"affiliations":[{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029037030","display_name":"Bernd Scholz\u2010Reiter","orcid":"https://orcid.org/0000-0003-3981-8873"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bernd Scholz-Reiter","raw_affiliation_strings":["BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","BIBA an der Universit\u00e4t Bremen"],"affiliations":[{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen, Hochschulring 20, 28359, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"BIBA an der Universit\u00e4t Bremen","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076029270"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":11.5479,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.9821292,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":"1","first_page":"45","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8609100580215454},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.679221510887146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6644748449325562},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6330957412719727},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5696022510528564},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4935814142227173},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4799211919307709},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4722817838191986},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4689333736896515},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.43829843401908875},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4217604398727417},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4109005630016327},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3009742796421051},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17949935793876648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17066696286201477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1587146818637848}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8609100580215454},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.679221510887146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6644748449325562},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6330957412719727},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5696022510528564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4935814142227173},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4799211919307709},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4722817838191986},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4689333736896515},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.43829843401908875},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4217604398727417},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4109005630016327},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3009742796421051},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17949935793876648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17066696286201477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1587146818637848},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12159-008-0003-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12159-008-0003-4","pdf_url":null,"source":{"id":"https://openalex.org/S63515265","display_name":"Logistics Research","issn_l":"1865-035X","issn":["1865-035X","1865-0368"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313874","host_organization_name":"Bundesvereinigung Logistik","host_organization_lineage":["https://openalex.org/P4310313874"],"host_organization_lineage_names":["Bundesvereinigung Logistik"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logistics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W92527241","https://openalex.org/W206251367","https://openalex.org/W1989727318","https://openalex.org/W2006628031","https://openalex.org/W2007401074","https://openalex.org/W2029681015","https://openalex.org/W2092165528","https://openalex.org/W2096305430","https://openalex.org/W2111563176","https://openalex.org/W2124874218","https://openalex.org/W2139295133","https://openalex.org/W2162228023","https://openalex.org/W3103987592","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2041855631","https://openalex.org/W2105937634","https://openalex.org/W2204238626","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1976978163","https://openalex.org/W2381844443","https://openalex.org/W2555559350","https://openalex.org/W2186630360","https://openalex.org/W2129293467"],"abstract_inverted_index":{"Traditional":[0],"solution":[1,164,175,179],"concepts":[2,90,133],"for":[3,91,99,157],"the":[4,28,33,83,87,97,110,158,162,169],"vehicle":[5,19,116],"routing":[6,20,36,117],"problem":[7,118],"(VRP)":[8],"are":[9,22,95,134,155],"pushed":[10],"to":[11,25,40,46],"their":[12],"limits,":[13],"when":[14],"applied":[15],"on":[16],"dynamically":[17],"changing":[18],"scenarios\u2014which":[21],"more":[23],"close":[24],"reality":[26],"than":[27],"static":[29,124],"formulation.":[30],"By":[31],"contrast,":[32],"introduced":[34],"distributed":[35],"concept":[37],"is":[38,119],"designed":[39],"match":[41],"packages":[42],"and":[43,45,125,176],"vehicles":[44],"continuously":[47],"make":[48],"route":[49],"decisions":[50],"especially":[51],"within":[52],"a":[53,107,137,142,150,166,172,177],"dynamic":[54,92,126],"environment.":[55],"In":[56],"this":[57],"autonomous":[58],"control":[59],"concept,":[60],"each":[61],"of":[62,82,86,109,146],"these":[63],"objects":[64],"makes":[65],"its":[66],"own":[67],"decisions.":[68],"The":[69],"developed":[70,111],"algorithm":[71,140],"was":[72],"entitled":[73],"Distributed":[74],"Logistics":[75],"Routing":[76],"Protocol":[77],"(DLRP).":[78],"But":[79],"in":[80],"spite":[81],"restricted":[84],"suitability":[85],"traditional":[88,147],"VRP":[89],"environments,":[93],"they":[94],"still":[96],"benchmark":[98],"any":[100],"VRP-similar":[101],"task.":[102],"Therefore,":[103],"we":[104],"first":[105],"present":[106],"description":[108],"DLRP.":[112],"Then":[113],"an":[114,181],"adapted":[115,160],"defined,":[120],"which":[121],"both":[122,132],"sides,":[123],"concepts,":[127],"can":[128],"cope":[129],"with.":[130],"Finally,":[131],"compared":[135],"using":[136],"tabu":[138,173],"search":[139,174],"as":[141,165,180],"well":[143],"working":[144],"instance":[145],"VRP-concepts.":[148],"For":[149],"quantitative":[151],"comparison,":[152],"four":[153],"solutions":[154],"given":[156],"same":[159],"problem:":[161],"optimal":[163],"lower":[167],"bound,":[168],"DLRP":[170],"solution,":[171],"random-like":[178],"upper":[182],"bound.":[183]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}