{"id":"https://openalex.org/W2006140965","doi":"https://doi.org/10.1002/net.3230040105","title":"A fundamental problem in vehicle routing","display_name":"A fundamental problem in vehicle routing","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2006140965","doi":"https://doi.org/10.1002/net.3230040105","mag":"2006140965"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230040105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040105","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5066227897","display_name":"Clifford S. Orloff","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. S. Orloff","raw_affiliation_strings":["Princeton University Princeton, New Jersey","Princeton University, Princeton New Jersey"],"affiliations":[{"raw_affiliation_string":"Princeton University Princeton, New Jersey","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton New Jersey","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066227897"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":26.8363,"has_fulltext":false,"cited_by_count":260,"citation_normalized_percentile":{"value":0.99541495,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"4","issue":"1","first_page":"35","last_page":"64"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9936000108718872,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9891999959945679,"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/arc-routing","display_name":"Arc routing","score":0.7681171298027039},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5789945721626282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5532936453819275},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5422874093055725},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5092414617538452},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4782063961029053},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46823185682296753},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4399799704551697},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.43386363983154297},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.41906023025512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3539280891418457},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.26562070846557617},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17413347959518433},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1470336616039276},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07056540250778198}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.7681171298027039},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5789945721626282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5532936453819275},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5422874093055725},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5092414617538452},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4782063961029053},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46823185682296753},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4399799704551697},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.43386363983154297},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.41906023025512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3539280891418457},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.26562070846557617},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17413347959518433},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1470336616039276},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07056540250778198},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230040105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040105","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":15,"referenced_works":["https://openalex.org/W1551635709","https://openalex.org/W1570983058","https://openalex.org/W1964119857","https://openalex.org/W2011087880","https://openalex.org/W2037455079","https://openalex.org/W2042986967","https://openalex.org/W2064284095","https://openalex.org/W2077053998","https://openalex.org/W2166818331","https://openalex.org/W2327315803","https://openalex.org/W2401610261","https://openalex.org/W3118260104","https://openalex.org/W4213214460","https://openalex.org/W4244424643","https://openalex.org/W6701294544"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268","https://openalex.org/W2334181621"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"important":[2],"but":[3],"difficult":[4],"combinatorial":[5],"problem,":[6],"in":[7,115],"general,":[8],"is":[9],"to":[10,53,69,111],"find":[11],"the":[12,30,47,59,90,95],"optimal":[13],"route":[14],"for":[15,38,97],"a":[16,20,26,66],"single":[17],"vehicle":[18],"on":[19],"given":[21],"network.":[22],"This":[23],"paper":[24],"defines":[25],"problem":[27,117],"type,":[28],"called":[29],"General":[31,60],"Routing":[32,61],"Problem,":[33],"and":[34,46,72,77,94],"gives":[35],"an":[36],"algorithm":[37,64],"its":[39],"solution.":[40],"The":[41,63],"classical":[42],"Traveling":[43],"Salesman":[44],"Problem":[45,50],"Chinese":[48],"Postman":[49],"are":[51],"shown":[52],"be":[54],"special":[55,79],"limiting":[56],"cases":[57],"of":[58,81,89],"Problem.":[62],"provides":[65],"unified":[67],"approach":[68,109],"both":[70],"node":[71,104],"arc":[73,98],"oriented":[74,105],"routing":[75,106],"problems,":[76,107],"exploits":[78],"properties":[80],"most":[82],"real":[83],"transportation":[84],"networks":[85],"such":[86],"as":[87],"sparsity":[88],"associated":[91],"adjacency":[92],"matrix,":[93],"tendency":[96],"symmetry":[99],"at":[100],"many":[101],"nodes.":[102],"For":[103],"this":[108],"tends":[110],"produce":[112],"large":[113],"reduction":[114],"effective":[116],"size.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}