{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:54:41Z","timestamp":1778255681394,"version":"3.51.4"},"reference-count":117,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T00:00:00Z","timestamp":1680480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T00:00:00Z","timestamp":1680480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007343","name":"Universit\u00e0 degli Studi di Brescia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007343","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Solving the road congestion problem is one of the most pressing issues in modern cities since it causes time wasting, pollution, higher industrial costs and huge road maintenance costs. Advances in ITS technologies and the advent of autonomous vehicles are changing mobility dramatically. They enable the implementation of a coordination mechanism, called coordinated traffic assignment, among the sat-nav devices aiming at assigning paths to drivers to eliminate congestion and to reduce the total travel time in traffic networks. Among possible congestion avoidance methods, coordinated traffic assignment is a valuable choice since it does not involve huge investments to expand the road network. Traffic assignments are traditionally devoted to two main perspectives on which the well-known Wardropian principles are inspired: the user equilibrium and the system optimum. User equilibrium is a user-driven traffic assignment in which each user chooses the most convenient path selfishly. It guarantees that fairness among users is respected since, when the equilibrium is reached, all users sharing the same origin and destination will experience the same travel time. The main drawback in a user equilibrium is that the system total travel time is not minimized and, hence, the so-called Price of Anarchy is paid. On the other hand, the system optimum is an efficient system-wide traffic assignment in which drivers are routed on the network in such a way the total travel time is minimized, but users might experience travel times that are higher than the other users travelling from the same origin to the same destination, affecting the compliance. Thus, drawbacks in implementing one of the two assignments can be overcome by hybridizing the two approaches, aiming at bridging users\u2019 fairness to system-wide efficiency. In the last decades, a significant number of attempts have been done to bridge fairness among users and system efficiency in traffic assignments. The survey reviews the state-of-the-art of these trade-off approaches.<\/jats:p>","DOI":"10.1007\/s10288-023-00540-w","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T16:07:00Z","timestamp":1680538020000},"page":"89-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Bridging the user equilibrium and the system optimum in static traffic assignment: a review"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3201-918X","authenticated-orcid":false,"given":"Valentina","family":"Morandi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,3]]},"reference":[{"key":"540_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/trsc.37.2.123.15245","volume":"37","author":"T Akamatsu","year":"2003","unstructured":"Akamatsu T, Heydecker B (2003) Detecting dynamic traffic assignment capacity paradoxes in saturated networks. Transp Sci 37:123\u2013138","journal-title":"Transp Sci"},{"key":"540_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2016.08.015","volume":"94","author":"E Angelelli","year":"2016","unstructured":"Angelelli E, Arsik I, Morandi V, Savelsbergh M, Speranza MG (2016) Proactive route guidance to avoid congestion. Transp Res Part B Methodol 94:1\u201321","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2018.07.009","volume":"99","author":"E Angelelli","year":"2018","unstructured":"Angelelli E, Morandi V, Speranza MG (2018) Congestion avoiding heuristic path generation for the proactive route guidance. Comput Oper Res 99:234\u2013248","journal-title":"Comput Oper Res"},{"key":"540_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.cor.2019.05.028","volume":"110","author":"E Angelelli","year":"2019","unstructured":"Angelelli E, Morandi V, Speranza MG (2019) A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints. Comput Oper Res 110:88\u2013100","journal-title":"Comput Oper Res"},{"key":"540_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105016","volume":"123","author":"E Angelelli","year":"2020","unstructured":"Angelelli E, Morandi V, Speranza MG (2020) Minimizing the total travel time with limited unfairness in traffic networks. Comput Oper Res 123:105016","journal-title":"Comput Oper Res"},{"key":"540_CR6","doi-asserted-by":"crossref","unstructured":"Angelelli E, Morandi V, Savelsbergh M, Speranza MG (2020a) System optimal routing of traffic flows with user constraints using linear programming. Eur J Oper Res","DOI":"10.1016\/j.ejor.2020.12.043"},{"issue":"4","key":"540_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1287\/trsc.1060.0158","volume":"40","author":"E Avineri","year":"2006","unstructured":"Avineri E (2006) The effect of reference point on stochastic network equilibrium. Transp Sci 40(4):409\u2013420","journal-title":"Transp Sci"},{"key":"540_CR8","first-page":"63","volume":"21","author":"V Bayram","year":"2016","unstructured":"Bayram V (2016) Optimization models for large scale network evacuation planning and management: a literature review. Surv Oper Res Manag Sci 21:63\u201384","journal-title":"Surv Oper Res Manag Sci"},{"key":"540_CR9","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1051\/ro\/2017046","volume":"52","author":"V Bayram","year":"2018","unstructured":"Bayram V, Yaman H (2018) A stochastic programming approach for shelter location and evacuation planning. RAIRO-Oper Res 52:779\u2013805","journal-title":"RAIRO-Oper Res"},{"key":"540_CR10","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/trsc.2017.0762","volume":"52","author":"V Bayram","year":"2018","unstructured":"Bayram V, Yaman H (2018) Shelter location and evacuation route assignment under uncertainty: a benders decomposition approach. Transp Sci 52:416\u2013436","journal-title":"Transp Sci"},{"key":"540_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.trb.2014.11.010","volume":"72","author":"V Bayram","year":"2015","unstructured":"Bayram V, Tansel B, Yaman H (2015) Compromising system and user interests in shelter location and evacuation planning. Transp Res Part B Methodol 72:146\u2013163","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.trb.2014.11.010","volume":"72","author":"V Bayram","year":"2015","unstructured":"Bayram V, Tansel B\u00c7, Yaman H (2015) Compromising system and user interests in shelter location and evacuation planning. Transp Res Part B Methodol 72:146\u2013163","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR13","unstructured":"Beckmann Martin, McGuire CB and Christopher BW (1956) Studies in the economics of transportation, Technical Report"},{"key":"540_CR14","doi-asserted-by":"crossref","unstructured":"Belov A, Mattas K, Makridis M, Menendez M, Ciuffo B (2021) A microsimulation based analysis of the price of anarchy in traffic routing: the enhanced Braess network case. J Intell Transp Syst 1\u201316","DOI":"10.1080\/15472450.2021.1904920"},{"key":"540_CR15","doi-asserted-by":"crossref","unstructured":"Ben-Elia E, Di\u00a0Pace R, Bifulco GN, Shiftan Y (2013) The impact of travel informations accuracy on route-choice. Transp Res Part C Emerging Technol 26","DOI":"10.1016\/j.trc.2012.07.001"},{"key":"540_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.geb.2018.02.009","volume":"118","author":"U Bhaskar","year":"2019","unstructured":"Bhaskar U, Ligett K, Schulman LJ, Swamy C (2019) Achieving target equilibria in network routing games without knowing the latency functions. Games Econom Behav 118:533\u2013569","journal-title":"Games Econom Behav"},{"key":"540_CR17","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.1100.0442","volume":"35","author":"V Bonifaci","year":"2010","unstructured":"Bonifaci V, Harks T, Sch\u00e4fer G (2010) Stackelberg routing in arbitrary networks. Math Oper Res 35:330\u2013346","journal-title":"Math Oper Res"},{"key":"540_CR18","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1023\/A:1012852413469","volume":"1","author":"D Boyce","year":"2001","unstructured":"Boyce D, Lee D-H, Ran B (2001) Analytical models of the dynamic traffic assignment problem. Netw Spat Econ 1:377\u2013390","journal-title":"Netw Spat Econ"},{"key":"540_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0041-1647(76)90055-1","volume":"10","author":"D Branston","year":"1976","unstructured":"Branston D (1976) Link capacity functions: a review. Transp Res 10:223\u2013236","journal-title":"Transp Res"},{"key":"540_CR20","volume-title":"Route selection and traffic assignment","author":"ME Campbell","year":"1950","unstructured":"Campbell ME (1950) Route selection and traffic assignment. Highway Research Board, Washington"},{"key":"540_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.trc.2016.09.013","volume":"72","author":"Z Chen","year":"2016","unstructured":"Chen Z, He F, Zhang L, Yin Y (2016) Optimal deployment of autonomous vehicle lanes with endogenous market penetration. Transp Res Part C Emerging Technol 72:143\u2013156","journal-title":"Transp Res Part C Emerging Technol"},{"key":"540_CR22","first-page":"411","volume":"68","author":"R Colini-Baldeschi","year":"2020","unstructured":"Colini-Baldeschi R, Cominetti R, Mertikopoulos P, Scarsini M (2020) When is selfish routing bad? the price of anarchy in light and heavy traffic. Oper Res 68:411\u2013434","journal-title":"Oper Res"},{"key":"540_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"JR Correa","year":"2007","unstructured":"Correa JR, Schulz AS, Stier-Moses NE (2007) Fast, fair, and efficient flows in networks. Oper Res 55:215\u2013225","journal-title":"Oper Res"},{"key":"540_CR24","doi-asserted-by":"crossref","unstructured":"Correa J, Cristi A, Oosterwijk T (2019) On the price of anarchy for flows over time. pp. 559-577","DOI":"10.1145\/3328526.3329593"},{"key":"540_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ijpe.2013.07.016","volume":"146","author":"P Cort\u00e9s","year":"2013","unstructured":"Cort\u00e9s P, Mu\u00f1uzuri J, Guadix J, Onieva L (2013) Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs. Int J Prod Econ 146:313\u2013324","journal-title":"Int J Prod Econ"},{"key":"540_CR26","doi-asserted-by":"crossref","unstructured":"DalSasso V, Morandi V (2021) Gathering avoiding centralized pedestrian advice framework: an application for covid-19 outbreak restrictions. In: Optimization and data science: trends and applications, pp. 39\u201349. Springer","DOI":"10.1007\/978-3-030-86286-2_4"},{"key":"540_CR27","first-page":"2005","volume":"89\u201396","author":"A De Palma","year":"1932","unstructured":"De Palma A, Kilani M, Lindsey R (1932) Comparison of second-best and third-best tolling schemes on a road network. Transp Res Rec 89\u201396:2005","journal-title":"Transp Res Rec"},{"key":"540_CR28","doi-asserted-by":"crossref","unstructured":"de Palma A, Lindsey R (2011) Traffic congestion pricing methodologies and technologies. Transp Res Part C Emerging Technol 19","DOI":"10.1016\/j.trc.2011.02.010"},{"key":"540_CR29","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.trb.2016.01.002","volume":"85","author":"X Di","year":"2016","unstructured":"Di X, Liu HX (2016) Boundedly rational route choice behavior: a review of models and methodologies. Transp Res Part B Methodol 85:142\u2013179","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR30","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.trb.2012.05.004","volume":"46","author":"W Di","year":"2012","unstructured":"Di W, Yin Y, Lawphongpanich S, Yang H (2012) Design of more equitable congestion pricing and tradable credit schemes for multimodal transportation networks. Transp Res Part B Methodol 46:1273\u20131287","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR31","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.trb.2013.06.008","volume":"57","author":"X Di","year":"2013","unstructured":"Di X, Liu HX, Pang J-S, Ban XJ (2013) Boundedly rational user equilibria (Brue): mathematical formulation and solution sets. Transp Res Part B Methodol 57:300\u2013313","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR32","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trb.2014.04.005","volume":"67","author":"X Di","year":"2014","unstructured":"Di X, He X, Guo X, Liu HX (2014) Braess paradox under the boundedly rational user equilibria. Transp Res Part B Methodol 67:86\u2013108","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR33","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.trb.2015.11.002","volume":"83","author":"X Di","year":"2016","unstructured":"Di X, Liu HX, Ban XJ (2016) Second best toll pricing within the framework of bounded rationality. Transp Res Part B Methodol 83:74\u201390","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR34","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11116-016-9699-1","volume":"44","author":"X Di","year":"2017","unstructured":"Di X, Liu HX, Zhu S, Levinson DM (2017) Indifference bands for boundedly rational route switching. Transportation 44:1169\u20131194","journal-title":"Transportation"},{"key":"540_CR35","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3141\/2423-07","volume":"2423","author":"S Djavadian","year":"2014","unstructured":"Djavadian S, Hoogendoorn RG, Van Arerm B, Chow JYJ (2014) Empirical evaluation of drivers\u2019 route choice behavioral responses to social navigation. Transp Res Rec 2423:52\u201360","journal-title":"Transp Res Rec"},{"key":"540_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15165-6","volume-title":"Road traffic congestion: a concise guide","author":"C Falcocchio John","year":"2015","unstructured":"Falcocchio John C, Levinson Herbert S (2015) Road traffic congestion: a concise guide. Springer, Cham"},{"key":"540_CR37","doi-asserted-by":"crossref","unstructured":"Feldmann R, Gairing M, L\u00fccking T, Monien B, Rode M (2003) Selfish routing in non-cooperative networks: a survey. In: International symposium on mathematical foundations of computer science, pp. 21\u201345. Springer","DOI":"10.1007\/978-3-540-45138-9_2"},{"key":"540_CR38","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3:95\u2013110","journal-title":"Naval Res Logist Q"},{"key":"540_CR39","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ejor.2016.08.032","volume":"264","author":"M Grazia Speranza","year":"2018","unstructured":"Grazia Speranza M (2018) Trends in transportation and logistics. Eur J Oper Res 264:830\u2013836","journal-title":"Eur J Oper Res"},{"key":"540_CR40","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.trb.2008.09.001","volume":"43","author":"X Guo","year":"2009","unstructured":"Guo X, Yang H (2009) User heterogeneity and bi-criteria system optimum. Transp Res Part B Methodol 43:379\u2013390","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR41","doi-asserted-by":"crossref","unstructured":"Harks T, Kleinert I, Klimm M, M\u00f6hring RH (2015) Computing network tolls with support constraints. Networks, 65","DOI":"10.1002\/net.21604"},{"key":"540_CR42","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/ijoc.15.1.42.15151","volume":"15","author":"K Holmberg","year":"2003","unstructured":"Holmberg K, Yuan D (2003) A multicommodity network-flow problem with side constraints on paths solved by column generation. INFORMS J Comput 15:42\u201357","journal-title":"INFORMS J Comput"},{"key":"540_CR43","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.trb.2010.09.003","volume":"45","author":"X Hongli","year":"2011","unstructured":"Hongli X, Lou Y, Yin Y, Zhou J (2011) A prospect-based user equilibrium model with endogenous reference points and its application in congestion pricing. Transp Res Part B Methodol 45:311\u2013328","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"540_CR44","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.ejor.2018.04.051","volume":"271","author":"S-M Hosseininasab","year":"2018","unstructured":"Hosseininasab S-M, Shetab-Boushehri S-N, Hejazi SR, Karimi H (2018) A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects. Eur J Oper Res 271(1):262\u2013277","journal-title":"Eur J Oper Res"},{"key":"540_CR45","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O Jahn","year":"2005","unstructured":"Jahn O, M\u00f6hring RH, Schulz AS, Stier-Moses N (2005) System-optimal routing of traffic flows with user constraints in networks with congestion. Oper Res 53:600\u2013616","journal-title":"Oper Res"},{"key":"540_CR46","doi-asserted-by":"crossref","unstructured":"Jahn O, M\u00f6hring RH, Schulz AS (2000) Optimal routing of traffic flows with length restrictions in networks with congestion. In: Operations research proceedings 1999, pp. 437\u2013442. Springer","DOI":"10.1007\/978-3-642-58300-1_68"},{"key":"540_CR47","doi-asserted-by":"crossref","unstructured":"Jayakrishnan R, Mahmassani HS, Hu TY (1987) An evaluation tool for advanced traffic information and management systems in urban networks. Transp Res Part C Emerging Technol 2","DOI":"10.1016\/0968-090X(94)90005-1"},{"key":"540_CR48","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1111\/mice.12082","volume":"29","author":"N Jiang","year":"2014","unstructured":"Jiang N, Xie C (2014) Computing and analyzing mixed equilibrium network flows with gasoline and electric vehicles. Comput Aid Civ Infrastruct Eng 29:626\u2013641","journal-title":"Comput Aid Civ Infrastruct Eng"},{"key":"540_CR49","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3141\/2283-03","volume":"2283","author":"N Jiang","year":"2012","unstructured":"Jiang N, Xie C, Waller ST (2012) Path-constrained traffic assignment: model and algorithm. Transp Res Rec 2283:25\u201333","journal-title":"Transp Res Rec"},{"key":"540_CR50","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s13676-013-0021-5","volume":"3","author":"N Jiang","year":"2014","unstructured":"Jiang N, Xie C, Duthie JC, Travis Waller S (2014) A network equilibrium analysis on destination, route and parking choices with mixed gasoline and electric vehicular flows. EURO J Transp Logist 3:55\u201392","journal-title":"EURO J Transp Logist"},{"key":"540_CR51","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.tra.2005.02.004","volume":"39","author":"R-C Jou","year":"2005","unstructured":"Jou R-C, Lam S-H, Liu Y-H, Chen K-H (2005) Route switching behavior on freeways with the provision of different types of real-time traffic information. Transp Res Part A Policy Pract 39:445\u2013461","journal-title":"Transp Res Part A Policy Pract"},{"key":"540_CR52","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1177\/0042098009351939","volume":"47","author":"R-C Jou","year":"2010","unstructured":"Jou R-C, Hensher DA, Liu Y-H, Chiu C-S (2010) Urban commuters\u2019 mode-switching behaviour in Taipai, with an application of the bounded rationality principle. Urban Stud 47:650\u2013665","journal-title":"Urban Stud"},{"key":"540_CR53","volume-title":"Feedback ramp metering in intelligent transportation systems","author":"P Kachroo","year":"2011","unstructured":"Kachroo P, \u00d6zbay KMA (2011) Feedback ramp metering in intelligent transportation systems. Springer, Cham"},{"key":"540_CR54","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.trc.2017.11.007","volume":"86","author":"I Klein","year":"2018","unstructured":"Klein I, Levy N, Ben-Elia E (2018) An agent-based model of the emergence of cooperation and a fair and stable system optimum using Atis on a simple road network. Transp Res Part C Emerging Technol 86:183\u2013201","journal-title":"Transp Res Part C Emerging Technol"},{"key":"540_CR55","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-010-9299-y","volume":"49","author":"R Koch","year":"2011","unstructured":"Koch R, Skutella M (2011) Nash equilibria and the price of anarchy for flows over time. Theory Comput Syst 49:71\u201397","journal-title":"Theory Comput Syst"},{"key":"540_CR56","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"YA Korilis","year":"1997","unstructured":"Korilis YA, Lazar AA, Orda A (1997) Achieving network optima using Stackelberg routing strategies. IEEE\/ACM Trans Netw 5:161\u2013173","journal-title":"IEEE\/ACM Trans Netw"},{"key":"540_CR57","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2013.2289709","volume":"59","author":"W Krichene","year":"2014","unstructured":"Krichene W, Reilly JD, Amin S, Bayen AM (2014) Stackelberg routing on parallel networks with horizontal queues. IEEE Trans Autom Control 59:714\u2013727","journal-title":"IEEE Trans Autom Control"},{"key":"540_CR58","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.retrec.2017.09.010","volume":"68","author":"N Levy","year":"2018","unstructured":"Levy N, Klein I, Ben-Elia E (2018) Emergence of cooperation and a fair system optimum in road networks: a game-theoretic and agent-based modelling approach. Res Transp Econ 68:46\u201355","journal-title":"Res Transp Econ"},{"key":"540_CR59","doi-asserted-by":"crossref","unstructured":"Levy N, Klein I, Ben-Elia E (2017) Emergence of cooperation and a fair system optimum in road networks: a game-theoretic and agent-based modelling approach. Res Transp Econ","DOI":"10.1016\/j.retrec.2017.09.010"},{"key":"540_CR60","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/090769600","volume":"25","author":"H Lin","year":"2011","unstructured":"Lin H, Roughgarden T, Tardos \u00c9, Walkover A (2011) Stronger bounds on Braess\u2019s paradox and the maximum latency of selfish routing. SIAM J Discret Math 25:1667\u20131686. https:\/\/doi.org\/10.1137\/090769600","journal-title":"SIAM J Discret Math"},{"key":"540_CR61","doi-asserted-by":"publisher","DOI":"10.1108\/9781615832460-007","volume-title":"Traffic congestion and congestion pricing","author":"R Lindsney","year":"2001","unstructured":"Lindsney R, Verhoef E (2001) Traffic congestion and congestion pricing. Emerald Group Publishing Limited, UK"},{"key":"540_CR62","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.trb.2014.10.009","volume":"72","author":"H Liu","year":"2015","unstructured":"Liu H, Wang DZW (2015) Global optimization method for network design problem with stochastic user equilibrium. Transp Res Part B Methodol 72:20\u201339","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR63","doi-asserted-by":"crossref","unstructured":"Li Z, Zhao X (2008) Integrated-equilibrium routing of traffic flows with congestion. In: World Congress vol 17, pp. 16065\u201316070","DOI":"10.3182\/20080706-5-KR-1001.02715"},{"key":"540_CR64","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.trb.2005.10.003","volume":"40","author":"HK Lo","year":"2006","unstructured":"Lo HK, Luo XW, Siu BWY (2006) Degradable transport network: travel time budget of travelers with heterogeneous risk aversion. Transp Res Part B Methodol 40:792\u2013806","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR65","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.trb.2009.06.004","volume":"44","author":"Y Lou","year":"2010","unstructured":"Lou Y, Yin Y, Lawphongpanich S (2010) Robust congestion pricing under boundedly rational user equilibrium. Transp Res Part B Methodol 44:15\u201328","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR66","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.neucom.2014.08.071","volume":"151","author":"M Lujak","year":"2015","unstructured":"Lujak M, Giordani S, Ossowski S (2015) Route guidance: bridging system and user optimization in traffic assignment. Neurocomputing 151:449\u2013460","journal-title":"Neurocomputing"},{"key":"540_CR67","unstructured":"Luo J, Hubaux J-P (2004) A survey of inter-vehicle communication. Tech Rep"},{"key":"540_CR68","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/trsc.21.2.89","volume":"21","author":"HS Mahmassani","year":"1987","unstructured":"Mahmassani HS, Chang G-L (1987) On boundedly rational user equilibrium in transportation systems. Transp Sci 21:89\u201399","journal-title":"Transp Sci"},{"key":"540_CR69","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0191-2607(91)90145-G","volume":"25","author":"HS Mahmassani","year":"1991","unstructured":"Mahmassani HS, Jayakrishnan R (1991) System performance and user response under real-time information in a congested traffic corridor. Transp Res Part A Gen 25:293\u2013307","journal-title":"Transp Res Part A Gen"},{"key":"540_CR70","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0968-090X(99)00014-5","volume":"7","author":"HS Mahmassani","year":"1999","unstructured":"Mahmassani HS, Liu Y-H (1999) Dynamics of commuting decision behaviour under advanced traveller information systems. Transp Res Part C Emerging Technol 7:91\u2013107","journal-title":"Transp Res Part C Emerging Technol"},{"key":"540_CR71","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s00224-013-9462-3","volume":"53","author":"M Martin","year":"2013","unstructured":"Martin M, Kate L, Steskal L (2013) Braess\u2019s paradox for flows over time. Theory Comput Syst 53:86\u2013106","journal-title":"Theory Comput Syst"},{"key":"540_CR72","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0191-2615(00)00016-3","volume":"35","author":"Q Meng","year":"2001","unstructured":"Meng Q, Yang H, Bell MGH (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res Part B Methodol 35:83\u2013105","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR73","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tre.2016.05.013","volume":"93","author":"M Miralinaghi","year":"2016","unstructured":"Miralinaghi M, Peeta S (2016) Multi-period equilibrium modeling planning framework for tradable credit schemes. Transp Res Part E Logist Transp Rev 93:177\u2013198","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"540_CR74","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.trd.2019.08.012","volume":"75","author":"M Miralinaghi","year":"2019","unstructured":"Miralinaghi M, Peeta S (2019) Promoting zero-emissions vehicles using robust multi-period tradable credit scheme. Transp Res Part D Transp Environ 75:265\u2013285","journal-title":"Transp Res Part D Transp Environ"},{"key":"540_CR75","doi-asserted-by":"publisher","first-page":"04020030","DOI":"10.1061\/(ASCE)IS.1943-555X.0000570","volume":"26","author":"M Miralinaghi","year":"2020","unstructured":"Miralinaghi M, Peeta S (2020) Design of a multiperiod tradable credit scheme under vehicular emissions caps and traveler heterogeneity in future credit price perception. J Infrastruct Syst 26:04020030","journal-title":"J Infrastruct Syst"},{"key":"540_CR76","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1002\/atr.1425","volume":"50","author":"M Miralinaghi","year":"2016","unstructured":"Miralinaghi M, Lou Y, Hsu Y-T, Shabanpour R, Shafahi Y (2016) Multiclass fuzzy user equilibrium with endogenous membership functions and risk-taking behaviors. J Adv Transp 50:1716\u20131734","journal-title":"J Adv Transp"},{"key":"540_CR77","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/trsc.21.3.133","volume":"21","author":"P Mirchandani","year":"1987","unstructured":"Mirchandani P, Soroush H (1987) Generalized traffic equilibrium with probabilistic travel times and perceptions. Transp Sci 21:133\u2013152","journal-title":"Transp Sci"},{"key":"540_CR78","doi-asserted-by":"crossref","unstructured":"M\u00f6hring RH (1999) Optimal routing of traffic flows with length restrictions in networks with congestion. In: Operations research proceedings 1999: selected papers of the symposium on operations research (SOR99), Magdeburg, September 1\u20133, pp. 437. Springer-Verlag","DOI":"10.1007\/978-3-642-58300-1_68"},{"key":"540_CR79","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.trb.2015.12.005","volume":"84","author":"SJ O\u2019Hare","year":"2016","unstructured":"O\u2019Hare SJ, Connors RD, Watling DP (2016) Mechanisms that govern how the price of anarchy varies with travel demand. Transp Res Part B Methodol 84:55\u201380","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR80","doi-asserted-by":"crossref","unstructured":"Papageorgiou M, Kotsialos A (2000) Freeway ramp metering: an overview. In: Proceedings on intelligent transportation systems, 2000, IEEE, pp. 228\u2013239","DOI":"10.1109\/ITSC.2000.881058"},{"key":"540_CR81","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.trb.2008.05.001","volume":"42","author":"M Patriksson","year":"2008","unstructured":"Patriksson M (2008) On the applicability and solution of bilevel optimization models in transportation science: a study on the existence, stability and computation of optimal solutions to stochastic mathematical programs with equilibrium constraints. Transp Res Part B Methodol 42:843\u2013860","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR82","volume-title":"The traffic assignment problem: models and methods","author":"M Patriksson","year":"2015","unstructured":"Patriksson M (2015) The traffic assignment problem: models and methods. Courier Dover Publications, New York"},{"key":"540_CR83","doi-asserted-by":"publisher","first-page":"102","DOI":"10.3141\/1725-14","volume":"1750","author":"S Peeta","year":"2000","unstructured":"Peeta S, Ramos J, Pasupathy R (2000) Content of variable message signs and on-line driver behavior. Transp Res Rec J Transp Res Board 1750:102\u2013108","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"540_CR84","doi-asserted-by":"crossref","unstructured":"Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spatial Econ 1","DOI":"10.1023\/A:1012827724856"},{"key":"540_CR85","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.scient.2011.03.028","volume":"18","author":"H Ramazani","year":"2011","unstructured":"Ramazani H, Shafahi Y, Seyedabrishami SE (2011) A fuzzy traffic assignment algorithm based on driver perceived travel time of network links. Scientia Iranica 18:190\u2013197","journal-title":"Scientia Iranica"},{"key":"540_CR86","doi-asserted-by":"crossref","unstructured":"Roughgarden T (2008) Algorithmic game theory: some greatest hits and future directions. In: Giorgio A, Juhani K, Giancarlo M, and Luke O, (eds), Fifth Ifip international conference on theoretical computer science\u2013TCS 2008, pp. 21\u201342. Springer US","DOI":"10.1007\/978-0-387-09680-3_2"},{"key":"540_CR87","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T Roughgarden","year":"2003","unstructured":"Roughgarden T (2003) The price of anarchy is independent of the network topology. J Comput Syst Sci 67:341\u2013364","journal-title":"J Comput Syst Sci"},{"key":"540_CR88","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T Roughgarden","year":"2006","unstructured":"Roughgarden T (2006) On the severity of Braess\u2019s paradox: designing networks for selfish users is hard. J Comput Syst Sci 72:922\u2013953","journal-title":"J Comput Syst Sci"},{"key":"540_CR89","doi-asserted-by":"crossref","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing?. J ACM (JACM), 49","DOI":"10.1145\/506147.506153"},{"key":"540_CR90","unstructured":"Ryus P, Vandehey M, Elefteriadou L, Dowling RG, Ostrom BK (2011) Highway capacity manual 2010. TR News, pp. 45\u201348"},{"key":"540_CR91","first-page":"339","volume":"2","author":"K Saw","year":"2015","unstructured":"Saw K, Katti BK, Joshi G (2015) Literature review of traffic assignment: static and dynamic. Int J Transp Eng 2:339\u2013347","journal-title":"Int J Transp Eng"},{"key":"540_CR92","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/net.20133","volume":"48","author":"AS Schulz","year":"2006","unstructured":"Schulz AS, Stier-Moses NE (2006) Efficiency and fairness of system-optimal routing with user constraints. Networks 48:223\u2013234","journal-title":"Networks"},{"key":"540_CR93","doi-asserted-by":"publisher","first-page":"156","DOI":"10.3389\/fbuil.2020.560116","volume":"6","author":"SE Seilabi","year":"2020","unstructured":"Seilabi SE, Tabesh MT, Davatgari A, Miralinaghi M, Labi S (2020) Promoting autonomous vehicles using travel demand and lane management strategies. Front Built Environ 6:156","journal-title":"Front Built Environ"},{"key":"540_CR94","volume-title":"Urban transportation networks: equilibrium analysis with mathematical programming methods","author":"Y Sheffi","year":"1985","unstructured":"Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall, London"},{"key":"540_CR95","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3141\/2561-07","volume":"2561","author":"N Shirmohammadi","year":"2016","unstructured":"Shirmohammadi N, Yin Y (2016) Tradable credit scheme to control bottleneck queue length. Transp Res Rec 2561:53\u201363","journal-title":"Transp Res Rec"},{"key":"540_CR96","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3141\/2333-04","volume":"2333","author":"N Shirmohammadi","year":"2013","unstructured":"Shirmohammadi N, Zangui M, Yin Y, Nie Yu (2013) Analysis and design of tradable credit schemes under uncertainty. Transp Res Rec 2333:27\u201336","journal-title":"Transp Res Rec"},{"key":"540_CR97","doi-asserted-by":"crossref","unstructured":"Sichitiu M, Kihl M (2008) Inter-vehicle communication systems: a survey. IEEE Commun Surv Tutor 88\u2013105","DOI":"10.1109\/COMST.2008.4564481"},{"key":"540_CR98","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1080\/15568318.2013.777263","volume":"9","author":"Z Song","year":"2015","unstructured":"Song Z, Yin Y, Lawphongpanich S (2015) Optimal deployment of managed lanes in general networks. Int J Sustain Transp 9:431\u2013441","journal-title":"Int J Sustain Transp"},{"key":"540_CR99","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tranpol.2003.09.002","volume":"11","author":"PR Stopher","year":"2004","unstructured":"Stopher PR (2004) Reducing road congestion: a reality check. Transp Policy 11:117\u2013131","journal-title":"Transp Policy"},{"key":"540_CR100","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2344422.2344426","volume":"8","author":"C Swamy","year":"2012","unstructured":"Swamy C (2012) The effectiveness of Stackelberg strategies and tolls for network congestion games. ACM Trans Algorith (TALG) 8:1\u201319","journal-title":"ACM Trans Algorith (TALG)"},{"key":"540_CR101","doi-asserted-by":"crossref","unstructured":"Szeto WY, Wang Yi, Han Ke (2015) Bounded rationality in dynamic traffic assignment. In: Bounded rational choice behaviour: applications in transport, pp. 163\u2013187. Emerald Group Publishing Limited","DOI":"10.1108\/978-1-78441-072-820151016"},{"key":"540_CR102","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0968-090X(96)00026-5","volume":"5","author":"H Ta-Yin","year":"1997","unstructured":"Ta-Yin H, Mahmassani HS (1997) Day-to-day evolution of network flows under real-time information and reactive signal control. Transp Res Part C Emerging Technol 5:51\u201369","journal-title":"Transp Res Part C Emerging Technol"},{"key":"540_CR103","doi-asserted-by":"crossref","unstructured":"Van\u00a0Essen M, Eikenbroek O, Thomas T, Van\u00a0Berkum E (2019) Travelers\u2019 compliance with social routing advice: impacts on road network performance and equity. IEEE Trans Intell Transp Syst","DOI":"10.1109\/TITS.2019.2903173"},{"key":"540_CR104","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.tre.2011.10.007","volume":"48","author":"X Wang","year":"2012","unstructured":"Wang X, Yang H, Zhu D, Li C (2012) Tradable travel credits for congestion management with heterogeneous users. Transp Res Part E Logist Transp Rev 48:426\u2013437","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"540_CR105","unstructured":"Wardrop JG (1952b) Proceedings of the institute of civil engineers"},{"key":"540_CR106","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop JG (1952) Road paper. Some theoretical aspects of road traffic research. Proc Inst Civ Eng 1:325\u2013362","journal-title":"Proc Inst Civ Eng"},{"key":"540_CR107","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.ejor.2005.02.039","volume":"175","author":"D Watling","year":"2006","unstructured":"Watling D (2006) User equilibrium traffic network assignment with stochastic travel times and late arrival penalty. Eur J Oper Res 175:1539\u20131556","journal-title":"Eur J Oper Res"},{"key":"540_CR108","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/01441649808717016","volume":"18","author":"H Yang","year":"1998","unstructured":"Yang H, Bell MGH (1998) Models and algorithms for road network design: a review and some new developments. Transp Rev 18:257\u2013278","journal-title":"Transp Rev"},{"key":"540_CR109","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.trb.2010.10.002","volume":"45","author":"H Yang","year":"2011","unstructured":"Yang H, Wang X (2011) Managing network mobility with tradable credits. Transp Res Part B Methodol 45:580\u2013594","journal-title":"Transp Res Part B Methodol"},{"key":"540_CR110","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1061\/(ASCE)0733-947X(2002)128:5(420)","volume":"128","author":"H Yang","year":"2002","unstructured":"Yang H, Zhang X (2002) Multiclass network toll design problem with social and spatial equity constraints. J Transp Eng 128:420\u2013428","journal-title":"J Transp Eng"},{"key":"540_CR111","doi-asserted-by":"crossref","unstructured":"Yang H, Huang H-J (2005) Mathematical and economic theory of road pricing","DOI":"10.1108\/9780080456713"},{"key":"540_CR112","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1287\/trsc.2016.0715","volume":"51","author":"H Ye","year":"2017","unstructured":"Ye H, Yang H (2017) Rational behavior adjustment process with boundedly rational user equilibrium. Transp Sci 51:968\u2013980","journal-title":"Transp Sci"},{"key":"540_CR113","doi-asserted-by":"crossref","unstructured":"Youn H, Gastner MT, Jeong H (2008) Price of anarchy in transportation networks: efficiency and optimality control. Phys Rev Lett 101","DOI":"10.1103\/PhysRevLett.101.128701"},{"key":"540_CR114","doi-asserted-by":"publisher","first-page":"111232","DOI":"10.1109\/ACCESS.2019.2934473","volume":"7","author":"H Yuan","year":"2019","unstructured":"Yuan H, Wang R, Zhang X, Yueqi H, Zhang F, Zhu T, Liu H (2019) Evacuation strategy optimization study based on system theory. IEEE Access 7:111232\u2013111244","journal-title":"IEEE Access"},{"key":"540_CR115","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3141\/2254-01","volume":"2254","author":"L Zhang","year":"2011","unstructured":"Zhang L (2011) Behavioral foundation of route choice and traffic assignment: comparison of principles of user equilibrium traffic assignment under different behavioral assumptions. Transp Res Rec 2254:1\u201310","journal-title":"Transp Res Rec"},{"key":"540_CR116","doi-asserted-by":"crossref","unstructured":"Zhenlong L, Xiaohua Z (2008) Integrated-equilibrium routing of traffic flows with congestion. In: IFAC proceedings vol 41, pp. 16065\u201316070","DOI":"10.3182\/20080706-5-KR-1001.02715"},{"key":"540_CR117","doi-asserted-by":"crossref","unstructured":"Zhou B, Li X (2012) User equilibrium with length constrained users. In: 2012 Fifth international joint conference on computational sciences and optimization, pp. 494\u2013499. IEEE","DOI":"10.1109\/CSO.2012.114"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00540-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00540-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00540-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:06:30Z","timestamp":1712059590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00540-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,3]]},"references-count":117,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00540-w","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,3]]},"assertion":[{"value":"22 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author declares that she has no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}