{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T02:53:34Z","timestamp":1785293614602,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,24]],"date-time":"2012-07-24T00:00:00Z","timestamp":1343088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10957-012-0121-7","type":"journal-article","created":{"date-parts":[[2012,7,23]],"date-time":"2012-07-23T19:36:19Z","timestamp":1343072179000},"page":"805-818","source":"Crossref","is-referenced-by-count":12,"title":["Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications"],"prefix":"10.1007","volume":"156","author":[{"given":"Antonio","family":"Polimeni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonino","family":"Vitetta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,7,24]]},"reference":[{"key":"121_CR1","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0191-2615(01)00012-1","volume":"36","author":"C.F. Daganzo","year":"2002","unstructured":"Daganzo, C.F.: Reversibility of the time-dependent shortest path problem. Transp. Res., Part B, Methodol. 36, 665\u2013668 (2002)","journal-title":"Transp. Res., Part B, Methodol."},{"key":"121_CR2","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957), reprinted 2010"},{"key":"121_CR3","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Wilson, New York (1976)"},{"issue":"3","key":"121_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K.L. Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"121_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"121_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I. Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transp. Res. Rec., J. Transp. Res. Board 1645, 170\u2013175 (1998)","journal-title":"Transp. Res. Rec., J. Transp. Res. Board"},{"key":"121_CR7","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1016\/j.cor.2004.11.021","volume":"33","author":"J.F. B\u00e9rub\u00e9","year":"2006","unstructured":"B\u00e9rub\u00e9, J.F., Potvin, J.Y., Vaucher, J.: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. Comput. Oper. Res. 33, 1838\u20131856 (2006)","journal-title":"Comput. Oper. Res."},{"key":"121_CR8","unstructured":"Dean, B.C.: Continuous-time shortest path algorithm. M.S. thesis Massachusetts Institute of Technology (1999)"},{"key":"121_CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s00453-010-9461-6","volume":"62","author":"F. Dehne","year":"2012","unstructured":"Dehne, F., Omran, M.T., Sack, J.R.: Shortest paths in time-dependent FIFO networks. Algorithmica 62, 416\u2013435 (2012)","journal-title":"Algorithmica"},{"key":"121_CR10","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.orl.2008.07.003","volume":"36","author":"K.N. Androutsopoulos","year":"2008","unstructured":"Androutsopoulos, K.N., Zografos, K.G.: Solving the k-shortest path problem with time windows in a time varying network. Oper. Res. Lett. 36, 692\u2013695 (2008)","journal-title":"Oper. Res. Lett."},{"key":"121_CR11","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37, 607\u2013625 (1990)","journal-title":"J. ACM"},{"key":"121_CR12","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1016\/j.orl.2008.07.002","volume":"36","author":"M. Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico, M., Iori, M., Pretolani, D.: Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36, 688\u2013691 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"121_CR13","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"R.W. Hall","year":"1986","unstructured":"Hall, R.W.: The fastest path through a network with random time-dependent travel times. Transp. Sci. 20(3), 182\u2013188 (1986)","journal-title":"Transp. Sci."},{"key":"121_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.10072","volume":"4","author":"R.K. Ahuja","year":"2003","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutell\u00e0, M.G.: Dynamic shortest paths minimizing travel times and costs. Networks 4, 197\u2013205 (2003)","journal-title":"Networks"},{"issue":"12","key":"121_CR15","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1016\/S0305-0548(98)00027-6","volume":"25","author":"E.D. Miller-Hooks","year":"1998","unstructured":"Miller-Hooks, E.D., Mahmassani, H.S.: Least possible time paths in stochastic, time-varying networks. Comput. Oper. Res. 25(12), 1107\u20131125 (1998)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"121_CR16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/trsc.34.2.198.12304","volume":"34","author":"E.D. Miller-Hooks","year":"2000","unstructured":"Miller-Hooks, E.D., Mahmassani, H.S.: Least expected time paths in stochastic, time-varying transportation networks. Transp. Sci. 34(2), 198\u2013215 (2000)","journal-title":"Transp. Sci."},{"key":"121_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0968-090X(03)00029-9","volume":"11","author":"P. Pattanamekar","year":"2003","unstructured":"Pattanamekar, P., Park, D., Rilett, L.R., Lee, J., Lee, C.: Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty. Transp. Res. Part C 11, 331\u2013354 (2003)","journal-title":"Transp. Res. Part C"},{"key":"121_CR18","unstructured":"Laporte, G.: What you should know about the Vehicle Routing Problem, [on line] (2007). Available from: www.gerad.ca\/en\/publications . Accessed 8 July 2011"},{"issue":"1","key":"121_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"4","key":"121_CR20","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a Dynamic Vehicle Routing Problem. J. Comb. Optim. 10(4), 327\u2013343 (2005)","journal-title":"J. Comb. Optim."},{"key":"121_CR21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"F.T. Hanshar","year":"2007","unstructured":"Hanshar, F.T., Ombuki-Berman, B.M.: Dynamic vehicle routing using genetic algorithms. Appl. Intell. 27, 89\u201399 (2007)","journal-title":"Appl. Intell."},{"key":"121_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.trc.2004.07.007","volume":"12","author":"E. Taniguchi","year":"2006","unstructured":"Taniguchi, E., Shimamoto, H.: Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transp. Res. Part C 12, 235\u2013250 (2006)","journal-title":"Transp. Res. Part C"},{"key":"121_CR23","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s11067-006-9285-8","volume":"6","author":"N. Ando","year":"2006","unstructured":"Ando, N., Taniguchi, E.: Travel time reliability in vehicle routing and scheduling with time windows. Netw. Spat. Econ. 6, 293\u2013311 (2006)","journal-title":"Netw. Spat. Econ."},{"issue":"7","key":"121_CR24","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1080\/17415977.2011.565339","volume":"19","author":"F. Russo","year":"2011","unstructured":"Russo, F., Vitetta, A.: Reverse assignment: Calibrating link cost functions and updating demand from traffic counts and time measurements. Inverse Probl. Sci. Eng. 19(7), 921\u2013950 (2011)","journal-title":"Inverse Probl. Sci. Eng."},{"issue":"3","key":"121_CR25","first-page":"3","volume":"46","author":"A. Polimeni","year":"2010","unstructured":"Polimeni, A., Russo, F., Vitetta, A.: Goods movement simulation in urban areas: a proposed approach. Eur. Transp.\/Transp. Eur. 46(3), 3\u201323 (2010)","journal-title":"Eur. Transp.\/Transp. Eur."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0121-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0121-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0121-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:17Z","timestamp":1559469317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0121-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,24]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0121-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,24]]}}}