{"id":"https://openalex.org/W2165387188","doi":"https://doi.org/10.1287/opre.41.5.935","title":"Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems","display_name":"Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems","publication_year":1993,"publication_date":"1993-10-01","ids":{"openalex":"https://openalex.org/W2165387188","doi":"https://doi.org/10.1287/opre.41.5.935","mag":"2165387188"},"language":"en","primary_location":{"id":"doi:10.1287/opre.41.5.935","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.41.5.935","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://doi.org/10.1287/opre.41.5.935","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100606557","display_name":"Paul M. Thompson","orcid":"https://orcid.org/0000-0002-4720-8867"},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul M. Thompson","raw_affiliation_strings":["Santa Clara University, Santa Clara, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Santa Clara University, Santa Clara, California","institution_ids":["https://openalex.org/I16269868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008565328","display_name":"Harilaos N. Psaraftis","orcid":"https://orcid.org/0000-0003-1671-4406"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Harilaos N. Psaraftis","raw_affiliation_strings":["National Technical University of Athens, Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.5231,"has_fulltext":false,"cited_by_count":293,"citation_normalized_percentile":{"value":0.99392194,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"41","issue":"5","first_page":"935","last_page":"946"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/computer-science","display_name":"Computer science","score":0.7389699220657349},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6190665364265442},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5211639404296875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5032526850700378},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.48273390531539917},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.41278672218322754},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4114445447921753},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.337202250957489},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.31897616386413574},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1613563597202301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13012254238128662},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12629789113998413}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389699220657349},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6190665364265442},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5211639404296875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5032526850700378},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.48273390531539917},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.41278672218322754},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4114445447921753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.337202250957489},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.31897616386413574},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1613563597202301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13012254238128662},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12629789113998413},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/opre.41.5.935","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.41.5.935","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/10920","is_oa":true,"landing_page_url":"http://doi.org/10.1287/opre.41.5.935","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPERATIONS RESEARCH","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/10920","is_oa":true,"landing_page_url":"http://doi.org/10.1287/opre.41.5.935","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"OPERATIONS RESEARCH","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1505072027","https://openalex.org/W1524101273","https://openalex.org/W1546822455","https://openalex.org/W1558547553","https://openalex.org/W1979295983","https://openalex.org/W1997403587","https://openalex.org/W2003113703","https://openalex.org/W2031061043","https://openalex.org/W2033509633","https://openalex.org/W2035231387","https://openalex.org/W2035610952","https://openalex.org/W2039766013","https://openalex.org/W2042986967","https://openalex.org/W2046806484","https://openalex.org/W2082260357","https://openalex.org/W2089929819","https://openalex.org/W2096305430","https://openalex.org/W2106378689","https://openalex.org/W2108753073","https://openalex.org/W2111581650","https://openalex.org/W2113562462","https://openalex.org/W2117235989","https://openalex.org/W2126598061","https://openalex.org/W2148673189","https://openalex.org/W2172122819","https://openalex.org/W2405827726","https://openalex.org/W2795679194","https://openalex.org/W2999341115","https://openalex.org/W3036211873"],"related_works":["https://openalex.org/W286292322","https://openalex.org/W11368780","https://openalex.org/W2041855631","https://openalex.org/W2204238626","https://openalex.org/W2070232115","https://openalex.org/W2105937634","https://openalex.org/W2121798534","https://openalex.org/W2190025777","https://openalex.org/W2186564613","https://openalex.org/W2057148423"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,22,48,62,127],"application":[4,49],"of":[5,9,50,65,71,107],"a":[6,105,146],"new":[7],"class":[8],"neighborhood":[10],"search":[11],"algorithms\u2014cyclic":[12],"transfers\u2014to":[13],"multivehicle":[14],"routing":[15,38,55,73,98,138,158],"and":[16,56,74,99,109,135,139,159],"scheduling":[17,57,75,100,140,160],"problems.":[18,58,76,141],"These":[19],"algorithms":[20,67,131],"exploit":[21],"two-faceted":[23],"decision":[24],"structure":[25],"inherent":[26],"to":[27,34,53,123,149],"this":[28],"problem":[29,161],"class:":[30],"First,":[31],"assigning":[32],"demands":[33],"vehicles":[35],"and,":[36],"second,":[37],"each":[39],"vehicle":[40,54,72,97,137,157],"through":[41],"its":[42],"assigned":[43],"demand":[44],"stops.":[45],"We":[46],"describe":[47],"cyclic":[51,87,117],"transfers":[52],"Then":[59],"we":[60,78,90],"determine":[61],"worst-case":[63],"performance":[64],"these":[66],"for":[68,83,94,132],"several":[69,133],"classes":[70],"Next,":[77],"develop":[79],"computationally":[80],"efficient":[81],"methods":[82,119],"finding":[84],"negative":[85],"cost":[86],"transfers.":[88],"Finally,":[89],"present":[91],"computational":[92],"results":[93,114],"three":[95],"diverse":[96],"problems,":[101],"which":[102,152],"collectively":[103],"incorporate":[104],"variety":[106],"constraint":[108],"objective":[110],"function":[111],"structures.":[112],"Our":[113],"show":[115],"that":[116],"transfer":[118],"are":[120],"either":[121],"comparable":[122],"or":[124],"better":[125],"than":[126],"best":[128],"published":[129],"heuristic":[130],"complex":[134],"important":[136],"Most":[142],"importantly,":[143],"they":[144],"represent":[145],"novel":[147],"approach":[148],"solution":[150],"improvement":[151],"holds":[153],"promise":[154],"in":[155],"many":[156],"domains.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}