{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:53Z","timestamp":1759847573571},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,9,6]],"date-time":"2006-09-06T00:00:00Z","timestamp":1157500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,9,6]],"date-time":"2006-09-06T00:00:00Z","timestamp":1157500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/s10898-006-9082-4","type":"journal-article","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T08:47:06Z","timestamp":1157446026000},"page":"41-60","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum"],"prefix":"10.1007","volume":"38","author":[{"given":"Artyom","family":"Nahapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siriphong","family":"Lawphongpanich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,6]]},"reference":[{"key":"9082_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja R., Magnanti T., Orlin J. (1993). Network Flows. Prentice Hall, Englewood Cliffs, NJ"},{"key":"9082_CR2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/trsc.29.2.128","volume":"29","author":"D. Boyce","year":"1995","unstructured":"Boyce D., Ran B., LeBlanc L. (1995). Solving an instantaneous dynamic user-optimal route choice model. Transport. Sci. 29:128\u2013142","journal-title":"Transport. Sci."},{"key":"9082_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4757-6871-8_4","volume-title":"Transportation and Analysis: Current Trends","author":"L. Brotcorne","year":"2002","unstructured":"Brotcorne L., De Wolf D., Gendreau M., Labb\u00e9 M. (2002) A dynamic user equilibrium model for traffic assignment in urban areas. In: Gendreau M., Marcotte P. (eds) Transportation and Analysis: Current Trends. Kluwer Academic Publishers, Norwell, MA, pp. 49\u201369"},{"issue":"1","key":"9082_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.35.1.58","volume":"35","author":"M. Carey","year":"1987","unstructured":"Carey M. (1987). Optimal time-varying flow on congested network. Oper. Res. 35(1):58\u201369","journal-title":"Oper. Res."},{"key":"9082_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1012848329399","volume":"1","author":"M. Carey","year":"2001","unstructured":"Carey M. (2001). Dynamic traffic assignment with more flexible modelling within links. Netw. Spatial Econ. 1:349\u2013375","journal-title":"Netw. Spatial Econ."},{"key":"9082_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/B:NETS.0000039782.48154.ef","volume":"4","author":"M. Carey","year":"2004","unstructured":"Carey M. (2004). Link travel times I: desirable properties. Netw. Spatial Econ. 4:257\u2013268","journal-title":"Netw. Spatial Econ."},{"key":"9082_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/B:NETS.0000039783.57975.f0","volume":"4","author":"M. Carey","year":"2004","unstructured":"Carey M. (2004). Efficient discretisation for link travel time models. Netw. Spatial Econ. 4:269\u2013290","journal-title":"Netw. Spatial Econ."},{"key":"9082_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0191-2615(00)00039-4","volume":"36","author":"M. Carey","year":"2002","unstructured":"Carey M., McCartney M. (2002). Behaviour of a whole-link travel time model used in dynamic traffic assignment. Transport. Res. B 36:83\u201395","journal-title":"Transport. Res. B"},{"issue":"1","key":"9082_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/trsc.37.1.83.12819","volume":"37","author":"M. Carey","year":"2003","unstructured":"Carey M., Ge Y., McCartney M. (2003). A whole-link travel-time model with desirable properties. Transport. Sci. 37(1):83\u201396","journal-title":"Transport. Sci."},{"issue":"1","key":"9082_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1287\/trsc.1030.0083","volume":"39","author":"M. Carey","year":"2005","unstructured":"Carey M., Ge Y. (2005). Convergence of a discretised travel-time model. Transport. Sci. 39(1):25\u201338","journal-title":"Transport. Sci."},{"key":"9082_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(94)90191-0","volume":"75","author":"M. Carey","year":"1994","unstructured":"Carey M., Srinivasan A. (1994). Solving a class of network models for dynamic flow control. Eur. J. Oper. Res. 75:151\u2013170","journal-title":"Eur. J. Oper. Res."},{"key":"9082_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0191-2615(99)00019-3","volume":"34","author":"M. Carey","year":"2000","unstructured":"Carey M., Subrahmanian E. (2000). An approach to modelling time-varing flows on congested networks. Transport. Res. B 34:157\u2013183","journal-title":"Transport. Res. B"},{"issue":"3","key":"9082_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0006-8993(97)01348-6","volume":"32","author":"H. Chen","year":"1998","unstructured":"Chen H., Hsueh C. (1998). A model and an algorithm for the dynamic user-optimal route choice Transport. Res. B 32(3):219\u2013234","journal-title":"Res. B"},{"key":"9082_CR14","unstructured":"CONOPT Solver: ARKI Consulting and Development A\/S, Bagsvaerdvej 246 A, DK-2880 , Denmark, Phone +45 44 49 03 23, Fax +45 44 49 03 33, E-mail info@arki.dk."},{"key":"9082_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0191-2615(94)00026-V","volume":"29","author":"C. Daganzo","year":"1995","unstructured":"Daganzo C. (1995). Properties of link travel time function under dynamic loading. Transport. Res. B 29:95\u201398","journal-title":"Transport. Res. B"},{"issue":"2","key":"9082_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.26.2.119","volume":"26","author":"O. Drissi-Kaitouni","year":"1992","unstructured":"Drissi-Kaitouni O., Hameda-Benchekroun A. (1992). A dynamic traffic assignment model and a algorithm. Transport. Sci. 26(2):119\u2013128","journal-title":"Transport. Sci."},{"issue":"6","key":"9082_CR17","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1287\/opre.37.6.893","volume":"37","author":"T. Friesz","year":"1989","unstructured":"Friesz T., Bernstein D., Mehta N., Tobin R., Ganjalizadeh S. (1989). Dynamic network assignment considered as a continuous time optimal control problem. Oper. Res. 37(6):893\u2013901","journal-title":"Oper. Res."},{"issue":"1","key":"9082_CR18","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.41.1.179","volume":"41","author":"T. Friesz","year":"1993","unstructured":"Friesz T., Bernstein D., Smith T., Tobin R., Wie B. (1993). A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1):178\u2013191","journal-title":"Oper. Res."},{"key":"9082_CR19","unstructured":"GAMS Development Corporation, 1217 Potomac Street, NW, Washington, DC 20007, USA, Phone: (202) 342\u20130180, Fax: (202) 342\u20130181."},{"key":"9082_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0191-2615(99)00018-1","volume":"34","author":"A. Garcia","year":"2000","unstructured":"Garcia A., Reaume D., Smith R.l. (2000). Fictitious play for finding system optimal routing in dynamic traffic networks. Transport. Res. B 34:147\u2013156","journal-title":"Transport. Res. B"},{"key":"9082_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.trb.2005.01.002","volume":"40","author":"S. Han","year":"2006","unstructured":"Han S., Heydecker B. (2006). Consistent objective and solution of dynamic user equilibrium models. Transport. Res. B 40:16\u201334","journal-title":"Transport. Res. B"},{"key":"9082_CR22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/trsc.14.4.295","volume":"14","author":"J. Ho","year":"1980","unstructured":"Ho J. (1980). A successive linear optimization approach to the dynamic traffic assignment problem. Transport. Sci. 14:295\u2013305","journal-title":"Transport. Sci."},{"key":"9082_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0191-2615(91)90020-J","volume":"25","author":"B.N. Janson","year":"1991","unstructured":"Janson B.N. (1991). Dynamic traffic assignment for urban road network. Transport. Res. B 25:143\u2013161","journal-title":"Transport. Res. B"},{"key":"9082_CR24","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0191-2615(98)00013-7","volume":"32","author":"D.E. Kaufman","year":"1998","unstructured":"Kaufman D.E., Nonis J., Smith R.L. (1998). A mixed integer linear programming model for dynamic route guidance. Transport. Res. B 32:431\u2013440","journal-title":"Transport. Res. B"},{"key":"9082_CR25","unstructured":"Lieberman, E.B.: An advance approach to meeting saturated flow requirements. In: Proceeding of the 72nd Annual Transportation Research Board Meeting, Washington, DC (1993)"},{"key":"9082_CR26","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/A:1027310021084","volume":"3","author":"W. Li","year":"2003","unstructured":"Li W., Waller S.T., Ziliaskopoulos A.K. (2003). A decomposition scheme for system optimal dynamic traffic assignment models. Netw. Spatial Econ. 3:441\u2013455","journal-title":"Netw. Spatial Econ."},{"key":"9082_CR27","first-page":"281","volume":"229","author":"M. Lighthill","year":"1955","unstructured":"Lighthill M., Whitham G. (1955). On kinematic waves I: flow movement in long rivers and on kinematic waves II: a theory of traffic flow on long crowded roads. Proc. R. Soc. A 229:281\u2013345","journal-title":"Proc. R. Soc. A"},{"key":"9082_CR28","first-page":"137","volume":"34","author":"W. Lin","year":"2000","unstructured":"Lin W., Lo H. (2000). Are the objective and solutions of dynamic user-equilibrium models always consistent?. Transport. Res. A 34:137\u2013144","journal-title":"Transport. Res. A"},{"issue":"3","key":"9082_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.12.3.183","volume":"12","author":"D.K. Merchant","year":"1978","unstructured":"Merchant D.K., Nemhauser G.L. (1978). A model and an algorithm for the dynamic traffic assignment problems. Transport. Sci. 12(3):183\u2013199","journal-title":"Transport. Sci."},{"issue":"3","key":"9082_CR30","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/trsc.12.3.200","volume":"12","author":"D.K. Merchant","year":"1978","unstructured":"Merchant D.K., Nemhauser G.L. (1978). Optimality conditions for dynamic traffic assigment problem. Transport. Sci. 12(3):200\u2013207","journal-title":"Transport. Sci."},{"key":"9082_CR31","unstructured":"NEOS Server of Optimization, Technical Report 97\/04, Optimization Technology Center, National Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439, 1997."},{"key":"9082_CR32","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1012827724856","volume":"1","author":"S. Peeta","year":"2001","unstructured":"Peeta S., Ziliaskopoulos A. (2001). Foundations of dynamic traffic assignment: the past, the present and the future. Netw. Spec. Econ. 1:233\u2013265","journal-title":"Netw. Spec. Econ."},{"key":"9082_CR33","volume-title":"An analytical model for traffic delays and the dynamic user equilibrium models","author":"G. Perakis","year":"2004","unstructured":"Perakis G., Roels G. (2004). An analytical model for traffic delays and the dynamic user equilibrium models. Techical Report, OR-368-04, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA"},{"issue":"1","key":"9082_CR34","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.41.1.192","volume":"41","author":"B. Ran","year":"1993","unstructured":"Ran B., Boyce D., LeBlanc L. (1993). A new class of instantaneous dynamic user-optimal traffic models. Oper. Res. 41(1):192\u2013202","journal-title":"Oper. Res."},{"key":"9082_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modeling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran B., Boyce D. (1996). Modeling Dynamic Transportation Networks. Springer, Berlin"},{"issue":"1","key":"9082_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0968-090X(95)00017-D","volume":"4","author":"B. Ran","year":"1996","unstructured":"Ran B., Boyce D. (1996). A link-based variational inequality formulation for ideal dynamic user-optimal route choice problem. Transport. Res. C 4(1):1\u201312","journal-title":"Transport. Res. C"},{"issue":"1","key":"9082_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0191-2615(95)00010-0","volume":"30","author":"B. Ran","year":"1996","unstructured":"Ran B., Hall R., Boyce D. (1996). A link-based variational inequality model for dynamic departure time\/route choice. Transport. Res. B 30(1):31\u201346","journal-title":"Transport. Res. B"},{"key":"9082_CR38","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/opre.4.1.42","volume":"4","author":"P. Richards","year":"1956","unstructured":"Richards P. (1956). Shock waves on the highway. Oper. Res. 4:42\u201351","journal-title":"Oper. Res."},{"key":"9082_CR39","unstructured":"SBB Solver, ARKI Consulting and Development A\/S, Bagsvaerdvej 246 A, DK-2880 Bagsvaerd, Denmark, Phone +45 44 49 03 23, Fax +45 44 49 03 33, E-mail info@arki.dk."},{"issue":"1","key":"9082_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0191-2615(93)90011-X","volume":"27","author":"M. Smith","year":"1993","unstructured":"Smith M. (1993). A new dynamic traffic model and the existence and calculation of dynamic user on congested capacity-constrained road network. Transport. Res. B 27(1):49\u201363","journal-title":"Transport. Res. B"},{"issue":"1","key":"9082_CR41","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/trsc.29.1.79","volume":"29","author":"B. Wie","year":"1995","unstructured":"Wie B., Tobin R., Friesz T., Bernstein D. (1995). A discrete time, nested cost operator approach to the dynamic network user equilibrium problem. Transport. Sci. 29(1):79\u201392","journal-title":"Transport. Sci."},{"key":"9082_CR42","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/S0191-2615(01)00041-8","volume":"36","author":"B. Wie","year":"2002","unstructured":"Wie B., Tobin R., Carey M. (2002). The existence, uniqueness and computation of an arc based dynamic network user equilibrium formulation. Transport. Res. B 36:897\u2013928","journal-title":"Transport. Res. B"},{"issue":"3","key":"9082_CR43","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0191-2615(97)00023-4","volume":"32","author":"J. Wu","year":"1997","unstructured":"Wu J., Chen Y., Florian M. (1997). The continuous dynamic network loading problem: a mathematical fromulation and solutions methods. Transport. Res. B 32(3):173\u2013187","journal-title":"Transport. Res. B"},{"key":"9082_CR44","unstructured":"XPress Solver, Dash Optimization Inc, 560 Sylvan Avenue, Englewood Cliffs, NJ 07632, USA, Phone 201 567 9445, Fax 201 567 9443, E-mail info@dashoptimization.com."},{"issue":"4","key":"9082_CR45","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/trsc.34.4.402.12322","volume":"34","author":"D. Zhu","year":"2000","unstructured":"Zhu D., Marcotte P. (2000). On the existence of solutions to the dynamic user equilibrium problem. Transport. Sci. 34(4):402\u2013414","journal-title":"Transport. Sci."},{"issue":"1","key":"9082_CR46","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.34.1.37.12281","volume":"34","author":"A. Ziliaskopoulos","year":"2000","unstructured":"Ziliaskopoulos A. (2000). A linear programming model for a single destination system optimum dynamic traffic assignment problem. Transport. Sci. 34(1):37\u201349","journal-title":"Transport. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9082-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-006-9082-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9082-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9082-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T18:21:01Z","timestamp":1652811661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-006-9082-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,6]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["9082"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9082-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,6]]},"assertion":[{"value":"28 July 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}