{"id":"https://openalex.org/W2000558287","doi":"https://doi.org/10.1057/jors.1960.32","title":"A Method for Finding the Shortest Route Through a Road Network","display_name":"A Method for Finding the Shortest Route Through a Road Network","publication_year":1960,"publication_date":"1960-03-01","ids":{"openalex":"https://openalex.org/W2000558287","doi":"https://doi.org/10.1057/jors.1960.32","mag":"2000558287"},"language":"en","primary_location":{"id":"doi:10.1057/jors.1960.32","doi":"https://doi.org/10.1057/jors.1960.32","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1960.32","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"volume":null,"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/A5019036850","display_name":"PA Whiting","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. D. Whiting","raw_affiliation_strings":["Department of Scientific and Industrial ResearchRoad Research Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Scientific and Industrial ResearchRoad Research Laboratory","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062516090","display_name":"J A Hillier","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. A. Hillier","raw_affiliation_strings":["Department of Scientific and Industrial ResearchRoad Research Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Scientific and Industrial ResearchRoad Research Laboratory","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.7143,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.9789916,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"1-2","first_page":"37","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.739300012588501,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.739300012588501,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1680999994277954,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.07339999824762344,"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/shortest-path","display_name":"shortest path","score":0.7950000166893005},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.8330000042915344},{"id":"https://openalex.org/keywords/traffic-distribution","display_name":"traffic distribution","score":0.7940000295639038},{"id":"https://openalex.org/keywords/route-choice","display_name":"route choice","score":0.42100000381469727},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.5400000214576721},{"id":"https://openalex.org/keywords/vehicle-operating-costs","display_name":"vehicle operating costs","score":0.7360000014305115},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.4259999990463257},{"id":"https://openalex.org/keywords/computer-algorithms","display_name":"computational algorithms","score":0.4740000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6914834976196289},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.6160070896148682},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.506037175655365},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5056378841400146},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.47207000851631165},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.42995965480804443},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.42606014013290405},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.411212682723999},{"id":"https://openalex.org/C64093975","wikidata":"https://www.wikidata.org/wiki/Q356677","display_name":"Floating car data","level":3,"score":0.41002315282821655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23646008968353271},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.20094436407089233},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.14420801401138306},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12114250659942627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09580108523368835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09338858723640442},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.07694199681282043},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1057/jors.1960.32","doi":"https://doi.org/10.1057/jors.1960.32","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1960.32","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2060322444","https://openalex.org/W2227557434","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W1975038761","https://openalex.org/W608187343","https://openalex.org/W1984579796","https://openalex.org/W1965469937","https://openalex.org/W145856648","https://openalex.org/W2130644458","https://openalex.org/W2898886186","https://openalex.org/W2577397610","https://openalex.org/W2187688032","https://openalex.org/W4231101394"],"abstract_inverted_index":{"When":[0],"a":[1,37,155],"new":[2],"road":[3,26],"is":[4,8,66,93,108],"being":[5],"planned":[6],"it":[7,19,123],"necessary":[9],"to":[10,18,86,96,141],"assess":[11,97],"how":[12,88],"much":[13],"traffic":[14,31,89],"will":[15],"be":[16,84,125,139],"diverted":[17],"from":[20],"various":[21],"parts":[22],"of":[23,30,39,58,101,113],"the":[24,52,59,63,70,78,91,98,105,114,150],"existing":[25],"network.":[27,156],"This":[28],"allocation":[29],"has":[32,49],"usually":[33],"been":[34],"based":[35],"on":[36,45,51,77,104,128],"comparison":[38],"journey":[40,43,118],"times":[41],"or":[42,72,144],"costs":[44,119],"alternative":[46],"routes,":[47],"and":[48,56,80,95,111,122],"depended":[50],"selection,":[53],"by":[54],"trial":[55],"error,":[57],"cheapest":[60,73],"route":[61],"through":[62,154],"network.A":[64],"method":[65],"described":[67],"which":[68,81,117],"determines":[69],"shortest":[71],"routes":[74,153],"between":[75,90],"points":[76,92],"network":[79],"can":[82,138],"readily":[83],"extended":[85],"show":[87],"distributed":[94],"total":[99],"cost":[100],"vehicle":[102],"operation":[103],"network.The":[106],"procedure":[107],"quite":[109],"systematic":[110],"independent":[112],"manner":[115],"in":[116,135],"are":[120],"derived,":[121],"could":[124],"carried":[126],"out":[127],"an":[129],"electronic":[130],"computer":[131],"with":[132],"considerable":[133],"saving":[134],"time.":[136],"It":[137],"applied":[140],"any":[142],"transportation":[143],"communication":[145],"problem":[146],"that":[147],"involves":[148],"finding":[149],"most":[151],"economical":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}