{"id":"https://openalex.org/W2098559645","doi":"https://doi.org/10.1142/s0129626403001598","title":"PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS","display_name":"PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2098559645","doi":"https://doi.org/10.1142/s0129626403001598","mag":"2098559645"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626403001598","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626403001598","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5103363184","display_name":"Arvind Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"ARVIND GUPTA","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"RAMESH KRISHNAMURTI","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2042029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"04","first_page":"673","last_page":"687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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/computer-science","display_name":"Computer science","score":0.7312361001968384},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7017413973808289},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6253929734230042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.537786066532135},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5300450325012207},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.4733191430568695},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.44918757677078247},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4183209538459778},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.41347599029541016},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.412280797958374},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33070462942123413},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21877318620681763},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.17434242367744446},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1642218828201294}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7312361001968384},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7017413973808289},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6253929734230042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.537786066532135},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5300450325012207},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.4733191430568695},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.44918757677078247},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4183209538459778},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.41347599029541016},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.412280797958374},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33070462942123413},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21877318620681763},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.17434242367744446},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1642218828201294},{"id":"https://openalex.org/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626403001598","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626403001598","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1513982482","https://openalex.org/W1584086289","https://openalex.org/W1586272073","https://openalex.org/W1985351788","https://openalex.org/W1995284651","https://openalex.org/W1995774660","https://openalex.org/W2003969379","https://openalex.org/W2007572995","https://openalex.org/W2013444956","https://openalex.org/W2017205387","https://openalex.org/W2072400378","https://openalex.org/W2091020754","https://openalex.org/W2093952957","https://openalex.org/W2096305430","https://openalex.org/W2104734478","https://openalex.org/W2126598061","https://openalex.org/W2169528473","https://openalex.org/W2482946351"],"related_works":["https://openalex.org/W1230495041","https://openalex.org/W2981238890","https://openalex.org/W3201287350","https://openalex.org/W3204452099","https://openalex.org/W2130466874","https://openalex.org/W2362764218","https://openalex.org/W1538818972","https://openalex.org/W2369321817","https://openalex.org/W2157307427","https://openalex.org/W2363058195"],"abstract_inverted_index":{"Vehicle":[0],"routing":[1,79,214],"problems":[2,48],"involve":[3],"the":[4,76,110,164,202,211],"navigation":[5],"of":[6,14,65,98],"one":[7],"or":[8,188],"more":[9],"vehicles":[10],"through":[11,127],"a":[12,68,95,104,114,120,167,176,228],"network":[13,69,165],"locations.":[15],"Locations":[16],"have":[17,35,154,195],"associated":[18,38],"handling":[19],"times":[20],"as":[21,23],"well":[22],"time":[24,36,59,91,130,136,172,180,224],"windows":[25,181],"during":[26,134],"which":[27,113],"they":[28],"are":[29,182],"active.":[30],"The":[31,53,138],"arcs":[32],"connecting":[33],"locations":[34,118,123],"costs":[37],"with":[39],"them.":[40],"In":[41,161],"this":[42,75,101,208],"paper,":[43],"we":[44,73,205],"consider":[45,109],"two":[46],"different":[47],"in":[49,67,112,119,174],"single":[50],"vehicle":[51,115],"routing.":[52],"first":[54],"is":[55,85,141,166,170],"to":[56,210],"find":[57],"least":[58],"cost":[60,173],"routes":[61],"between":[62],"all":[63,77,117,179,212],"pairs":[64,78,213],"nodes":[66],"for":[70,100,157],"navigating":[71],"vehicles;":[72],"call":[74],"problem.":[80],"We":[81,107,198],"show":[82,199],"that":[83,200],"there":[84,169],"an":[86,219],"O(":[87,220],"log":[88,221],"3":[89,222],"n)":[90,223],"parallel":[92,225],"algorithm":[93,226],"using":[94],"polynomial":[96,152],"number":[97],"processors":[99],"problem":[102,111,140,209,215],"on":[103,227],"CREW":[105,229],"PRAM.":[106,230],"next":[108],"services":[116],"network.":[121],"Here,":[122],"can":[124,206],"be":[125],"passed":[126],"at":[128,184],"any":[129],"but":[131,151],"only":[132],"serviced":[133],"their":[135,186],"window.":[137],"general":[139],"[Formula:":[142],"see":[143],"text]":[144],"-complete":[145],"under":[146,201],"even":[147],"fairly":[148],"stringent":[149],"restrictions":[150],"algorithms":[153,194],"been":[155,196],"developed":[156],"some":[158],"special":[159],"cases.":[160],"particular,":[162],"when":[163],"line,":[168],"no":[171],"servicing":[175],"location,":[177],"and":[178,216],"unbounded":[183],"either":[185],"lower":[187],"upper":[189],"end,":[190],"O(n":[191],"2":[192],")":[193],"developed.":[197],"same":[203],"conditions,":[204],"reduce":[207],"therefore":[217],"obtain":[218]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}