{"id":"https://openalex.org/W4231781553","doi":"https://doi.org/10.1177/0361198105192300104","title":"Toll Pricing and Heterogeneous Users","display_name":"Toll Pricing and Heterogeneous Users","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W4231781553","doi":"https://doi.org/10.1177/0361198105192300104"},"language":"en","primary_location":{"id":"doi:10.1177/0361198105192300104","doi":"https://doi.org/10.1177/0361198105192300104","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0361198105192300104","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Research Record: Journal of the Transportation Research Board","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/A5026147899","display_name":"Hani S. Mahmassani","orcid":"https://orcid.org/0000-0002-8443-8928","observed_orcids":["https://orcid.org/0000-0002-8443-8928"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hani S. Mahmassani","raw_affiliation_strings":["Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047902154","display_name":"Xuesong Simon Zhou","orcid":"https://orcid.org/0000-0002-9963-5369","observed_orcids":["https://orcid.org/0000-0002-9963-5369"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuesong Zhou","raw_affiliation_strings":["Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029408192","display_name":"Chung\u2010Cheng Lu","orcid":"https://orcid.org/0000-0001-8317-4193","observed_orcids":["https://orcid.org/0000-0001-8317-4193"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chung-Cheng Lu","raw_affiliation_strings":["Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maryland Transportation Initiative, Department of Civil and Environmental Engineering, University of Maryland, 1173 Glenn L. Martin Hall, College Park, MD 20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":3650,"currency":"USD","value_usd":3650},"apc_paid":null,"fwci":1.1516,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90308187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1923","issue":"1","first_page":"28","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9897000193595886,"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.9897000193595886,"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.004999999888241291,"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.0008999999845400453,"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/time-dependent-shortest-path","display_name":"time-dependent shortest path","score":0.8009999990463257},{"id":"https://openalex.org/keywords/heterogeneous-users","display_name":"heterogeneous users","score":0.8730000257492065},{"id":"https://openalex.org/keywords/value-of-time","display_name":"value of time","score":0.878000020980835},{"id":"https://openalex.org/keywords/dynamic-traffic-assignment","display_name":"dynamic traffic assignment","score":0.906000018119812},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6909999847412109},{"id":"https://openalex.org/keywords/binary-search","display_name":"binary search","score":0.6840000152587891},{"id":"https://openalex.org/keywords/bi-objective-optimization","display_name":"bi-objective optimization","score":0.7070000171661377}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6881901621818542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6020538210868835},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6018499732017517},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5665172338485718},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5289316773414612},{"id":"https://openalex.org/C2778025104","wikidata":"https://www.wikidata.org/wiki/Q408004","display_name":"Toll","level":2,"score":0.5156549215316772},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5152402520179749},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.498898983001709},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46949437260627747},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4541846513748169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28085941076278687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26398706436157227},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10662072896957397},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0361198105192300104","doi":"https://doi.org/10.1177/0361198105192300104","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0361198105192300104","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Research Record: Journal of the Transportation Research Board","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W363849403","https://openalex.org/W568703599","https://openalex.org/W1514550500","https://openalex.org/W1600159497","https://openalex.org/W1998062665","https://openalex.org/W1998132337","https://openalex.org/W2003242535","https://openalex.org/W2011039300","https://openalex.org/W2019870562","https://openalex.org/W2022773597","https://openalex.org/W2037963614","https://openalex.org/W2056802293","https://openalex.org/W2060932870","https://openalex.org/W2063549568","https://openalex.org/W2066047491","https://openalex.org/W2071852134","https://openalex.org/W2130626677","https://openalex.org/W2516321972","https://openalex.org/W2921092875","https://openalex.org/W3015681923"],"related_works":["https://openalex.org/W2142353993","https://openalex.org/W1982662960","https://openalex.org/W4245451078","https://openalex.org/W96220678","https://openalex.org/W1967072265","https://openalex.org/W2085152474","https://openalex.org/W43621356","https://openalex.org/W1507966918","https://openalex.org/W2106985416","https://openalex.org/W2063932215"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"both":[3],"exact":[4,64,123],"and":[5,28,60,80,124,145,166],"approximation":[6,76,110,125,181],"algorithms":[7],"for":[8,15,70,186],"finding":[9],"extreme":[10,51,104],"efficient":[11,52,105,185],"time-dependent":[12,53,189],"shortest":[13,90,190],"paths":[14,54,106],"use":[16,114],"with":[17,24,112,128],"dynamic":[18],"traffic":[19,135],"assignment":[20],"applications":[21,192],"to":[22,45,99],"networks":[23],"variable":[25],"toll":[26],"pricing":[27],"heterogeneous":[29],"users":[30],"(with":[31],"different":[32],"value":[33,118],"of":[34,50,86,103,115,119,148,163,169],"time":[35,59,120,144,164],"preferences).":[36],"A":[37],"parametric":[38],"least-generalized":[39],"cost":[40,61],"path":[41,91,191],"algorithm":[42],"is":[43,97,183],"presented":[44],"determine":[46],"a":[47,93,101],"complete":[48],"set":[49,102,151],"that":[55,107,141,178],"simultaneously":[56],"consider":[57],"travel":[58],"criteria.":[62],"However,":[63],"procedures":[65],"may":[66],"not":[67],"be":[68],"practical":[69],"large":[71],"networks.":[72,136],"For":[73],"this":[74],"reason,":[75],"schemes":[77,126],"are":[78,130,152],"devised":[79],"tested.":[81],"Based":[82],"on":[83,132],"the":[84,113,116,142,146,149,161,167,172,179],"concept":[85],"\u03b5-efficiency":[87],"in":[88,171],"multiobjective":[89],"problems,":[92],"binary":[94],"search":[95],"framework":[96],"developed":[98],"find":[100],"minimize":[108],"expected":[109],"error,":[111],"underlying":[117],"distribution.":[121],"Both":[122],"(along":[127],"variants)":[129],"tested":[131],"three":[133],"actual":[134],"The":[137,174],"experimental":[138],"results":[139,175],"indicate":[140],"computation":[143],"size":[147],"solution":[150,196],"jointly":[153],"determined":[154],"by":[155],"several":[156],"key":[157],"parameters":[158],"such":[159],"as":[160],"number":[162,168],"intervals":[165],"nodes":[170],"network.":[173],"also":[176],"suggest":[177],"proposed":[180],"scheme":[182],"computationally":[184],"large-scale":[187],"bi-objective":[188],"while":[193],"maintaining":[194],"satisfactory":[195],"quality.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2022-05-12T00:00:00"}