{"id":"https://openalex.org/W2038990139","doi":"https://doi.org/10.1016/s1571-0661(04)80529-2","title":"Management of Railroad Impedances for Shortest Path-based Routing","display_name":"Management of Railroad Impedances for Shortest Path-based Routing","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2038990139","doi":"https://doi.org/10.1016/s1571-0661(04)80529-2","mag":"2038990139"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80529-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80529-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80529-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084244112","display_name":"Jeff Day","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeff Day","raw_affiliation_strings":["Schneider Logistics, Green Bay, WI, USA"],"affiliations":[{"raw_affiliation_string":"Schneider Logistics, Green Bay, WI, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057281816","display_name":"George L. Nemhauser","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George L. Nemhauser","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062554863","display_name":"Joel Sokol","orcid":"https://orcid.org/0000-0001-8228-8359"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joel S. Sokol","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057281816","https://openalex.org/A5062554863","https://openalex.org/A5084244112"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.824,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.74268706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"6","first_page":"53","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9728999733924866,"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.9728999733924866,"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/T14304","display_name":"Transport Systems and Technology","score":0.9585000276565552,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T11223","display_name":"Maritime Ports and Logistics","score":0.9564999938011169,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7114381194114685},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6362361311912537},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6341661214828491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.565259575843811},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5594816207885742},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5142021179199219},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4839904308319092},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.46091726422309875},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4209594130516052},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.41298022866249084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3206644356250763},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.28930407762527466},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.10489135980606079},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09264662861824036}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7114381194114685},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6362361311912537},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6341661214828491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.565259575843811},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5594816207885742},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5142021179199219},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4839904308319092},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.46091726422309875},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4209594130516052},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41298022866249084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3206644356250763},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.28930407762527466},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.10489135980606079},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09264662861824036},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)80529-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80529-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:smartech.gatech.edu:1853/25483","is_oa":false,"landing_page_url":"http://hdl.handle.net/1853/25483","pdf_url":null,"source":{"id":"https://openalex.org/S4377196313","display_name":"SMARTech Repository (Georgia Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130701444","host_organization_name":"Georgia Institute of Technology","host_organization_lineage":["https://openalex.org/I130701444"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80529-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80529-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2021388365","https://openalex.org/W2038990139","https://openalex.org/W2089151859","https://openalex.org/W2911796152"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2032436423","https://openalex.org/W2913674600","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W1561045713","https://openalex.org/W2374451529","https://openalex.org/W2080904092","https://openalex.org/W2348121120"],"abstract_inverted_index":{"The":[0,54,90,104,148],"routing":[1,14,30,55],"of":[2,35,56,62,77,92,106,111,125,163],"traffic":[3,47],"is":[4,59,100,117,122,167],"a":[5,27,60,97,123,134,178,183],"major":[6],"logistical":[7],"concern":[8],"for":[9,70,113,172,188],"transportation":[10],"services.":[11],"For":[12],"railroads,":[13],"has":[15],"historically":[16],"been":[17],"handled":[18],"by":[19],"large,":[20],"hard-coded":[21],"tables.":[22],"Norfolk":[23],"Southern":[24],"Railways":[25],"developed":[26],"more":[28],"sophisticated":[29],"system":[31,45,116],"that":[32,83,136],"takes":[33],"advantage":[34],"network":[36],"flow":[37],"theory.":[38],"Their":[39],"Algorithmic":[40],"Blocking":[41],"and":[42,121,182],"Classification":[43],"(ABC)":[44],"routes":[46,69,87],"commodities":[48,71],"(waybills)":[49],"according":[50],"to":[51,95,145,199],"shortest":[52,88],"paths.":[53,89],"multiple":[57],"waybills":[58],"form":[61,124],"the":[63,75,85,114,126,146,157,164],"Multicommodity":[64,128],"Flow":[65,129],"Problem":[66,130],"(MCFP).":[67],"Since":[68],"are":[72],"often":[73],"predetermined,":[74],"success":[76],"ABC":[78,115],"relies":[79],"on":[80],"finding":[81,93,107],"costs":[82,94,112],"make":[84,96],"desired":[86],"problem":[91,150],"solution":[98,135,180],"optimal":[99,142,190],"called":[101],"inverse":[102],"optimization.":[103],"procedure":[105],"an":[108],"adequate":[109],"set":[110],"known":[118],"as":[119],"calibration":[120,149],"Inverse":[127],"(IMCFP).":[131],"Calibration":[132],"seeks":[133],"makes":[137],"all":[138],"predetermined":[139],"paths":[140],"uniquely":[141],"with":[143],"respect":[144],"costs.":[147],"(IMCFP)":[151],"can":[152,195],"be":[153],"solved":[154],"optimally":[155],"using":[156],"simplex":[158,165],"method.":[159],"However,":[160],"direct":[161],"application":[162],"algorithm":[166,187],"not":[168],"always":[169],"advantageous,":[170],"especially":[171],"large":[173],"problems.":[174],"We":[175],"present":[176],"formulations,":[177],"primal-dual":[179],"algorithm,":[181],"hot":[184],"start":[185],"basis-finding":[186],"deriving":[189],"solutions.":[191,203],"In":[192],"addition,":[193],"we":[194],"use":[196],"Lagrangian":[197],"relaxation":[198],"find":[200],"good":[201],"heuristic":[202]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}