A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
•A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is proposed to solve the CMSTA problem. The first parallel stage of the TP algorithm is used in the path generation phase, and the second paral...
Uložené v:
| Vydané v: | Computers & operations research Ročník 154; s. 106193 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.06.2023
|
| Predmet: | |
| ISSN: | 0305-0548, 1873-765X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is proposed to solve the CMSTA problem. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase.•An optimal parallel computing resource schedule is proposed to solve each block problem.•The parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources.•To validate the two-stage parallel method with large-scale networks.
Efficiently solving the traffic assignment problem (TAP) for large-scale transport networks is a critical problem for transportation studies. Most of the existing algorithms for TAP are serial ones based on single-computer mode, which has inherently limited the computational efficiency, compared with parallel computing methods. Thus, this paper aims to propose an efficient distributed multi-computer cluster resource allocation method for the parallel computing of TAP. Previous studies on the parallel computing of TAP are mainly based on a single-mode, which is extended to a more complex combined modal split and traffic assignment (CMSTA) case in this paper. In order to decompose the CMSTA problem, we proposed a block-decomposed model for solving the CMSTA problem. Then we designed an optimal parallel computing resource schedule for solving each block problem more quickly on the huge transportation network. Therefore, we implemented a customized two-stage parallel (TP) algorithm that can fully use parallel resources. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase. Besides, the parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources. Numerical examples are taken to validate the efficiency and robustness of the proposed TP algorithm. |
|---|---|
| AbstractList | •A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is proposed to solve the CMSTA problem. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase.•An optimal parallel computing resource schedule is proposed to solve each block problem.•The parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources.•To validate the two-stage parallel method with large-scale networks.
Efficiently solving the traffic assignment problem (TAP) for large-scale transport networks is a critical problem for transportation studies. Most of the existing algorithms for TAP are serial ones based on single-computer mode, which has inherently limited the computational efficiency, compared with parallel computing methods. Thus, this paper aims to propose an efficient distributed multi-computer cluster resource allocation method for the parallel computing of TAP. Previous studies on the parallel computing of TAP are mainly based on a single-mode, which is extended to a more complex combined modal split and traffic assignment (CMSTA) case in this paper. In order to decompose the CMSTA problem, we proposed a block-decomposed model for solving the CMSTA problem. Then we designed an optimal parallel computing resource schedule for solving each block problem more quickly on the huge transportation network. Therefore, we implemented a customized two-stage parallel (TP) algorithm that can fully use parallel resources. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase. Besides, the parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources. Numerical examples are taken to validate the efficiency and robustness of the proposed TP algorithm. |
| ArticleNumber | 106193 |
| Author | Wang, Zewen Zhang, Honggang Cheng, Qixiu Chen, Xinyuan Liu, Zhiyuan Zhang, Kai |
| Author_xml | – sequence: 1 givenname: Kai surname: Zhang fullname: Zhang, Kai organization: Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, China – sequence: 2 givenname: Honggang surname: Zhang fullname: Zhang, Honggang organization: Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, China – sequence: 3 givenname: Qixiu orcidid: 0000-0001-8772-7584 surname: Cheng fullname: Cheng, Qixiu organization: Department of Logistics & Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong – sequence: 4 givenname: Xinyuan surname: Chen fullname: Chen, Xinyuan organization: College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing, China – sequence: 5 givenname: Zewen orcidid: 0000-0001-5956-7317 surname: Wang fullname: Wang, Zewen organization: Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, China – sequence: 6 givenname: Zhiyuan surname: Liu fullname: Liu, Zhiyuan email: zhiyuanl@seu.edu.cn organization: Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, China |
| BookMark | eNp9kM1KAzEQgINUsFUfwFteYGt-uptdPIn4BwUvCt5CNpm0KdlkSaKiT--WevLQuQwzzDfMfAs0CzEAQleULCmhzfVuqWNaMsL4VDe04ydoTlvBK9HU7zM0J5zUFalX7Rla5LwjUwhG5-jrFuuPXOLgfsDg8hWrXNQG8KiS8h481nEYP4oLG6z8JiZXtgO2MeEc_ee-W7awn-ldmPghGuVxHr0rWIVpX1LWOo1Vzm4TBggFjyn2HoYLdGqVz3D5l8_R28P9691TtX55fL67XVeadaJUuhWEWLC0aYQylplecbBEdDW3DDoOioExrYCat22jbU872oIhvWrYinPNz5E47NUp5pzASu2KKi6G6TbnJSVy70_u5ORP7v3Jg7-JpP_IMblBpe-jzM2BgemlTwdJZu0gaDAugS7SRHeE_gVhbo5O |
| CitedBy_id | crossref_primary_10_1007_s11116_025_10628_3 crossref_primary_10_1016_j_cstp_2024_101301 crossref_primary_10_1016_j_tre_2025_104377 crossref_primary_10_1007_s11067_024_09617_3 crossref_primary_10_1016_j_tre_2023_103368 crossref_primary_10_1016_j_tre_2024_103687 crossref_primary_10_1016_j_tra_2024_104032 crossref_primary_10_1016_j_tra_2024_104243 crossref_primary_10_1016_j_tra_2024_104160 crossref_primary_10_3934_era_2025143 crossref_primary_10_1016_j_tra_2025_104615 crossref_primary_10_1016_j_ejor_2023_07_005 crossref_primary_10_1016_j_commtr_2023_100108 crossref_primary_10_1016_j_trc_2025_105260 crossref_primary_10_1016_j_tra_2025_104458 |
| Cites_doi | 10.1287/trsc.31.2.107 10.1016/j.trb.2017.09.011 10.1061/(ASCE)0733-947X(2004)130:1(49) 10.1002/net.3230120105 10.1111/0885-9507.00193 10.1080/18128602.2012.691911 10.1016/j.trc.2004.07.011 10.1016/j.trc.2020.102809 10.1007/BF01589409 10.1016/j.trb.2009.06.005 10.1287/trsc.17.4.454 10.1016/j.trb.2006.02.008 10.1145/140901.141926 10.1287/trsc.36.4.398.549 10.1016/j.trc.2011.06.007 10.1080/10556788.2017.1332621 10.1080/23249935.2020.1720041 10.1016/j.cor.2017.04.001 10.1016/j.cor.2014.01.012 10.1016/j.tre.2022.102832 10.1177/0361198118774236 10.1016/j.cor.2014.08.024 10.1287/trsc.19.4.445 10.1287/trsc.17.1.32 10.1109/TAC.1976.1101194 10.1287/trsc.15.4.306 10.1016/j.trb.2021.08.011 10.1145/3362693 10.1287/trsc.1120.0409 10.1080/02331939308843903 10.1287/trsc.26.1.4 10.1016/0041-1647(76)90100-3 10.1016/j.cor.2018.12.020 10.1016/j.trc.2016.12.003 10.1002/atr.177 10.1006/jpdc.1998.1502 10.1016/j.trc.2019.05.011 10.1287/trsc.13.4.292 10.1155/2021/1986851 10.1016/j.ejor.2016.08.019 10.1080/23249935.2020.1722279 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Ltd |
| Copyright_xml | – notice: 2023 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cor.2023.106193 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X |
| ExternalDocumentID | 10_1016_j_cor_2023_106193 S0305054823000576 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-c8700fef1667adf2dba3ef07953f2e93ea2edd87e53886cfb1918ed0ba62433c3 |
| ISICitedReferencesCount | 21 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000954659900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Tue Nov 18 22:34:36 EST 2025 Sat Nov 29 07:18:30 EST 2025 Fri Feb 23 02:37:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Gradient Projection Traffic Assignment Problem Distributed Parallel computing Modal Split |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-c8700fef1667adf2dba3ef07953f2e93ea2edd87e53886cfb1918ed0ba62433c3 |
| ORCID | 0000-0001-5956-7317 0000-0001-8772-7584 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cor_2023_106193 crossref_primary_10_1016_j_cor_2023_106193 elsevier_sciencedirect_doi_10_1016_j_cor_2023_106193 |
| PublicationCentury | 2000 |
| PublicationDate | June 2023 2023-06-00 |
| PublicationDateYYYYMMDD | 2023-06-01 |
| PublicationDate_xml | – month: 06 year: 2023 text: June 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2023 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Gentile (b0125) 2014; 10 Dafermos (b0085) 1982; 12 Wardrop (b0270) 1952; 1 Xie, Nie, Liu (b0275) 2018; 2672 Abdulaal, LeBlanc (b0010) 1979; 13 Dimitri P. Bertsekas. 1976. On the Goldstein-Levitin-Polyak gradient projection method. IEEE T. Automat. Contr. (1976), 174-184. Larsson, Patriksson (b0150) 1992; 26 Yang, Meng, Hau (b0280) 2004 Qu, Zhou (b0230) 2017; 75 Ryu, S., Chen, A. and Kitthamkesorn, S., 2021. A Two-Phase Gradient Projection Algorithm for Solving the Combined Modal Split and Traffic Assignment Problem with Nested Logit Function. Journal of Advanced Transportation 2021. Fan, Ding, Liu, Wang, Long (b0100) 2022; 164 Cantarella (b0060) 1997; 31 Berteskas, Tsitsiklis (b0040) 1989 Leblanc, Farhangian (b0165) 1981; 15 Victor Y. Pan, Franco P., 1992. Supereffective slow-down of parallel computations. Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, 402-409. Ryu, Chen, Choi (b0245) 2017; 257 Boyce, Ralevic-Dekic, Bar-Gera (b0050) 2004; 130 Evans (b0095) 1976; 10 Jafari, Pandey, Boyles (b0135) 2017; 105 Aashtiani (b0005) 1979 Babazadeh, Javani, Gentile, Florian (b0020) 2020; 16 Chen, Liu, Zhang, Wang (b0075) 2020; 120 Ryu, Chen, Choi (b0240) 2014; 47 Chen, Meyer (b0080) 1988; 42 Leblanc, Helgason, Boyce (b0170) 1985; 19 Lo, Yip, Wan (b0185) 2004; 12 Chen, A., Jayakrishnan, R., 1998. A path-based gradient projection algorithm: effects of equilibration with a restricted path set under two flow update policies. Publication of: California University, Irvine. Larsson, Migdalas, Partriksson (b0155) 1993; 28 Chen, Liu, Kim (b0070) 2020; 16 Liu, Meng (b0175) 2013; 47 Liu, Wang, Cheng, Yin, Wang (b0180) 2021; 152 Sheffi (b0255) 1985 Fisk, Boyce (b0105) 1983; 17 Florian, Spiess (b0115) 1983; 17 Jayakrishnan, R., Tsai, W.T., Prashker, J.N., Rajadhyaksha, S., 1994. A faster path-based algorithm for traffic assignment. Research Papers in Economics. Mitradjieva, Lindberg (b0195) 2013; 47 Perederieieva, Ehrgott, Raith, Wang (b0220) 2015; 54 Dial (b0090) 2006; 40 Meng, Liu (b0190) 2012; 21 Hribar, Taylor, Boyce (b0130) 1998; 55 Boilé, Spasovic (b0045) 2000; 15 Nie (b0200) 2010; 44 Buchhold, Sanders, Wagner (b0055) 2019; 24 Florian, Hearn (b0110) 1995; 8 Ben-Akiva, Lerman (b0035) 1985 Rauchecker, Schryen (b0235) 2019; 104 Wang, Zhang, Chen, Wang, Liu, Liu (b0265) 2021; 1–32 Pi, Ma, Qian (b0225) 2019; 104 Bar-Gera (b0030) 2002; 36 Galligari, Sciandrone (b0120) 2018; 33 Ozden, Smith, Gue (b0205) 2017; 85 Patriksson, M., 2015. The traffic assignment problem: models and methods. Courier Dover Publications. Larsson (10.1016/j.cor.2023.106193_b0150) 1992; 26 10.1016/j.cor.2023.106193_b0250 Buchhold (10.1016/j.cor.2023.106193_b0055) 2019; 24 10.1016/j.cor.2023.106193_b0210 Nie (10.1016/j.cor.2023.106193_b0200) 2010; 44 Abdulaal (10.1016/j.cor.2023.106193_b0010) 1979; 13 Rauchecker (10.1016/j.cor.2023.106193_b0235) 2019; 104 Aashtiani (10.1016/j.cor.2023.106193_b0005) 1979 Wang (10.1016/j.cor.2023.106193_b0265) 2021; 1–32 Dafermos (10.1016/j.cor.2023.106193_b0085) 1982; 12 Sheffi (10.1016/j.cor.2023.106193_b0255) 1985 Boilé (10.1016/j.cor.2023.106193_b0045) 2000; 15 Fan (10.1016/j.cor.2023.106193_b0100) 2022; 164 Xie (10.1016/j.cor.2023.106193_b0275) 2018; 2672 Evans (10.1016/j.cor.2023.106193_b0095) 1976; 10 Berteskas (10.1016/j.cor.2023.106193_b0040) 1989 Wardrop (10.1016/j.cor.2023.106193_b0270) 1952; 1 Boyce (10.1016/j.cor.2023.106193_b0050) 2004; 130 Gentile (10.1016/j.cor.2023.106193_b0125) 2014; 10 Hribar (10.1016/j.cor.2023.106193_b0130) 1998; 55 Meng (10.1016/j.cor.2023.106193_b0190) 2012; 21 Cantarella (10.1016/j.cor.2023.106193_b0060) 1997; 31 Liu (10.1016/j.cor.2023.106193_b0180) 2021; 152 Yang (10.1016/j.cor.2023.106193_b0280) 2004 Perederieieva (10.1016/j.cor.2023.106193_b0220) 2015; 54 Liu (10.1016/j.cor.2023.106193_b0175) 2013; 47 Mitradjieva (10.1016/j.cor.2023.106193_b0195) 2013; 47 Larsson (10.1016/j.cor.2023.106193_b0155) 1993; 28 Leblanc (10.1016/j.cor.2023.106193_b0170) 1985; 19 Bar-Gera (10.1016/j.cor.2023.106193_b0030) 2002; 36 10.1016/j.cor.2023.106193_b9000 Galligari (10.1016/j.cor.2023.106193_b0120) 2018; 33 Ben-Akiva (10.1016/j.cor.2023.106193_b0035) 1985 Chen (10.1016/j.cor.2023.106193_b0080) 1988; 42 Chen (10.1016/j.cor.2023.106193_b0070) 2020; 16 Lo (10.1016/j.cor.2023.106193_b0185) 2004; 12 Qu (10.1016/j.cor.2023.106193_b0230) 2017; 75 10.1016/j.cor.2023.106193_b0140 Ozden (10.1016/j.cor.2023.106193_b0205) 2017; 85 Jafari (10.1016/j.cor.2023.106193_b0135) 2017; 105 10.1016/j.cor.2023.106193_b0065 Pi (10.1016/j.cor.2023.106193_b0225) 2019; 104 Ryu (10.1016/j.cor.2023.106193_b0245) 2017; 257 Babazadeh (10.1016/j.cor.2023.106193_b0020) 2020; 16 Florian (10.1016/j.cor.2023.106193_b0115) 1983; 17 Fisk (10.1016/j.cor.2023.106193_b0105) 1983; 17 Leblanc (10.1016/j.cor.2023.106193_b0165) 1981; 15 Florian (10.1016/j.cor.2023.106193_b0110) 1995; 8 Ryu (10.1016/j.cor.2023.106193_b0240) 2014; 47 10.1016/j.cor.2023.106193_b0215 Chen (10.1016/j.cor.2023.106193_b0075) 2020; 120 Dial (10.1016/j.cor.2023.106193_b0090) 2006; 40 |
| References_xml | – volume: 44 start-page: 73 year: 2010 end-page: 89 ident: b0200 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transp. Res. B Methodol. – volume: 16 start-page: 1111 year: 2020 end-page: 1135 ident: b0020 article-title: Reduced gradient algorithm for user equilibrium traffic assignment problem publication-title: Transportmetrica A: Transp. Sci. – volume: 33 start-page: 354 year: 2018 end-page: 371 ident: b0120 article-title: A convergent and fast path equilibration algorithm for the traffic assignment problem publication-title: Optim. Methods Softw. – year: 2004 ident: b0280 article-title: Optimal integrated pricing in a bi-modal transportation network publication-title: Urban and Regional Transportation Modeling – volume: 17 start-page: 32 year: 1983 end-page: 47 ident: b0115 article-title: On binary mode choice/assignment models publication-title: Transp. Sci. – volume: 24 start-page: 1 year: 2019 end-page: 28 ident: b0055 article-title: Real-time traffic assignment using engineered customizable contraction hierarchies publication-title: J. Exp. Algorithmics (JEA) – volume: 47 start-page: 553 year: 2013 end-page: 571 ident: b0175 article-title: Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems publication-title: J. Adv. Transp. – reference: Dimitri P. Bertsekas. 1976. On the Goldstein-Levitin-Polyak gradient projection method. IEEE T. Automat. Contr. (1976), 174-184. – volume: 55 start-page: 153 year: 1998 end-page: 165 ident: b0130 article-title: Termination detection for parallel shortest path algorithms publication-title: J. Parallel Distrib. Comput. – volume: 10 start-page: 15 year: 2014 end-page: 54 ident: b0125 article-title: Local User Cost equilibrium: a bush-based algorithm for traffic assignment publication-title: Transportmetrica A: Transp. Sci. – volume: 47 start-page: 61 year: 2014 end-page: 71 ident: b0240 article-title: A modified gradient projection algorithm for solving the elastic demand traffic assignment problem publication-title: Comput. Oper. Res. – volume: 2672 start-page: 36 year: 2018 end-page: 44 ident: b0275 article-title: A greedy path-based algorithm for traffic assignment publication-title: Transp. Res. Rec. – volume: 42 start-page: 327 year: 1988 end-page: 345 ident: b0080 article-title: Parallel optimization for traffic assignment publication-title: Math. Program. – volume: 28 start-page: 47 year: 1993 end-page: 61 ident: b0155 article-title: A partial linearization method for the traffic assignment problem publication-title: Optimization – volume: 26 start-page: 4 year: 1992 end-page: 17 ident: b0150 article-title: Simplicial decomposition with disaggregated representation for the traffic assignment problem publication-title: Transp. Sci. – reference: Patriksson, M., 2015. The traffic assignment problem: models and methods. Courier Dover Publications. – volume: 257 start-page: 870 year: 2017 end-page: 880 ident: b0245 article-title: Solving the combined modal split and traffic assignment problem with two types of transit impedance function publication-title: Eur. J. Oper. Res. – reference: Ryu, S., Chen, A. and Kitthamkesorn, S., 2021. A Two-Phase Gradient Projection Algorithm for Solving the Combined Modal Split and Traffic Assignment Problem with Nested Logit Function. Journal of Advanced Transportation 2021. – volume: 40 start-page: 917 year: 2006 end-page: 936 ident: b0090 article-title: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration publication-title: Transp. Res. B Methodol. – volume: 12 start-page: 57 year: 1982 end-page: 72 ident: b0085 article-title: The general multi-modal network equilibrium problem with elastic demand publication-title: Networks – volume: 15 start-page: 306 year: 1981 end-page: 317 ident: b0165 article-title: Efficient algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems publication-title: Transp. Sci. – volume: 8 start-page: 485 year: 1995 end-page: 550 ident: b0110 article-title: Network equilibrium models and algorithms publication-title: Handbooks Oper. Res. Management Sci. – volume: 104 start-page: 369 year: 2019 end-page: 389 ident: b0225 article-title: A general formulation for multi-modal dynamic traffic assignment considering multi-class vehicles, public transit and parking publication-title: Transp. Res. Part C: Emerging Technol. – volume: 152 start-page: 276 year: 2021 end-page: 294 ident: b0180 article-title: Estimation of urban network capacity with second-best constraints for multimodal transport systems publication-title: Transp. Res. Part B-Methodol. – volume: 19 start-page: 445 year: 1985 end-page: 462 ident: b0170 article-title: Improved efficiency of the Frank-Wolfe algorithm for convex network programs publication-title: Transp. Sci. – volume: 105 start-page: 270 year: 2017 end-page: 296 ident: b0135 article-title: A decomposition approach to the static traffic assignment problem publication-title: Transp. Res. B Methodol. – volume: 1 start-page: 325 year: 1952 end-page: 362 ident: b0270 article-title: Road paper. Some theoretical aspects of road traffic research publication-title: Proc. Inst. Civ. Eng. – year: 1989 ident: b0040 article-title: Parallel and Distributed Computation – Numerical Methods – reference: Jayakrishnan, R., Tsai, W.T., Prashker, J.N., Rajadhyaksha, S., 1994. A faster path-based algorithm for traffic assignment. Research Papers in Economics. – year: 1979 ident: b0005 article-title: The Multi-modal Traffic Assignment Problem – volume: 31 start-page: 107 year: 1997 end-page: 128 ident: b0060 article-title: A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand publication-title: Transp. Sci. – volume: 47 start-page: 280 year: 2013 end-page: 293 ident: b0195 article-title: The stiff is moving—conjugate direction Frank-Wolfe Methods with applications to traffic assignment publication-title: Transp. Sci. – volume: 164 year: 2022 ident: b0100 article-title: Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 17 start-page: 454 year: 1983 end-page: 463 ident: b0105 article-title: Alternative variational inequality formulations of the network equilibrium-travel choice problem publication-title: Transp. Sci. – volume: 12 start-page: 251 year: 2004 end-page: 272 ident: b0185 article-title: Modeling competitive multi-modal transit services: a nested logit approach publication-title: Transp. Res. Part C: Emerging Technol. – volume: 13 start-page: 292 year: 1979 end-page: 314 ident: b0010 article-title: Methods for combining modal split and equilibrium assignment models publication-title: Transp. Sci. – volume: 36 start-page: 398 year: 2002 end-page: 417 ident: b0030 article-title: Origin-based algorithm for the traffic assignment problem publication-title: Transp. Sci. – volume: 10 start-page: 37 year: 1976 end-page: 57 ident: b0095 article-title: Derivation and analysis of some models for combining trip distribution and assignment publication-title: Transp. Res. – reference: Chen, A., Jayakrishnan, R., 1998. A path-based gradient projection algorithm: effects of equilibration with a restricted path set under two flow update policies. Publication of: California University, Irvine. – volume: 1–32 year: 2021 ident: b0265 article-title: An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem publication-title: Transportmetrica A: Transp. Sci. – volume: 15 start-page: 293 year: 2000 end-page: 307 ident: b0045 article-title: An implementation of the mode-split traffic-assignment method publication-title: Comput. Aided Civ. Infrastructure Eng. – volume: 120 year: 2020 ident: b0075 article-title: A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm publication-title: Transp. Res. Part C: Emerging Technol. – volume: 130 start-page: 49 year: 2004 end-page: 55 ident: b0050 article-title: Convergence of traffic assignments: how much is enough? publication-title: J. Transp. Eng. – volume: 85 start-page: 87 year: 2017 end-page: 96 ident: b0205 article-title: Solving large batches of traveling salesman problems with parallel and distributed computing publication-title: Comput. Oper. Res. – year: 1985 ident: b0255 article-title: Urban Transportation Networks – year: 1985 ident: b0035 article-title: Discrete Choice Analysis: Theory and Application to Travel Demand – volume: 21 start-page: 134 year: 2012 end-page: 147 ident: b0190 article-title: Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network publication-title: Transp. Res. Part C: Emerging Technol. – reference: Victor Y. Pan, Franco P., 1992. Supereffective slow-down of parallel computations. Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, 402-409. – volume: 75 start-page: 1 year: 2017 end-page: 16 ident: b0230 article-title: Large-scale dynamic transportation network simulation: a space-time-event parallel computing approach publication-title: Transp. Res. Part C: Emerging Technol. – volume: 104 start-page: 338 year: 2019 end-page: 357 ident: b0235 article-title: Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm publication-title: Comput. Oper. Res. – volume: 16 start-page: 550 year: 2020 end-page: 573 ident: b0070 article-title: A parallel computing framework for solving user equilibrium problem on computer clusters publication-title: Transportmetrica A: Transp. Sci. – volume: 54 start-page: 90 year: 2015 end-page: 107 ident: b0220 article-title: A framework for and empirical study of algorithms for traffic assignment publication-title: Comput. Oper. Res. – volume: 31 start-page: 107 issue: 2 year: 1997 ident: 10.1016/j.cor.2023.106193_b0060 article-title: A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand publication-title: Transp. Sci. doi: 10.1287/trsc.31.2.107 – volume: 105 start-page: 270 year: 2017 ident: 10.1016/j.cor.2023.106193_b0135 article-title: A decomposition approach to the static traffic assignment problem publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2017.09.011 – volume: 130 start-page: 49 issue: 1 year: 2004 ident: 10.1016/j.cor.2023.106193_b0050 article-title: Convergence of traffic assignments: how much is enough? publication-title: J. Transp. Eng. doi: 10.1061/(ASCE)0733-947X(2004)130:1(49) – ident: 10.1016/j.cor.2023.106193_b0065 – volume: 12 start-page: 57 issue: 1 year: 1982 ident: 10.1016/j.cor.2023.106193_b0085 article-title: The general multi-modal network equilibrium problem with elastic demand publication-title: Networks doi: 10.1002/net.3230120105 – volume: 15 start-page: 293 issue: 4 year: 2000 ident: 10.1016/j.cor.2023.106193_b0045 article-title: An implementation of the mode-split traffic-assignment method publication-title: Comput. Aided Civ. Infrastructure Eng. doi: 10.1111/0885-9507.00193 – volume: 10 start-page: 15 issue: 1 year: 2014 ident: 10.1016/j.cor.2023.106193_b0125 article-title: Local User Cost equilibrium: a bush-based algorithm for traffic assignment publication-title: Transportmetrica A: Transp. Sci. doi: 10.1080/18128602.2012.691911 – volume: 12 start-page: 251 issue: 3–4 year: 2004 ident: 10.1016/j.cor.2023.106193_b0185 article-title: Modeling competitive multi-modal transit services: a nested logit approach publication-title: Transp. Res. Part C: Emerging Technol. doi: 10.1016/j.trc.2004.07.011 – volume: 120 year: 2020 ident: 10.1016/j.cor.2023.106193_b0075 article-title: A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm publication-title: Transp. Res. Part C: Emerging Technol. doi: 10.1016/j.trc.2020.102809 – year: 1985 ident: 10.1016/j.cor.2023.106193_b0035 – year: 1979 ident: 10.1016/j.cor.2023.106193_b0005 – volume: 42 start-page: 327 issue: 1 year: 1988 ident: 10.1016/j.cor.2023.106193_b0080 article-title: Parallel optimization for traffic assignment publication-title: Math. Program. doi: 10.1007/BF01589409 – year: 1985 ident: 10.1016/j.cor.2023.106193_b0255 – volume: 44 start-page: 73 issue: 1 year: 2010 ident: 10.1016/j.cor.2023.106193_b0200 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2009.06.005 – ident: 10.1016/j.cor.2023.106193_b0215 – volume: 17 start-page: 454 issue: 4 year: 1983 ident: 10.1016/j.cor.2023.106193_b0105 article-title: Alternative variational inequality formulations of the network equilibrium-travel choice problem publication-title: Transp. Sci. doi: 10.1287/trsc.17.4.454 – volume: 40 start-page: 917 issue: 10 year: 2006 ident: 10.1016/j.cor.2023.106193_b0090 article-title: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2006.02.008 – ident: 10.1016/j.cor.2023.106193_b0210 doi: 10.1145/140901.141926 – year: 2004 ident: 10.1016/j.cor.2023.106193_b0280 article-title: Optimal integrated pricing in a bi-modal transportation network – volume: 36 start-page: 398 issue: 4 year: 2002 ident: 10.1016/j.cor.2023.106193_b0030 article-title: Origin-based algorithm for the traffic assignment problem publication-title: Transp. Sci. doi: 10.1287/trsc.36.4.398.549 – volume: 21 start-page: 134 issue: 1 year: 2012 ident: 10.1016/j.cor.2023.106193_b0190 article-title: Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network publication-title: Transp. Res. Part C: Emerging Technol. doi: 10.1016/j.trc.2011.06.007 – volume: 33 start-page: 354 issue: 2 year: 2018 ident: 10.1016/j.cor.2023.106193_b0120 article-title: A convergent and fast path equilibration algorithm for the traffic assignment problem publication-title: Optim. Methods Softw. doi: 10.1080/10556788.2017.1332621 – volume: 16 start-page: 550 issue: 3 year: 2020 ident: 10.1016/j.cor.2023.106193_b0070 article-title: A parallel computing framework for solving user equilibrium problem on computer clusters publication-title: Transportmetrica A: Transp. Sci. doi: 10.1080/23249935.2020.1720041 – volume: 85 start-page: 87 year: 2017 ident: 10.1016/j.cor.2023.106193_b0205 article-title: Solving large batches of traveling salesman problems with parallel and distributed computing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.04.001 – volume: 47 start-page: 61 year: 2014 ident: 10.1016/j.cor.2023.106193_b0240 article-title: A modified gradient projection algorithm for solving the elastic demand traffic assignment problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.01.012 – volume: 164 year: 2022 ident: 10.1016/j.cor.2023.106193_b0100 article-title: Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2022.102832 – ident: 10.1016/j.cor.2023.106193_b0140 – volume: 2672 start-page: 36 issue: 48 year: 2018 ident: 10.1016/j.cor.2023.106193_b0275 article-title: A greedy path-based algorithm for traffic assignment publication-title: Transp. Res. Rec. doi: 10.1177/0361198118774236 – volume: 54 start-page: 90 year: 2015 ident: 10.1016/j.cor.2023.106193_b0220 article-title: A framework for and empirical study of algorithms for traffic assignment publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.08.024 – volume: 19 start-page: 445 issue: 4 year: 1985 ident: 10.1016/j.cor.2023.106193_b0170 article-title: Improved efficiency of the Frank-Wolfe algorithm for convex network programs publication-title: Transp. Sci. doi: 10.1287/trsc.19.4.445 – volume: 17 start-page: 32 issue: 1 year: 1983 ident: 10.1016/j.cor.2023.106193_b0115 article-title: On binary mode choice/assignment models publication-title: Transp. Sci. doi: 10.1287/trsc.17.1.32 – ident: 10.1016/j.cor.2023.106193_b9000 doi: 10.1109/TAC.1976.1101194 – volume: 15 start-page: 306 issue: 4 year: 1981 ident: 10.1016/j.cor.2023.106193_b0165 article-title: Efficient algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems publication-title: Transp. Sci. doi: 10.1287/trsc.15.4.306 – volume: 152 start-page: 276 year: 2021 ident: 10.1016/j.cor.2023.106193_b0180 article-title: Estimation of urban network capacity with second-best constraints for multimodal transport systems publication-title: Transp. Res. Part B-Methodol. doi: 10.1016/j.trb.2021.08.011 – volume: 24 start-page: 1 year: 2019 ident: 10.1016/j.cor.2023.106193_b0055 article-title: Real-time traffic assignment using engineered customizable contraction hierarchies publication-title: J. Exp. Algorithmics (JEA) doi: 10.1145/3362693 – volume: 1–32 year: 2021 ident: 10.1016/j.cor.2023.106193_b0265 article-title: An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem publication-title: Transportmetrica A: Transp. Sci. – volume: 47 start-page: 280 issue: 2 year: 2013 ident: 10.1016/j.cor.2023.106193_b0195 article-title: The stiff is moving—conjugate direction Frank-Wolfe Methods with applications to traffic assignment publication-title: Transp. Sci. doi: 10.1287/trsc.1120.0409 – volume: 8 start-page: 485 year: 1995 ident: 10.1016/j.cor.2023.106193_b0110 article-title: Network equilibrium models and algorithms publication-title: Handbooks Oper. Res. Management Sci. – volume: 28 start-page: 47 issue: 1 year: 1993 ident: 10.1016/j.cor.2023.106193_b0155 article-title: A partial linearization method for the traffic assignment problem publication-title: Optimization doi: 10.1080/02331939308843903 – volume: 26 start-page: 4 issue: 1 year: 1992 ident: 10.1016/j.cor.2023.106193_b0150 article-title: Simplicial decomposition with disaggregated representation for the traffic assignment problem publication-title: Transp. Sci. doi: 10.1287/trsc.26.1.4 – volume: 10 start-page: 37 issue: 1 year: 1976 ident: 10.1016/j.cor.2023.106193_b0095 article-title: Derivation and analysis of some models for combining trip distribution and assignment publication-title: Transp. Res. doi: 10.1016/0041-1647(76)90100-3 – volume: 104 start-page: 338 year: 2019 ident: 10.1016/j.cor.2023.106193_b0235 article-title: Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.12.020 – volume: 75 start-page: 1 year: 2017 ident: 10.1016/j.cor.2023.106193_b0230 article-title: Large-scale dynamic transportation network simulation: a space-time-event parallel computing approach publication-title: Transp. Res. Part C: Emerging Technol. doi: 10.1016/j.trc.2016.12.003 – volume: 47 start-page: 553 issue: 6 year: 2013 ident: 10.1016/j.cor.2023.106193_b0175 article-title: Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems publication-title: J. Adv. Transp. doi: 10.1002/atr.177 – volume: 1 start-page: 325 issue: 3 year: 1952 ident: 10.1016/j.cor.2023.106193_b0270 article-title: Road paper. Some theoretical aspects of road traffic research publication-title: Proc. Inst. Civ. Eng. – volume: 55 start-page: 153 issue: 2 year: 1998 ident: 10.1016/j.cor.2023.106193_b0130 article-title: Termination detection for parallel shortest path algorithms publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1998.1502 – volume: 104 start-page: 369 year: 2019 ident: 10.1016/j.cor.2023.106193_b0225 article-title: A general formulation for multi-modal dynamic traffic assignment considering multi-class vehicles, public transit and parking publication-title: Transp. Res. Part C: Emerging Technol. doi: 10.1016/j.trc.2019.05.011 – volume: 13 start-page: 292 issue: 4 year: 1979 ident: 10.1016/j.cor.2023.106193_b0010 article-title: Methods for combining modal split and equilibrium assignment models publication-title: Transp. Sci. doi: 10.1287/trsc.13.4.292 – year: 1989 ident: 10.1016/j.cor.2023.106193_b0040 – ident: 10.1016/j.cor.2023.106193_b0250 doi: 10.1155/2021/1986851 – volume: 257 start-page: 870 issue: 3 year: 2017 ident: 10.1016/j.cor.2023.106193_b0245 article-title: Solving the combined modal split and traffic assignment problem with two types of transit impedance function publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.08.019 – volume: 16 start-page: 1111 issue: 3 year: 2020 ident: 10.1016/j.cor.2023.106193_b0020 article-title: Reduced gradient algorithm for user equilibrium traffic assignment problem publication-title: Transportmetrica A: Transp. Sci. doi: 10.1080/23249935.2020.1722279 |
| SSID | ssj0000721 |
| Score | 2.4995542 |
| Snippet | •A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106193 |
| SubjectTerms | Distributed Parallel computing Gradient Projection Modal Split Traffic Assignment Problem |
| Title | A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem |
| URI | https://dx.doi.org/10.1016/j.cor.2023.106193 |
| Volume | 154 |
| WOSCitedRecordID | wos000954659900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1db9MwFLXKhhA88FGGGF_yA09UQWmc1PFjhYYGSBNIQ-pb5MROyJQmVZZ0hV_Cz-U6tpOwMcQeeIki13as3BP72j33XIRe-4IElPHY4Zwkjk996XARB45IQkoZbElcoZNN0JOTcLVinyeTnzYWZlvQsgx3O7b5r6aGMjC2Cp29gbn7TqEA7sHocAWzw_WfDL-cJS14dOv8B_iSzUXlgP-XyZnS-C4KWXQk8rYjO_Miq-q8-bbuuIYwqq2NnYI6sGOG9utKqIAS8FQ1E72pudKcmIHLnWeaSGBS0oy9XJsq4rwDVrWRtSHcGWmh_gi6P67-xPMrZcdVmWXcrKwdA0HqH77ku7wdl6rCVV5-bw3UzSmGRwa2lY3eUiTCQKtu9jNz4I_mVrV51dkUr0z7-gTiDKymJF498nao-7vE9qWlryckWq7bWQRdRKqLSHdxC-17NGAw5e8vPxytPg6rPO1i-vpx23_MO-7gpXH82ecZ-TGnD9F9swHBSw2cR2giyym6Y-MfpuiBNR420_4U3RuJVj5GF0s8AAz3AMMWYLgHGO4BhgFg2AAMA8CwBRjuAIY7gGEAGDYAwwPAsAHYAfr6_uj03bFj0nc4icdo48DX7rqpTOeLBeUi9UTMiUxdygKSepIRyT0pREglrLnhIknjOZuHUrgxX3g-IQl5gvbKqpRPlbCA59KUxCxNpa_0lvxAwFZFChqTeZKyQ-TaFxwlRttepVgpomsNe4je9E02Wtjlb5V9a7XIeKba44wAgdc3e3aTZzxHd4cP4wXaa-pWvkS3k22Tn9evDPx-ASwOs8I |
| linkProvider | Elsevier |
| 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=A+customized+two-stage+parallel+computing+algorithm+for+solving+the+combined+modal+split+and+traffic+assignment+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Zhang%2C+Kai&rft.au=Zhang%2C+Honggang&rft.au=Cheng%2C+Qixiu&rft.au=Chen%2C+Xinyuan&rft.date=2023-06-01&rft.issn=0305-0548&rft.volume=154&rft.spage=106193&rft_id=info:doi/10.1016%2Fj.cor.2023.106193&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2023_106193 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |