{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:57:03Z","timestamp":1743004623871,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030535513"},{"type":"electronic","value":"9783030535520"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53552-0_9","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"68-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Travel Times Equilibration Procedure for Route-Flow Traffic Assignment Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6634-1313","authenticated-orcid":false,"given":"Alexander","family":"Krylatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6240-177X","authenticated-orcid":false,"given":"Anastasiya","family":"Raevskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"issue":"8\u20139","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.trb.2009.11.004","volume":"44","author":"H Bar-Gera","year":"2010","unstructured":"Bar-Gera, H.: Traffic assignment by paired alternative segments. Transp. Res. Part B 44(8\u20139), 1022\u201346 (2010)","journal-title":"Transp. Res. Part B"},{"key":"9_CR2","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"6","key":"9_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/0191-2615(81)90026-6","volume":"15","author":"S Devarajan","year":"1981","unstructured":"Devarajan, S.: A note on network equilibrium and noncooperative games. Transp. Res. Part B 15(6), 421\u2013426 (1981)","journal-title":"Transp. Res. Part B"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.trb.2006.02.008","volume":"40","author":"R Dial","year":"2006","unstructured":"Dial, R.: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp. Res. Part B 40, 917\u2013936 (2006)","journal-title":"Transp. Res. Part B"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cor.2018.11.004","volume":"103","author":"A Galligari","year":"2019","unstructured":"Galligari, A., Sciandrone, M.: A computational study of path-based mathods for optimal traffic assignment with both inelastic and elastic demand. Comput. Oper. Res. 103, 158\u2013166 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1134\/S1990478916020095","volume":"10","author":"AY Krylatov","year":"2016","unstructured":"Krylatov, A.Y.: Network flow assignment as a fixed point problem. J. Appl. Ind. Math. 10(2), 243\u2013256 (2016). \nhttps:\/\/doi.org\/10.1134\/S1990478916020095","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1134\/S199047891801009X","volume":"12","author":"A Krylatov","year":"2018","unstructured":"Krylatov, A.: Reduction of a minimization problem for a convex separable function with linear constraints to a fixed point problem. J. Appl. Ind. Math. 12(1), 98\u2013111 (2018)","journal-title":"J. Appl. Ind. Math."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-69404-7_29","volume":"10556","author":"A Krylatov","year":"2017","unstructured":"Krylatov, A., Shirokolobova, A.: Projection approach versus gradient descent for network\u2019s flows assignment problem. Lect. Notes Comput. Sci. 10556, 345\u2013350 (2017)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9_CR10","unstructured":"LeBlanc, L.: Mathematical programming algorithms for large scale network equilibrium and network design problem. Northwestern University, Department of Industrial Engineering and Management Science (1973)"},{"key":"9_CR11","first-page":"7","volume":"19","author":"M Lupi","year":"1985","unstructured":"Lupi, M.: Convergence of the Frank-Wolfe algorithm in transportation networks. Civ. Eng. Syst. 19, 7\u201315 (1985)","journal-title":"Civ. Eng. Syst."},{"key":"9_CR12","unstructured":"Nguyen, S.: A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138, D\u00e9partment d\u2019Informatique et de Recherche Op\u00e9rationelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1973)"},{"key":"9_CR13","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M Patriksson","year":"1994","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht (1994)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cor.2014.08.024","volume":"54","author":"O Perederieieva","year":"2015","unstructured":"Perederieieva, O., Ehrgott, M., Raith, A., Wang, J.: A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54, 90\u2013107 (2015)","journal-title":"Comput. Oper. Res."},{"key":"9_CR15","first-page":"325","volume":"2","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 2, 325\u2013378 (1952)","journal-title":"Proc. Inst. Civ. Eng."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:55:17Z","timestamp":1595004917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}