{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T19:32:51Z","timestamp":1721503971816},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T00:00:00Z","timestamp":1615075200000},"content-version":"am","delay-in-days":249,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI 1520338"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.cor.2020.104929","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T02:53:21Z","timestamp":1582167201000},"page":"104929","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["An optimal control approach to day-to-day congestion pricing for stochastic transportation networks"],"prefix":"10.1016","volume":"119","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1356-2390","authenticated-orcid":false,"given":"Hemant","family":"Gehlot","sequence":"first","affiliation":[]},{"given":"Harsha","family":"Honnappa","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8754-9925","authenticated-orcid":false,"given":"Satish V.","family":"Ukkusuri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3-NaN-2","key":"10.1016\/j.cor.2020.104929_bib0001","doi-asserted-by":"crossref","first-page":"S183","DOI":"10.1287\/opre.40.3.S183","article-title":"Rolling horizon procedures in nonhomogeneous Markov decision processes","volume":"40","author":"Alden","year":"1992","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0002","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/moor.19.1.169","article-title":"Denumerable constrained Markov decision processes and finite approximations","volume":"19","author":"Altman","year":"1994","journal-title":"Math. Operat. Res."},{"issue":"5","key":"10.1016\/j.cor.2020.104929_bib0003","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0167-6377(99)00015-2","article-title":"The value iteration method for countable state Markov decision processes","volume":"24","author":"Aviv","year":"1999","journal-title":"Operat. Res. Lett."},{"key":"10.1016\/j.cor.2020.104929_bib0004","series-title":"Dynamic programming and optimal control","author":"Bertsekas","year":"2012"},{"key":"10.1016\/j.cor.2020.104929_bib0005","article-title":"Weighted sup-norm contractions in dynamic programming: a review and some new applications","author":"Bertsekas","year":"2012","journal-title":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA, Tech. Rep. LIDS-P-2884"},{"key":"10.1016\/j.cor.2020.104929_bib0006","series-title":"Transportation Research Board 91st Annual Meeting TRB, Washington DC, United States, 26th January","article-title":"Quasi-dynamic network loading: adding queuing and spillback to static traffic assignment","author":"Bliemer","year":"2012"},{"key":"10.1016\/j.cor.2020.104929_bib0007","series-title":"Perturbation analysis of optimization problems","author":"Bonnans","year":"2013"},{"issue":"10","key":"10.1016\/j.cor.2020.104929_bib0008","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1016\/j.automatica.2005.04.017","article-title":"Dynamic programming for constrained optimal control of discrete-time linear hybrid systems","volume":"41","author":"Borrelli","year":"2005","journal-title":"Automatica"},{"key":"10.1016\/j.cor.2020.104929_bib0009","unstructured":"Bowerman, B. L., 1974. Nonstationary markov decision processes and related topics in nonstationary Markov chains."},{"issue":"3","key":"10.1016\/j.cor.2020.104929_bib0010","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0191-2607(81)90003-0","article-title":"The effect on equilibrium trip assignment of different link congestion functions","volume":"15","author":"Boyce","year":"1981","journal-title":"Transportation Research Part A: General"},{"key":"10.1016\/j.cor.2020.104929_bib0011","series-title":"Markov chains: Gibbs fields, Monte Carlo simulation, and queues","volume":"31","author":"Br\u00e9maud","year":"2013"},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0012","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s13676-014-0073-1","article-title":"Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete-and continuous-time models","volume":"5","author":"Cantarella","year":"2016","journal-title":"EURO J. Transp. Logist."},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0013","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01442225","article-title":"Finite-state approximations for denumerable state discounted Markov decision processes","volume":"14","author":"Cavazos-Cadena","year":"1986","journal-title":"Appl. Math. Optim."},{"issue":"sup1","key":"10.1016\/j.cor.2020.104929_bib0014","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/12265934.2016.1227275","article-title":"Urban dynamic congestion pricing: an overview and emerging research needs","volume":"21","author":"Cheng","year":"2017","journal-title":"Int. J. Urban Sci."},{"issue":"2","key":"10.1016\/j.cor.2020.104929_bib0015","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.trb.2003.10.006","article-title":"Modelling network travel time reliability under stochastic demand","volume":"39","author":"Clark","year":"2005","journal-title":"Transp. Res. Part B Methodol."},{"key":"10.1016\/j.cor.2020.104929_bib0016","article-title":"Optimization toolbox","author":"Coleman","year":"1999","journal-title":"For Use with MATLAB. Users Guide for MATLAB 5, Version 2, Relaese II"},{"issue":"6","key":"10.1016\/j.cor.2020.104929_bib0017","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/j.trc.2011.02.010","article-title":"Traffic congestion pricing methodologies and technologies","volume":"19","author":"De Palma","year":"2011","journal-title":"Transp. Res. Part C Emerg.Tech."},{"issue":"2","key":"10.1016\/j.cor.2020.104929_bib0018","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/B:NETS.0000027772.43771.94","article-title":"Dynamic congestion pricing in disequilibrium","volume":"4","author":"Friesz","year":"2004","journal-title":"Netw. Spat. Econ."},{"issue":"2","key":"10.1016\/j.cor.2020.104929_bib0019","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.trb.2005.02.001","article-title":"Optimal routing policy problems in stochastic time-dependent networks","volume":"40","author":"Gao","year":"2006","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0020","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1080\/21680566.2018.1540952","article-title":"User equilibrium with a policy-based link transmission model for stochastic time-dependent traffic networks","volume":"7","author":"Gehlot","year":"2019","journal-title":"Transportmetrica B Transp. Dyn."},{"issue":"2","key":"10.1016\/j.cor.2020.104929_bib0021","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1287\/opre.1120.1121","article-title":"A linear programming approach to nonstationary infinite-horizon Markov decision processes","volume":"61","author":"Ghate","year":"2013","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2020.104929_bib0022","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1287\/trsc.2015.0596","article-title":"Day-to-day flow dynamics and congestion control","volume":"50","author":"Guo","year":"2015","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2020.104929_bib0023","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2017.06.006","article-title":"Discrete-time day-to-day dynamic congestion pricing scheme considering multiple equilibria","volume":"104","author":"Han","year":"2017","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1\u20132","key":"10.1016\/j.cor.2020.104929_bib0024","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/s10955-012-0645-0","article-title":"Spatiotemporal patterns of urban human mobility","volume":"151","author":"Hasan","year":"2013","journal-title":"J. Stat. Phys."},{"key":"10.1016\/j.cor.2020.104929_bib0025","article-title":"Users guide for Tomlab 7","author":"Holmstr\u00f6m","year":"2010","journal-title":"Tomlab Optimization Inc"},{"key":"10.1016\/j.cor.2020.104929_bib0026","series-title":"A first course in stochastic processes","author":"Karlin","year":"2014"},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0027","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0191-2615(84)90007-9","article-title":"Incorporating trip chaining into analysis of destination choice","volume":"18","author":"Kitamura","year":"1984","journal-title":"Transp. Res. Part B Methodol."},{"issue":"12","key":"10.1016\/j.cor.2020.104929_bib0028","doi-asserted-by":"crossref","first-page":"1663","DOI":"10.1109\/9.650016","article-title":"The policy iteration algorithm for average reward Markov decision processes with general state space","volume":"42","author":"Meyn","year":"1997","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"3","key":"10.1016\/j.cor.2020.104929_bib0029","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1005248204428","article-title":"Distance and time based road pricing trial in dublin","volume":"27","author":"O\u2019Mahony","year":"2000","journal-title":"Transportation (Amst)"},{"key":"10.1016\/j.cor.2020.104929_bib0030","unstructured":"Pascale, J., 2019. Should d.c. toll streets during peak traffic periods? council wants to study \u2019congestion pricing\u2019."},{"key":"10.1016\/j.cor.2020.104929_bib0031","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.trb.2017.06.002","article-title":"A stochastic optimal control approach for real-time traffic routing considering demand uncertainties and travelers choice heterogeneity","volume":"104","author":"Pi","year":"2017","journal-title":"Transp. Res. Part B Methodol."},{"key":"10.1016\/j.cor.2020.104929_bib0032","series-title":"Markov decision processes: Discrete stochastic dynamic programming","author":"Puterman","year":"2014"},{"key":"10.1016\/j.cor.2020.104929_bib0033","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.trb.2016.01.008","article-title":"Dynamic pricing in discrete time stochastic day-to-day route choice models","volume":"92","author":"Rambha","year":"2016","journal-title":"Transp. Res. Part B Methodol."},{"issue":"3","key":"10.1016\/j.cor.2020.104929_bib0034","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1111\/1467-937X.t01-1-00026","article-title":"Evolutionary implementation and congestion pricing","volume":"69","author":"Sandholm","year":"2002","journal-title":"Rev. Econ. Stud."},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0035","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0264-2751(99)00050-5","article-title":"An advanced demand management instrument in urban transport: electronic road pricing in singapore","volume":"17","author":"Seik","year":"2000","journal-title":"Cities"},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0036","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02055585","article-title":"Value iteration in countable state average cost Markov decision processes with unbounded costs","volume":"28","author":"Sennott","year":"1991","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2020.104929_bib0037","unstructured":"Sheffi, Y., 1985. Urban transportation networks."},{"issue":"5968","key":"10.1016\/j.cor.2020.104929_bib0038","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1126\/science.1177170","article-title":"Limits of predictability in human mobility","volume":"327","author":"Song","year":"2010","journal-title":"Science"},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0039","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1177\/0361198106196400110","article-title":"Reliable network design problem: case with uncertain demand and total travel time reliability","volume":"1964","author":"Sumalee","year":"2006","journal-title":"Transp. Res. Rec."},{"key":"10.1016\/j.cor.2020.104929_bib0040","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.trc.2012.07.007","article-title":"A statistical approach to estimating acceptance of electric vehicles and electrification of personal transportation","volume":"26","author":"Tamor","year":"2013","journal-title":"Transp. Res. Part C Emerg.Tech."},{"key":"10.1016\/j.cor.2020.104929_bib0041","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.trc.2015.10.013","article-title":"Dynamic congestion pricing with day-to-day flow evolution and user heterogeneity","volume":"61","author":"Tan","year":"2015","journal-title":"Transp. Res. Part C Emerg.Tech."},{"issue":"4","key":"10.1016\/j.cor.2020.104929_bib0042","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/T-C.1974.223961","article-title":"Two algorithms for piecewise-linear continuous approximation of functions of one variable","volume":"100","author":"Tomek","year":"1974","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/j.cor.2020.104929_bib0043","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1016\/j.trb.2012.07.010","article-title":"Dynamic user equilibrium with a path based cell transmission model for general traffic networks","volume":"46","author":"Ukkusuri","year":"2012","journal-title":"Transp. Res. Part B Methodol."},{"issue":"9","key":"10.1016\/j.cor.2020.104929_bib0044","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1080\/23249935.2015.1087234","article-title":"Day-to-day congestion pricing and network resilience","volume":"11","author":"Wang","year":"2015","journal-title":"Transportmetrica A Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2020.104929_bib0045","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1007\/s11067-013-9198-2","article-title":"Model representation & decision-making in an ever-changing world: the role of stochastic process models of transportation systems","volume":"15","author":"Watling","year":"2015","journal-title":"Netw. Spat. Econ."},{"issue":"100","key":"10.1016\/j.cor.2020.104929_bib0046","doi-asserted-by":"crossref","first-page":"20140834","DOI":"10.1098\/rsif.2014.0834","article-title":"Universal predictability of mobility patterns in cities","volume":"11","author":"Yan","year":"2014","journal-title":"J. R. Soc. Interface"},{"issue":"1","key":"10.1016\/j.cor.2020.104929_bib0047","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3141\/2039-10","article-title":"Steepest descent day-to-day dynamic toll","volume":"2039","author":"Yang","year":"2007","journal-title":"Transp. Res. Rec."},{"key":"10.1016\/j.cor.2020.104929_bib0048","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.trpro.2015.06.019","article-title":"Learning marginal-cost pricing via trial-and-error procedure with day-to-day flow dynamics","volume":"7","author":"Ye","year":"2015","journal-title":"Transp. Res. Procedia"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300460?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820300460?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T13:07:39Z","timestamp":1618664859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054820300460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":48,"alternative-id":["S0305054820300460"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2020.104929","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An optimal control approach to day-to-day congestion pricing for stochastic transportation networks","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2020.104929","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104929"}}