Gradient Projection Method for Simulation-Based Dynamic Traffic Assignment
A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction algorithm that operates directly in the space of path flows. The algorithm was applied to a simulation-based model for dynamic traffic assignment tha...
Saved in:
| Published in | Transportation research record Vol. 2284; no. 1; pp. 70 - 80 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Los Angeles, CA
SAGE Publications
01.01.2012
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0361-1981 2169-4052 |
| DOI | 10.3141/2284-09 |
Cover
| Abstract | A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction algorithm that operates directly in the space of path flows. The algorithm was applied to a simulation-based model for dynamic traffic assignment that used microscopic simulation for supply-side modeling. The formulation used link cost functions that were separate for moving and queuing vehicles on each link, so that the formulation could effectively capture the effects of traffic dynamic characteristics on each group, especially in arterial networks. The model and solution algorithm were applied to a small real-world network, and the performance was studied. The gradient projection algorithm avoided the problem of convergence to nonoptimal conditions shown by the prevalent method of successive averages and demonstrated significantly faster convergence. |
|---|---|
| AbstractList | A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction algorithm that operates directly in the space of path flows. The algorithm was applied to a simulation-based model for dynamic traffic assignment that used microscopic simulation for supply-side modeling. The formulation used link cost functions that were separate for moving and queuing vehicles on each link, so that the formulation could effectively capture the effects of traffic dynamic characteristics on each group, especially in arterial networks. The model and solution algorithm were applied to a small real-world network, and the performance was studied. The gradient projection algorithm avoided the problem of convergence to nonoptimal conditions shown by the prevalent method of successive averages and demonstrated significantly faster convergence. |
| Author | Yang, Inchul Jayakrishnan, R. |
| Author_xml | – sequence: 1 givenname: Inchul surname: Yang fullname: Yang, Inchul – sequence: 2 givenname: R. surname: Jayakrishnan fullname: Jayakrishnan, R. |
| BookMark | eNptkE1LwzAAhoMoOOfwL_Qg6CWar7bpcU6dykTBeQ5pPmZGm8ykPezf2zlP6umFl4cH3vcEHPrgDQBnGF1RzPA1IZxBVB2AEcFFBRnKySEYIVpgiCuOj8EkJVcjxqqCsZKMwNM8Su2M77LXGNZGdS747Nl0H0FnNsTszbV9I3ctvJHJ6Ox262XrVLaM0tohp4Nw5dvBcAqOrGySmfzkGLzf3y1nD3DxMn-cTRdQUZx3kJhClYhLzFWt85Lbqi4JR7i2pdW01phrpmUulUKs1iQ3MreEakytwnbo6Rhc7r2bGD57kzrRuqRM00hvQp8EJpwWOcWIDijcoyqGlKKxQrnue00XpWsERmJ3m9jdJlA18Be_-E10rYzbf8jzPZnkyoh16KMfNv_BvgC3EHme |
| CitedBy_id | crossref_primary_10_1016_j_trb_2016_02_005 crossref_primary_10_3141_2667_11 crossref_primary_10_1002_atr_1359 crossref_primary_10_1016_j_trc_2015_09_003 crossref_primary_10_1155_2021_8815653 crossref_primary_10_1080_15472450_2022_2084337 crossref_primary_10_1016_j_procs_2024_06_092 crossref_primary_10_9728_dcs_2019_20_7_1285 crossref_primary_10_1007_s11067_014_9242_x crossref_primary_10_3141_2333_07 crossref_primary_10_1016_j_ejor_2016_08_019 |
| Cites_doi | 10.1016/0191-2615(94)00024-T 10.1049/ic:19950249 10.3141/2029-03 10.1007/s11116-006-7473-5 10.1016/S0167-739X(00)00032-7 10.1287/opre.41.1.179 10.3141/1645-23 10.1016/j.cor.2011.02.018 10.1109/TAC.1976.1101194 10.1287/trsc.12.3.183 10.1287/trsc.12.3.200 10.1287/opre.37.6.893 10.1016/0968-090X(94)00015-W 10.1016/j.trb.2008.07.005 10.3141/1678-29 10.1287/opre.35.1.58 10.1287/trsc.29.2.128 10.1109/ITSC.2005.1520129 10.1016/0191-2615(96)00001-X 10.1016/0968-090X(94)90005-1 10.1023/A:1012827724856 10.1007/BF02031941 10.1680/ipeds.1952.11259 10.1016/0191-2615(95)00010-0 10.1016/j.ejor.2006.07.054 |
| ContentType | Journal Article |
| Copyright | 2012 National Academy of Sciences |
| Copyright_xml | – notice: 2012 National Academy of Sciences |
| DBID | AAYXX CITATION 8FD FR3 KR7 |
| DOI | 10.3141/2284-09 |
| DatabaseName | CrossRef Technology Research Database Engineering Research Database Civil Engineering Abstracts |
| DatabaseTitle | CrossRef Technology Research Database Civil Engineering Abstracts Engineering Research Database |
| DatabaseTitleList | Technology Research Database CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-4052 |
| EndPage | 80 |
| ExternalDocumentID | 10_3141_2284_09 10.3141_2284-09 |
| GroupedDBID | -TM -~X 0R~ 4.4 54M 5WW AADUE AAGGD AAGLT AAHPS AAPEO AAQXI AARIX AATAA AAULN AAWLO AAYOK AAZLU ABCCA ABCQX ABDEX ABFXH ABIDT ABKRH ABPNF ABQPY ABRHV ABUJY ABYTW ACCVJ ACDXX ACFZE ACGFS ACJER ACKIV ACOFE ACOXC ACSIQ ACUFS ACUIR ADEBD ADEIA ADPEE ADRRZ ADUKL AEDFJ AEDXQ AENEX AESZF AEWDL AEWHI AEXNY AFKRG AFMOU AFQAA AFUIA AGDVU AGKLV AGNHF AGNWV AHDMH AHHCN AHWHD AIZZC AJUZI AKSRI ALMA_UNASSIGNED_HOLDINGS ARTOV AYPQM BPACV CBRKF CCGJY CEADM DH. DOPDO DU5 DV7 DV8 EBS EJD F5P FHBDP GROUPED_SAGE_PREMIER_JOURNAL_COLLECTION H13 H~9 J8X K-O L7B MET MFT P2P Q1R SAFTQ SAUOL SCNPE SFC TN5 Y4B ZPLXX ZPPRI ZY4 ~02 ~32 AAYXX ACCVC AJGYC AMNSR CITATION 8FD AAPII AJHME AJVBE FR3 KR7 |
| ID | FETCH-LOGICAL-c315t-2e6c708a18cbd578f9b72801bf7fd3bd18d4da5acc04bd25ea5f23d13fc1fa5a3 |
| ISSN | 0361-1981 |
| IngestDate | Fri Sep 05 11:45:57 EDT 2025 Thu Apr 24 23:11:37 EDT 2025 Tue Jul 01 05:21:25 EDT 2025 Tue Jun 17 22:37:47 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c315t-2e6c708a18cbd578f9b72801bf7fd3bd18d4da5acc04bd25ea5f23d13fc1fa5a3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 1283653103 |
| PQPubID | 23500 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_1283653103 crossref_citationtrail_10_3141_2284_09 crossref_primary_10_3141_2284_09 sage_journals_10_3141_2284_09 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-01-01 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – month: 01 year: 2012 text: 2012-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Los Angeles, CA |
| PublicationPlace_xml | – name: Los Angeles, CA |
| PublicationTitle | Transportation research record |
| PublicationYear | 2012 |
| Publisher | SAGE Publications |
| Publisher_xml | – name: SAGE Publications |
| References | Merchant, Nemhauser 1978; 12 Jeihani, Sherali, Hobeika 2006; 33 Chen, Zhou, Xu 2012; 39 Peeta, Ziliaskopoulos 2001; 1 Friesz, Bernstein, Smith, Tobin, Wie 1993; 41 Rickert, Nagel 2001; 17 Lu, Mahmassani, Zhou 2009; 43 Wardrop 1952; 1 Friesz, Luque, Tobin, Wie 1989; 37 Florian, Mahut, Tremblay 2008; 189 Jayakrishnan, Tsai, Chen 1995; 3 Bertsekas 1976; 21 Ghali, Smith 1995; 29 Boyce, Ran, Leblanc 1995; 29 Peeta, Mahmassani 1995; 60 Ziliaskopoulos, Mahmassani 1996; 30 Carey 1987; 35 Ran, Hall, Boyce 1996; 30 Jayakrishnan, Mahmassani, Hu 1994; 2 bibr23-2284-09 Peeta S. (bibr2-2284-09) 1994 Janson B. N. (bibr6-2284-09) 1991 bibr25-2284-09 Ran B. (bibr8-2284-09) 1989 bibr1-2284-09 bibr10-2284-09 bibr24-2284-09 Ziliaskopoulos A. (bibr28-2284-09) 1993 bibr4-2284-09 bibr12-2284-09 bibr11-2284-09 bibr29-2284-09 bibr5-2284-09 Sheffi Y. (bibr33-2284-09) 1985 bibr26-2284-09 Leonard D. (bibr14-2284-09) 1989 bibr13-2284-09 bibr3-2284-09 bibr9-2284-09 bibr16-2284-09 bibr30-2284-09 bibr31-2284-09 bibr32-2284-09 bibr7-2284-09 bibr15-2284-09 Barcelo J. (bibr17-2284-09) 2002 Jayakrishnan R. (bibr27-2284-09) 1994 bibr20-2284-09 bibr21-2284-09 bibr19-2284-09 bibr18-2284-09 bibr22-2284-09 |
| References_xml | – volume: 35 start-page: 58 issue: 1 year: 1987 end-page: 69 article-title: Optimal Time-Varying Flows on Congested Networks publication-title: Operations Research – volume: 2 start-page: 129 issue: 3 year: 1994 end-page: 147 article-title: An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks publication-title: Transportation Research Part C: Emerging Technologies – volume: 3 start-page: 51 issue: 1 year: 1995 end-page: 72 article-title: A Dynamic Traffic Assignment Model with Traffic-Flow Relationships publication-title: Transportation Research Part C: Emerging Technologies – volume: 29 start-page: 155 issue: 3 year: 1995 end-page: 170 article-title: A Model for the Dynamic System Optimum Traffic Assignment Problem publication-title: Transportation Research Part B: Methodological – volume: 12 start-page: 200 issue: 3 year: 1978 end-page: 207 article-title: Optimality Conditions for a Dynamic Traffic Assignment Model publication-title: Transportation Science – volume: 21 start-page: 174 issue: 2 year: 1976 end-page: 184 article-title: On the Goldstein-Levitin-Polyak Gradient Projection Method publication-title: IEEE Transactions on Automatic Control – volume: 39 start-page: 127 issue: 2 year: 2012 end-page: 138 article-title: A Self-Adaptive Gradient Projection Algorithm for the Nonadditive Traffic Equilibrium Problem publication-title: Computers and Operations Research – volume: 1 start-page: 233 issue: 3 year: 2001 end-page: 265 article-title: Foundations of Dynamic Traffic Assignment: The Past, the Present, and the Future publication-title: Networks and Spatial Economics – volume: 60 start-page: 81 issue: 1 year: 1995 end-page: 113 article-title: System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks publication-title: Annals of Operations Research – volume: 30 start-page: 31 issue: 1 year: 1996 end-page: 46 article-title: A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice publication-title: Transportation Research Part B: Methodological – volume: 37 start-page: 893 issue: 6 year: 1989 end-page: 901 article-title: Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem publication-title: Operations Research – volume: 1 start-page: 325 year: 1952 end-page: 378 article-title: Some Theoretical Aspects of Road Traffic Research publication-title: Proceedings of the Institute of Civil Engineers, Part II – volume: 33 start-page: 589 issue: 1 year: 2006 end-page: 604 article-title: Computing Dynamic User Equilibria for Large-Scale Transportation Networks publication-title: Transportation – volume: 43 start-page: 345 issue: 3 year: 2009 end-page: 364 article-title: Equivalent Gap Function-Based Reformulation and Solution Algorithm for the Dynamic User Equilibrium Problem publication-title: Transportation Research Part B: Methodological – volume: 30 start-page: 359 issue: 5 year: 1996 end-page: 367 article-title: A Note on Least Time Path Computation Considering Delays and Prohibitions for Intersection Movements publication-title: Transportation Research Part B: Methodological – volume: 17 start-page: 637 issue: 5 year: 2001 end-page: 648 article-title: Dynamic Traffic Assignment on Parallel Computers in TRANSIMS publication-title: Future Generation Computer Systems – volume: 29 start-page: 128 issue: 2 year: 1995 end-page: 142 article-title: Solving an Instantaneous Dynamic User-Optimal Route Choice Model publication-title: Transportation Science – volume: 12 start-page: 183 issue: 3 year: 1978 end-page: 199 article-title: A Model and an Algorithm for the Dynamic Traffic Assignment Problems publication-title: Transportation Science – volume: 41 start-page: 179 year: 1993 end-page: 191 article-title: A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem publication-title: Operations Research – volume: 189 start-page: 1381 issue: 3 year: 2008 end-page: 1392 article-title: Application of a Simulation-Based Dynamic Traffic Assignment Model publication-title: European Journal of Operational Research – ident: bibr13-2284-09 doi: 10.1016/0191-2615(94)00024-T – ident: bibr19-2284-09 doi: 10.1049/ic:19950249 – ident: bibr31-2284-09 doi: 10.3141/2029-03 – ident: bibr22-2284-09 doi: 10.1007/s11116-006-7473-5 – ident: bibr21-2284-09 doi: 10.1016/S0167-739X(00)00032-7 – ident: bibr10-2284-09 doi: 10.1287/opre.41.1.179 – ident: bibr30-2284-09 doi: 10.3141/1645-23 – start-page: 75 volume-title: Transportation Research Record 1443 year: 1994 ident: bibr27-2284-09 – ident: bibr32-2284-09 doi: 10.1016/j.cor.2011.02.018 – start-page: 94 volume-title: Transportation Research Record 1408 year: 1993 ident: bibr28-2284-09 – ident: bibr26-2284-09 doi: 10.1109/TAC.1976.1101194 – ident: bibr3-2284-09 doi: 10.1287/trsc.12.3.183 – ident: bibr4-2284-09 doi: 10.1287/trsc.12.3.200 – start-page: 69 volume-title: Transportation Research Record 1328 year: 1991 ident: bibr6-2284-09 – ident: bibr7-2284-09 doi: 10.1287/opre.37.6.893 – ident: bibr12-2284-09 doi: 10.1016/0968-090X(94)00015-W – ident: bibr24-2284-09 doi: 10.1016/j.trb.2008.07.005 – ident: bibr25-2284-09 doi: 10.3141/1678-29 – volume-title: System Optimal Dynamic Traffic Assignment in Congested Networks with Advanced Information Systems. year: 1994 ident: bibr2-2284-09 – ident: bibr5-2284-09 doi: 10.1287/opre.35.1.58 – ident: bibr9-2284-09 doi: 10.1287/trsc.29.2.128 – ident: bibr18-2284-09 doi: 10.1109/ITSC.2005.1520129 – ident: bibr29-2284-09 doi: 10.1016/0191-2615(96)00001-X – ident: bibr16-2284-09 doi: 10.1016/0968-090X(94)90005-1 – volume-title: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. year: 1985 ident: bibr33-2284-09 – volume-title: CONTRAM: Structure of the Model. year: 1989 ident: bibr14-2284-09 – volume-title: Proc., Fifth World Conference on Transport Research year: 1989 ident: bibr8-2284-09 – ident: bibr1-2284-09 doi: 10.1023/A:1012827724856 – ident: bibr15-2284-09 doi: 10.1007/BF02031941 – volume-title: Proc., 9th Meeting of the Euro Working Group on Transportation year: 2002 ident: bibr17-2284-09 – ident: bibr20-2284-09 doi: 10.1680/ipeds.1952.11259 – ident: bibr11-2284-09 doi: 10.1016/0191-2615(95)00010-0 – ident: bibr23-2284-09 doi: 10.1016/j.ejor.2006.07.054 |
| SSID | ssib044964472 ssib031724273 ssj0033473 ssib053395398 |
| Score | 2.0263991 |
| Snippet | A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction... |
| SourceID | proquest crossref sage |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 70 |
| SubjectTerms | Algorithms Computer simulation Convergence Dynamics Mathematical models Projection Traffic engineering Traffic flow |
| Title | Gradient Projection Method for Simulation-Based Dynamic Traffic Assignment |
| URI | https://journals.sagepub.com/doi/full/10.3141/2284-09 https://www.proquest.com/docview/1283653103 |
| Volume | 2284 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELagvcAB8RRLKTIS4lIZ_MrrWKClWrXltSstp8ixnT6gKWrTA_x6xq9NKD0ULtHKm4yi-ZyZsT0zH0IvREYN_CdJW-SaSF0UpOFaE6otk02ZtzRkW-znO3M5XWSLgRXQV5f0zSv968q6kv9BFcYAV1cl-w_ILoXCAPwGfOEKCMP1Whi_P_MJW71L9z-2gfR7z1NC--zBL0cnkZyLvAFnZTbeBfp519HcdY5w2BwddMvcl-OR-_JhuRcY2wEdboT9nKWZiBvNYGAOh-TCqfqpvjnS-kh7_Hm8q-DTM9KuQqqmYoRVgU4lWUo-mhCcl3Jk-AL7R3Kh9CrjLJj09SfwIKHV4H_Smfv-h3p7vrtbz7YWs5tolReFO3df3fz68dNecq5CyJA0kF4v1EE70a-j4D8DjGHVMErU87HD7C66E4N-vBkQvIdu2O4-uj1qBfkATROWeMASBywxYIkvY4kjljhiiQcsH6L59tbs7Q6JPBdEC5b1hNtcF7RUrNSNAQvaVo0jDWNNW7RGNIaVRhqVKa2pbAzPrMpaLgwTrWYtjItHaKU77exjhLUVmZFFVXClZOlWo62lOYizYGclVRP0Mimn1rEJvOMi-V7DYtBpsXZarGk1AVnpxh-h78nftzxP2q3BJrmDJtXZ04vzGmIekWeOwW6C1p3a6_jRnF-W8eQaMtbQrWGGPkUr_dmFXYdIsG-exdnxG4wYYWM |
| linkProvider | SAGE Publications |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB6h5VA49AWIpYUaqeJmsGM7jyMt0OWxiBWLBKco8QOhwoIge-HXM44TdlkOVa-xZccz9nwz9jwAfgrFDLZJ6pJYU6mThJaR1pRpy2WZxo4Fb4vTuHchjy7V5RywNhamoeDTtnerwj-qhXVzugWXfCdCeUp9xN586lPRdGB-9-ps8GqhIxwi6EwgWcoMEX8SG4raTabqlHdBWgshwyu0iDlFA5yHwNrpqd4i1kQNnfL8qsHo4BMM2mUEH5S_2-MKV_A8k-Hxf9b5GT42minZDVvpC8zZ0VdYnMpXuARHfx5rD7GKnIULHGQq6dc1qAkqv-T85q6pBkZ_IToashfq3RNERJ-qguBmuLmu_Q-W4eJgf_i7R5tiDFQLrioa2VgnLC14qkuDx9xlpa9sxUuXOCNKw1MjTaEKrZksTaRsoVwkDBdOc4ffxQp0RvcjuwpEW6GMTLIkKgqZepPJWRbjcBaFgWRFF7Zague6yVTuC2bc5mixeOLknjg5y7o4VtvxISTneN9ls-VYjgfHv4YUI3s_fsoRmEWsfJm1Lqx7LuQtT2bHWPtH-w_40Bv2T_KTw9Pjb7CAKlUULmm-Q6d6HNt1VFuqcqPZqS81POJV |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVQKyE4sCPKaiTEzWDHdpYjW9lREVSCU5R4QQgoiKYXvp5xnNACB8Q1tux4xp43Y8-C0BaXVEObIDYKFREqikgeKEWoMkzkcWip97a4Ck-64uxO3lVBYS4WpqJgf8e5VcEflcLane43bXdLE1Ow3QBkKnFRe02AJxo0UHPvvnP9ZaUDJALwDGFZiARQfxgfChpOIsu0d15icy78SzQPGQEjnPng2tGpvqPWUBUd8f4qAak9jbr1UrwfytPOoIBVfPzI8vjftc6gqUpDxXt-S82iMdObQ5MjeQvn0dnxe-kpVuCOv8gB5uLLshY1BiUY3zy-VFXByD6gpMaHvu49BmR0KSswbIrHh9IPYQF120e3ByekKspAFGeyIIEJVUTjjMUq13DcbZK7Clcst5HVPNcs1kJnMlOKilwH0mTSBlwzbhWz8J0vokbvtWeWEFaGSy2iJAqyTMTOdLKGhjCcAaEgaNZC2zXRU1VlLHeFM55TsFwccVJHnJQmLRir7vjmk3T87rJZcy2FA-ReRbKeeR30UwBoHkpXbq2F1hwn0povP8dY_qN9A413DtvpxenV-QqaAM0q8Hc1q6hRvA_MGmgvRb5ebdZPnNLkyg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Gradient+Projection+Method+for+Simulation-Based+Dynamic+Traffic+Assignment&rft.jtitle=Transportation+research+record&rft.au=Yang%2C+Inchul&rft.au=Jayakrishnan%2C+R&rft.date=2012-01-01&rft.issn=0361-1981&rft.volume=2&rft.issue=2284&rft.spage=70&rft.epage=80&rft_id=info:doi/10.3141%2F2284-09&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0361-1981&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0361-1981&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0361-1981&client=summon |