{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:36:25Z","timestamp":1772120185689,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006390","name":"University of Lausanne","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006390","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Characterizing a public transportation network, such as an urban network with multiple lines, requires the origin\u2013destination trip counts during a given period. Yet, if automatic counting makes the embarkment (boarding) and disembarkment (alighting) counts in vehicles known, it often happens that pedestrian transfers between lines are harder to track, and require costly and invasive devices (e.g., facial recognition system) to be estimated. In this contribution, we propose a method, based on maximum entropy and involving an iterative fitting procedure, which estimates the passenger flow between origins and destinations solely based on embarkment and disembarkment counts. Moreover, this method is flexible enough to provide an adaptable framework in case additional data is known, such as attraction poles between certain nodes in the network, or percentages of transferring passengers between some lines. This method is tested on toy examples, as well as with the data of the public transportation network of the city of Lausanne provided by its Transportation Agency (tl), and gives arguably convincing estimations of the transportation flow.<\/jats:p>","DOI":"10.1007\/s41109-023-00570-7","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T09:01:50Z","timestamp":1689757310000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Estimation of flow trajectories in a multi-lines transportation network"],"prefix":"10.1007","volume":"8","author":[{"given":"Guillaume","family":"Guex","sequence":"first","affiliation":[]},{"given":"Romain","family":"Loup","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Bavaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"issue":"2","key":"570_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/trsc.36.2.184.563","volume":"36","author":"K Ashok","year":"2002","unstructured":"Ashok K, Ben-Akiva ME (2002) Estimation and prediction of time-dependent origin-destination flows with a stochastic mapping to path flows and link flows. Transp Sci 36(2):184\u2013198","journal-title":"Transp Sci"},{"issue":"1","key":"570_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1068\/a3487","volume":"34","author":"F Bavaud","year":"2002","unstructured":"Bavaud F (2002) The quasi-symmetric side of gravity modelling. Environ Plan A 34(1):61\u201379","journal-title":"Environ Plan A"},{"key":"570_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-00659-3_3","volume-title":"Formal theories of information: from shannon to semantic information theory and general concepts of information, LNCS","author":"F Bavaud","year":"2009","unstructured":"Bavaud F (2009) Information theory, relative entropy and statistics. In: Sommaruga G (ed) Formal theories of information: from shannon to semantic information theory and general concepts of information, LNCS, vol 5363. Springer, Berlin, pp 54\u201378"},{"key":"570_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9781118903032","volume-title":"Transportation network analysis","author":"MG Bell","year":"1997","unstructured":"Bell MG, Lida Y (1997) Transportation network analysis. Wiley, Chichester"},{"issue":"1","key":"570_CR5","first-page":"9","volume":"2","author":"J-P Benz\u00e9cri","year":"1977","unstructured":"Benz\u00e9cri J-P (1977) Histoire et pr\u00e9histoire de l\u2019analyse des donn\u00e9es. partie v l\u2019analyse des correspondances. Cahiers de l\u2019analyse des donn\u00e9es 2(1):9\u201340","journal-title":"Cahiers de l\u2019analyse des donn\u00e9es"},{"key":"570_CR6","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi G, Nepusz T (2006) The igraph software package for complex network research. InterJ Complex Syst 1695:1\u20139","journal-title":"InterJ Complex Syst"},{"key":"570_CR7","unstructured":"Cui A (2006) Bus passenger origin-destination matrix estimation using automated data collection systems. PhD thesis, Massachusetts Institute of Technology"},{"issue":"1","key":"570_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc: Ser B (Methodol) 39(1):1\u201322","journal-title":"J R Stat Soc: Ser B (Methodol)"},{"key":"570_CR9","volume-title":"The gravity model in transportation analysis: theory and extensions","author":"S Erlander","year":"1990","unstructured":"Erlander S, Stewart NF (1990) The gravity model in transportation analysis: theory and extensions, vol 3. VSP, Leiden"},{"issue":"7","key":"570_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0191-2615(99)00037-5","volume":"34","author":"ML Hazelton","year":"2000","unstructured":"Hazelton ML (2000) Estimation of origin-destination matrices from link flows on uncongested networks. Transp Res Part B: Methodol 34(7):549\u2013566","journal-title":"Transp Res Part B: Methodol"},{"issue":"4","key":"570_CR11","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"ET Jaynes","year":"1957","unstructured":"Jaynes ET (1957) Information theory and statistical mechanics. Phys Rev 106(4):620","journal-title":"Phys Rev"},{"issue":"44","key":"570_CR12","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.21105\/joss.01926","volume":"4","author":"M Morgan","year":"2019","unstructured":"Morgan M, Young M, Lovelace R, Hama L (2019) Opentripplanner for R. J Open Source Softw 4(44):1926. https:\/\/doi.org\/10.21105\/joss.01926","journal-title":"J Open Source Softw"},{"issue":"5\u20136","key":"570_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M et al (2019) Computational optimal transport: with applications to data science. Found Trends\u24c7 Mach Learn 11(5\u20136):355\u2013607","journal-title":"Found Trends\u24c7 Mach Learn"},{"key":"570_CR14","doi-asserted-by":"crossref","unstructured":"Thomas-Agnan C, LeSage JP (2021). In: Fischer MM, Nijkamp P (eds) Spatial econometric OD-flow models. Springer, Berlin, Heidelberg, pp 2179\u20132199","DOI":"10.1007\/978-3-662-60723-7_87"},{"key":"570_CR15","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB et al (2001) Introduction to graph theory, vol 2. Prentice hall Upper Saddle River"},{"issue":"3","key":"570_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0041-1647(67)90035-4","volume":"1","author":"A Wilson","year":"1967","unstructured":"Wilson A (1967) A statistical theory of spatial distribution models. Transp Res 1(3):253\u2013269","journal-title":"Transp Res"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00570-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T09:33:12Z","timestamp":1729762392000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00570-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00570-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2637944\/v1","asserted-by":"object"}]},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"44"}}