{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T15:51:32Z","timestamp":1778341892701,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T00:00:00Z","timestamp":1745625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T00:00:00Z","timestamp":1745625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002923","name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","doi-asserted-by":"publisher","award":["PIP-11220200100815CO"],"award-info":[{"award-number":["PIP-11220200100815CO"]}],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021778","name":"Agencia Nacional de Promoci\u00f3n de la Investigaci\u00f3n, el Desarrollo Tecnol\u00f3gico y la Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PICT-2019-02886"],"award-info":[{"award-number":["PICT-2019-02886"]}],"id":[{"id":"10.13039\/501100021778","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10479-025-06604-w","type":"journal-article","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:23:18Z","timestamp":1745666598000},"page":"1785-1815","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Social optimum in public transport networks when users choose strategies: analysis and comparison with Wardrop equilibrium"],"prefix":"10.1007","volume":"349","author":[{"given":"Victoria M.","family":"Orlando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6557-7500","authenticated-orcid":false,"given":"Iv\u00e1n L.","family":"Degano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7579-6942","authenticated-orcid":false,"given":"Pablo A.","family":"Lotito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"issue":"3","key":"6604_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.3182\/20060517-3-FR-2903.00211","volume":"39","author":"B Agard","year":"2006","unstructured":"Agard, B., Morency, C., & Tr\u00e9panier, M. (2006). Mining public transport user behaviour from smart card data. IFAC Proceedings Volumes, 39(3), 399\u2013404. https:\/\/doi.org\/10.3182\/20060517-3-FR-2903.00211","journal-title":"IFAC Proceedings Volumes"},{"key":"6604_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3141\/1817-24","volume":"1817","author":"JJ Barry","year":"2002","unstructured":"Barry, J. J., Newhouser, R. J., Rahbee, A., & Sayeda, S. (2002). Origin and destination estimation in New York City with automated fare system data. Transportation Research Record, 1817, 183\u2013187. https:\/\/doi.org\/10.3141\/1817-24","journal-title":"Transportation Research Record"},{"key":"6604_CR3","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1002\/atr.1398","volume":"50","author":"O Cats","year":"2016","unstructured":"Cats, O., & Hartl, M. (2016). Modelling public transport on-board congestion: Comparing schedule-based and agent-based assignment approaches and their implications. Journal of Advanced Transportation, 50, 1209\u20131224. https:\/\/doi.org\/10.1002\/atr.1398","journal-title":"Journal of Advanced Transportation"},{"issue":"6","key":"6604_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.trb.2005.05.006","volume":"40","author":"M Cepeda","year":"2006","unstructured":"Cepeda, M., Cominetti, R., & Florian, M. (2006). A frequency-based assignment model for congested transit networks with strict capacity constraints: Characterization and computation of equilibria. Transportation Research Part B: Methodological, 40(6), 437\u2013459. https:\/\/doi.org\/10.1016\/j.trb.2005.05.006","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"6604_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/trsc.9.2.115","volume":"9","author":"C Chriqui","year":"1975","unstructured":"Chriqui, C., & Robillard, P. N. (1975). Common bus lines. Transportation Science, 9(2), 115\u2013121.","journal-title":"Transportation Science"},{"key":"6604_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103443","volume":"133","author":"E Cipriani","year":"2021","unstructured":"Cipriani, E., Gemma, A., Mannini, L., Carrese, S., & Crisalli, U. (2021). Traffic demand estimation using path information from bluetooth data. Transportation Research Part C: Emerging Technologies, 133, 103443. https:\/\/doi.org\/10.1016\/j.trc.2021.103443","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"6604_CR7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1894","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. Operations Research. https:\/\/doi.org\/10.1287\/opre.2019.1894","journal-title":"Operations Research"},{"key":"6604_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/trsc.35.3.250.10154","volume":"35","author":"R Cominetti","year":"2001","unstructured":"Cominetti, R., & Correa, J. (2001). Common-lines and passenger assignment in congested transit networks. Transportation Science, 35, 250\u2013267. https:\/\/doi.org\/10.1287\/trsc.35.3.250.10154","journal-title":"Transportation Science"},{"key":"6604_CR9","first-page":"234","volume":"52","author":"R Connors","year":"2016","unstructured":"Connors, R. (2016). The price of anarchy in urban traffic networks. Mathematics Today, 52, 234\u2013237.","journal-title":"Mathematics Today"},{"key":"6604_CR10","doi-asserted-by":"publisher","unstructured":"Correa, J. R., & Stier-Moses, N. E. (2011). Wardrop equilibria. In Wiley Encyclopedia of operations research and management science. Wiley. https:\/\/doi.org\/10.1002\/9780470400531.eorms0962","DOI":"10.1002\/9780470400531.eorms0962"},{"key":"6604_CR11","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.sbspro.2012.09.829","volume":"54","author":"Q Fu","year":"2012","unstructured":"Fu, Q., Liu, R., & Hess, S. (2012). A review on transit assignment modelling approaches to congested networks: A new perspective. Procedia - Social and Behavioral Sciences, 54, 1145\u20131155. https:\/\/doi.org\/10.1016\/j.sbspro.2012.09.829","journal-title":"Procedia - Social and Behavioral Sciences"},{"issue":"1","key":"6604_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejor.2013.04.003","volume":"230","author":"VA Knight","year":"2013","unstructured":"Knight, V. A., & Harper, P. R. (2013). Selfish routing in public services. European Journal of Operational Research, 230(1), 122\u2013132. https:\/\/doi.org\/10.1016\/j.ejor.2013.04.003","journal-title":"European Journal of Operational Research"},{"key":"6604_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.trip.2023.100832","volume":"19","author":"VM Orlando","year":"2023","unstructured":"Orlando, V. M., Baquela, E. G., Bhouri, N., & Lotito, P. A. (2023). Public transport demand estimation by frequency adjustments. Transportation Research Interdisciplinary Perspectives, 19, 100832. https:\/\/doi.org\/10.1016\/j.trip.2023.100832","journal-title":"Transportation Research Interdisciplinary Perspectives"},{"key":"6604_CR14","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C. (2001). Algorithms, games, and the internet. In Conference proceedings of the annual ACM symposium on theory of computing 2076. https:\/\/doi.org\/10.1145\/1963405.1963409","DOI":"10.1145\/1963405.1963409"},{"key":"6604_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tra.2021.03.011","volume":"148","author":"M Paulsen","year":"2021","unstructured":"Paulsen, M., Rasmussen, T. K., & Nielsen, O. A. (2021). Impacts of real-time information levels in public transport: A large-scale case study using an adaptive passenger path choice model. Transportation Research Part A: Policy and Practice, 148, 155\u2013182. https:\/\/doi.org\/10.1016\/j.tra.2021.03.011","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"6604_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., & Tardos, E. (2002). How bad is selfish routing? Journal of the ACM. https:\/\/doi.org\/10.1145\/506147.506153","journal-title":"Journal of the ACM"},{"issue":"2","key":"6604_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0191-2615(89)90034-9","volume":"23","author":"H Spiess","year":"1989","unstructured":"Spiess, H., & Florian, M. (1989). Optimal strategies: A new assignment model for transit networks. Transportation Research Part B: Methodological, 23(2), 83\u2013102. https:\/\/doi.org\/10.1016\/0191-2615(89)90034-9","journal-title":"Transportation Research Part B: Methodological"},{"key":"6604_CR18","volume-title":"Python 3 reference manual","author":"G Van Rossum","year":"2009","unstructured":"Van Rossum, G., & Drake, F. L. (2009). Python 3 reference manual. CreateSpace."},{"key":"6604_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S. J., Brett, M., Wilson, J., Millman, K. J., Mayorov, N., Nelson, A. R. J., Jones, E., Kern, R., Larson, E., & van Mulbregt, P. (2020). SciPy 1.0 contributors: SciPy 1.0: Fundamental algorithms for scientific computing in Python. Nature Methods, 17, 261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nature Methods"},{"key":"6604_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.101.128701","volume":"101","author":"H Youn","year":"2008","unstructured":"Youn, H., Gastner, M., & Jeong, H. (2008). Price of anarchy in transportation networks: Efficiency and optimality control. Physical Review Letters, 101, 128701. https:\/\/doi.org\/10.1103\/PhysRevLett.101.128701","journal-title":"Physical Review Letters"},{"key":"6604_CR21","doi-asserted-by":"publisher","unstructured":"Zhang, J., Pourazarm, S., Cassandras, C. G., & Paschalidis, I. C. (2016). The price of anarchy in transportation networks by estimating user cost functions from actual traffic data. In: 2016 IEEE 55th conference on decision and control (CDC) (pp. 789\u2013794). https:\/\/doi.org\/10.1109\/CDC.2016.7798364","DOI":"10.1109\/CDC.2016.7798364"},{"issue":"4","key":"6604_CR22","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/JPROC.2018.2790405","volume":"106","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Pourazarm, S., Cassandras, C. G., & Paschalidis, I. C. (2018). The price of anarchy in transportation networks: Data-driven evaluation and reduction strategies. Proceedings of the IEEE, 106(4), 538\u2013553. https:\/\/doi.org\/10.1109\/JPROC.2018.2790405","journal-title":"Proceedings of the IEEE"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06604-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06604-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06604-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:09:16Z","timestamp":1750093756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06604-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,26]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["6604"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06604-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,26]]},"assertion":[{"value":"5 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials availability"}}]}}