{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:16:27Z","timestamp":1773267387445,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s40314-023-02426-3","type":"journal-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T12:03:18Z","timestamp":1692705798000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Traffic sensor location using Wardrop equilibrium"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3182-9674","authenticated-orcid":false,"given":"Nicol\u00e1s","family":"Jares","sequence":"first","affiliation":[]},{"given":"Dami\u00e1n","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Pablo A.","family":"Lotito","sequence":"additional","affiliation":[]},{"given":"Lisandro A.","family":"Parente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,22]]},"reference":[{"issue":"5","key":"2426_CR1","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.3390\/su12052048","volume":"12","author":"S An","year":"2020","unstructured":"An S, Ma L, Wang J (2020) Optimization of traffic detector layout based on complex network theory. Sustainability 12(5):2048. https:\/\/doi.org\/10.3390\/su12052048","journal-title":"Sustainability"},{"key":"2426_CR2","doi-asserted-by":"publisher","unstructured":"Bengio Y (2012) Practical recommendations for gradient-based training of deep architectures. In: Neural networks: tricks of the trade. Springer, pp 437\u2013478. https:\/\/doi.org\/10.1007\/978-3-642-35289-8_26","DOI":"10.1007\/978-3-642-35289-8_26"},{"issue":"1","key":"2426_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10479-006-0016-9","volume":"144","author":"L Bianco","year":"2006","unstructured":"Bianco L, Confessore G, Gentili M (2006) Combinatorial aspects of the sensor location problem. Ann Oper Res 144(1):201\u2013234","journal-title":"Ann Oper Res"},{"key":"2426_CR4","doi-asserted-by":"publisher","unstructured":"Bottou L (2010) Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010. Springer, pp 177\u2013186. https:\/\/doi.org\/10.1007\/978-3-7908-2604-3_16","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"2426_CR5","unstructured":"Chollet F, et\u00a0al (2015) Keras. https:\/\/keras.io"},{"key":"2426_CR6","unstructured":"Chu C, Zhmoginov A, Sandler M (2017) Cyclegan, a master of steganography. arXiv preprint arXiv:1712.02950"},{"issue":"3","key":"2426_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ejor.2003.08.004","volume":"155","author":"E Codina","year":"2004","unstructured":"Codina E, Barcel\u00f3 J (2004) Adjustment of O\u2013D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. Eur J Oper Res 155(3):535\u2013557","journal-title":"Eur J Oper Res"},{"key":"2426_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10479-006-0007-x","volume":"144","author":"E Codina","year":"2006","unstructured":"Codina E, Montero J (2006) Approximation of the steepest descent direction for the O\u2013D matrix adjustment problem. Ann Oper Res 144:329\u2013362","journal-title":"Ann Oper Res"},{"issue":"10","key":"2426_CR9","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.trb.2006.02.008","volume":"40","author":"RB Dial","year":"2006","unstructured":"Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp Res Part B Methodol 40(10):917\u2013936","journal-title":"Transp Res Part B Methodol"},{"key":"2426_CR10","unstructured":"for Research Core\u00a0Team TN (Accessed October, 29, 2021) Transportation networks for research. https:\/\/github.com\/bstabler\/TransportationNetworks"},{"issue":"3","key":"2426_CR11","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1016\/j.ejor.2005.02.029","volume":"175","author":"PA Lotito","year":"2006","unstructured":"Lotito PA (2006) Issues in the implementation of the DSD algorithm for the traffic assignment problem. Eur J Oper Res 175(3):1577\u20131587. https:\/\/doi.org\/10.1016\/j.ejor.2005.02.029","journal-title":"Eur J Oper Res"},{"key":"2426_CR12","doi-asserted-by":"crossref","unstructured":"Lotito P, Mancinelli E, Quadrat JP (2005) Traffic assignment and Gibbs\u2013Maslov semirings. In: Idempotent mathematics and mathematical physics, contemporary mathematics. AMS, pp 209\u2013220","DOI":"10.1090\/conm\/377\/06993"},{"key":"2426_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.trb.2007.09.005","volume":"42","author":"JT Lundgren","year":"2008","unstructured":"Lundgren JT, Petersen A (2008) A heuristic for the bilevel origin-destination-matrix estimation problem. Transp Res B 42:339\u2013354","journal-title":"Transp Res B"},{"issue":"2","key":"2426_CR14","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/trsc.1120.0409","volume":"47","author":"M Mitradjieva","year":"2013","unstructured":"Mitradjieva M, Lindberg PO (2013) The stiff is moving-conjugate direction Frank\u2013Wolfe methods with applications to traffic assignment. Transp Sci 47(2):280\u2013293","journal-title":"Transp Sci"},{"key":"2426_CR15","volume-title":"Modelling transport","author":"J Ort\u00fazar","year":"2001","unstructured":"Ort\u00fazar J, Willumsen L (2001) Modelling transport. Wiley, New York"},{"key":"2426_CR16","doi-asserted-by":"crossref","unstructured":"Owais M (2022) Traffic sensor location problem: three decades of research. Expert Syst Appl 118134","DOI":"10.1016\/j.eswa.2022.118134"},{"issue":"1","key":"2426_CR17","doi-asserted-by":"publisher","first-page":"04019055","DOI":"10.1061\/JTEPBS.0000290","volume":"146","author":"M Owais","year":"2020","unstructured":"Owais M, Moussa GS, Hussain KF (2020) Robust deep learning architecture for traffic flow estimation from a subset of link sensors. J Transp Eng Part A Systems 146(1):04019055","journal-title":"J Transp Eng Part A Systems"},{"issue":"1","key":"2426_CR18","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/trsc.37.1.56.12821","volume":"37","author":"M Patriksson","year":"2003","unstructured":"Patriksson M, Rockafellar RT (2003) Sensitivity analysis of aggregated variational inequality problems, with application to traffic equilibria. Transp Sci 37(1):56\u201368","journal-title":"Transp Sci"},{"key":"2426_CR19","doi-asserted-by":"publisher","unstructured":"Smith LN, Topin N (2019) Super-convergence: very fast training of neural networks using large learning rates. In: Artificial intelligence and machine learning for multi-domain operations applications. SPIE, pp 369\u2013386. https:\/\/doi.org\/10.1117\/12.2520589","DOI":"10.1117\/12.2520589"},{"key":"2426_CR20","unstructured":"Spiess H (1990) A gradient approach for the OD-matrix adjustment problem. CRT Pub No 693, Centre de Recherche sur les Transports"},{"key":"2426_CR21","volume-title":"Optimization of transport networks","author":"PA Steenbrink","year":"1974","unstructured":"Steenbrink PA et al (1974) Optimization of transport networks. Wiley, London"},{"key":"2426_CR22","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2014.11.009","volume":"242","author":"J Walpen","year":"2015","unstructured":"Walpen J, Mancinelli EM, Lotito PA (2015) A heuristic for the OD matrix adjustment problem in a congested transport network. Eur J Oper Res 242:807\u2013819","journal-title":"Eur J Oper Res"},{"key":"2426_CR23","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s40314-020-01189-5","volume":"39","author":"J Walpen","year":"2020","unstructured":"Walpen J, Mancinelli EM, Lotito PA et al (2020) The demand adjustment problem via inexact restoration method. Comput Appl Math 39:204","journal-title":"Comput Appl Math"},{"key":"2426_CR24","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc Inst Civ Eng Part II 1:325\u2013378","journal-title":"Proc Inst Civ Eng Part II"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02426-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02426-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02426-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T05:16:50Z","timestamp":1694409410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02426-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,22]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2426"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02426-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,22]]},"assertion":[{"value":"31 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors report there are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"290"}}