Parallelization of the B static traffic assignment algorithm
A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This technique assigns trips from origins to destinations in a road traffic network so that all trips use the cheapest path. The cost of the path,...
Uloženo v:
| Vydáno v: | Ain Shams Engineering Journal Ročník 13; číslo 2; s. 101576 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.03.2022
Elsevier |
| Témata: | |
| ISSN: | 2090-4479 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This technique assigns trips from origins to destinations in a road traffic network so that all trips use the cheapest path. The cost of the path, which consists of roads (edges), is the sum of the roads costs. These costs increase with increasing flow in these roads. In this paper, we describe the parallelization of the B algorithm – a relatively new TA algorithm with a fast convergence to a solution. Since the nature of the algorithm and the nature of its fast convergence complicate the parallelization itself, we considered and implemented three parallel variants and tested them on real road traffic networks to investigate their convergence, usability, and speed. The parallelization is intended for a shared memory parallel computing environment. The description of the parallelization along with the performed tests is the main contribution of this paper. |
|---|---|
| AbstractList | A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This technique assigns trips from origins to destinations in a road traffic network so that all trips use the cheapest path. The cost of the path, which consists of roads (edges), is the sum of the roads costs. These costs increase with increasing flow in these roads. In this paper, we describe the parallelization of the B algorithm – a relatively new TA algorithm with a fast convergence to a solution. Since the nature of the algorithm and the nature of its fast convergence complicate the parallelization itself, we considered and implemented three parallel variants and tested them on real road traffic networks to investigate their convergence, usability, and speed. The parallelization is intended for a shared memory parallel computing environment. The description of the parallelization along with the performed tests is the main contribution of this paper. |
| ArticleNumber | 101576 |
| Author | Potuzak, Tomas Kolovsky, Frantisek |
| Author_xml | – sequence: 1 givenname: Tomas surname: Potuzak fullname: Potuzak, Tomas email: tpotuzak@kiv.zcu.cz organization: Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, 306 14 Plzen, Czech Republic – sequence: 2 givenname: Frantisek surname: Kolovsky fullname: Kolovsky, Frantisek email: kolovsky@kgm.zcu.cz organization: Department of Geomatics, Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, 306 14 Plzen, Czech Republic |
| BookMark | eNp9kM1OwzAQhH0oEqX0BTjlBRJsx3FsqReo-KlUCQ5wthxn3TpKY-RYSPD0OC1cOPQ0q5W-0cxcodngB0DohuCCYMJvu0KP0BUUU1JgWWBcztCcYolzxmp5iZbj6BqcbioqUc3R6lUH3ffQu28dnR8yb7O4h-w-G2N6mCwGbW1SncDdcIAhZrrf-eDi_nCNLqzuR1j-6gK9Pz68rZ_z7cvTZn23zQ0jOOa01GXNG0INLnUNU07GGBgCjLdMEmxMTbixLWu4sJzytqotCGYEL4kFWi7Q5uTbet2pj-AOOnwpr506PnzYKR1S2B5UJWnNkp3QljAimDSUAZhSNpJQ3OLkJU5eJvhxDGCVcfFYPTV1vSJYTQFVp6Yh1TSkwlKlIRNK_6F_Uc5CqxMEaaBPB0GNxsFgoHUBTEwN3Dn8BxR0j28 |
| CitedBy_id | crossref_primary_10_1007_s11116_025_10628_3 crossref_primary_10_3390_smartcities8010024 crossref_primary_10_1007_s11042_023_16020_6 |
| Cites_doi | 10.1287/trsc.14.1.42 10.1177/0361198118774236 10.1287/trsc.2018.0845 10.1061/(ASCE)0733-947X(2004)130:1(49) 10.1016/0191-2615(79)90022-5 10.1016/j.ejor.2005.02.029 10.1016/j.trb.2017.09.011 10.1016/j.trb.2016.02.005 10.1145/3362693 10.1287/trsc.1120.0409 10.3141/2498-06 10.1007/978-3-642-59179-2_9 10.1016/j.cor.2014.08.024 10.1016/S0895-7177(03)00090-6 10.1016/S1007-0214(09)70147-6 10.1016/j.trb.2009.06.005 10.1287/trsc.36.4.398.549 10.1007/BF02943605 10.1016/j.trb.2006.02.008 10.1080/23249935.2020.1720041 10.1007/BF01589409 |
| ContentType | Journal Article |
| Copyright | 2021 THE AUTHORS |
| Copyright_xml | – notice: 2021 THE AUTHORS |
| DBID | 6I. AAFTH AAYXX CITATION DOA |
| DOI | 10.1016/j.asej.2021.09.003 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef DOAJ Open Access Full Text |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | oai_doaj_org_article_59274c718af141849c24eec39b9120d0 10_1016_j_asej_2021_09_003 S2090447921003403 |
| GroupedDBID | 6I. AAFTH ALMA_UNASSIGNED_HOLDINGS M~E AAYXX CITATION GROUPED_DOAJ |
| ID | FETCH-LOGICAL-c410t-23a376b12c03a7e1016444ec1e46d4910cc716cfd4b68f626d57fe84c8631fe23 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000829965500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2090-4479 |
| IngestDate | Fri Oct 03 12:42:24 EDT 2025 Tue Nov 18 20:19:53 EST 2025 Wed Nov 05 20:58:25 EST 2025 Tue Jul 25 20:58:33 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | User equilibrium Static traffic assignment B algorithm Shared memory environment Algorithm parallelization |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c410t-23a376b12c03a7e1016444ec1e46d4910cc716cfd4b68f626d57fe84c8631fe23 |
| OpenAccessLink | https://doaj.org/article/59274c718af141849c24eec39b9120d0 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_59274c718af141849c24eec39b9120d0 crossref_citationtrail_10_1016_j_asej_2021_09_003 crossref_primary_10_1016_j_asej_2021_09_003 elsevier_sciencedirect_doi_10_1016_j_asej_2021_09_003 |
| PublicationCentury | 2000 |
| PublicationDate | March 2022 2022-03-00 2022-03-01 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: March 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Ain Shams Engineering Journal |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Mitradjieva, Lindberg (b0100) May 2013; 47 de Dios Ortúzar, Willumsen (b0020) 2011 Damberg, Migdalas (b0045) 1997 V. Buchhold, P. Sanders, and D. Wagner, “Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies,” ACM Journal of Experimental Algorithmics, Vol. 24, No. 2, 2019. Nie (b0070) 2010; 44 Cheng, Xu, Qiu (b0110) 2009; 14 Jafari, Pandey, Boyles (b0065) 2017; 105 Smith (b0080) 1979; 13 Transportation Networks for Research Core Team. Transportation Networks for Research. https://github.com/bstabler/TransportationNetworks. Accessed 2021-04-29. Boyce, Asce, Ralevic-Dekic, Bar-Gera (b0075) 2004; 130 Wardrop (b0005) 1952 Xie, (Marco) Nie (b0125) 2019; 53 Dial (b0010) 2006; 40 Xie, Xie (b0120) 2015; 2498 Perederieieva, Ehrgott, Raith, Wang (b0025) 2015; 54 Gentile (b0095) 2016; 92 Dafermos (b0085) 1980; 14 Jafari, Pandey, Boyles (b0030) 2016 Chen, Meyer (b0040) 1988; 42 Xie, (Marco) Nie, Liu (b0115) 2018; 2672 Bar-Gera (b0090) 2002; 36 Karakitsiou, Mavrommati, Migdalas (b0050) 2004; 4 Lee, Nie, Chen (b0105) 2003; 37 Chen, Liu, Kim (b0060) 2020; 16 Jayakrishnan, Tsai, Prashker, Rajadhyaksha (b0035) 1994; 1443 Lotito (b0015) 2006; 175 Cheng (10.1016/j.asej.2021.09.003_b0110) 2009; 14 Jafari (10.1016/j.asej.2021.09.003_b0065) 2017; 105 Mitradjieva (10.1016/j.asej.2021.09.003_b0100) 2013; 47 Chen (10.1016/j.asej.2021.09.003_b0060) 2020; 16 Xie (10.1016/j.asej.2021.09.003_b0115) 2018; 2672 Chen (10.1016/j.asej.2021.09.003_b0040) 1988; 42 Dafermos (10.1016/j.asej.2021.09.003_b0085) 1980; 14 10.1016/j.asej.2021.09.003_b0130 Wardrop (10.1016/j.asej.2021.09.003_b0005) 1952 10.1016/j.asej.2021.09.003_b0055 Xie (10.1016/j.asej.2021.09.003_b0120) 2015; 2498 Dial (10.1016/j.asej.2021.09.003_b0010) 2006; 40 Xie (10.1016/j.asej.2021.09.003_b0125) 2019; 53 Jayakrishnan (10.1016/j.asej.2021.09.003_b0035) 1994; 1443 Nie (10.1016/j.asej.2021.09.003_b0070) 2010; 44 Lotito (10.1016/j.asej.2021.09.003_b0015) 2006; 175 de Dios Ortúzar (10.1016/j.asej.2021.09.003_b0020) 2011 Lee (10.1016/j.asej.2021.09.003_b0105) 2003; 37 Smith (10.1016/j.asej.2021.09.003_b0080) 1979; 13 Boyce (10.1016/j.asej.2021.09.003_b0075) 2004; 130 Bar-Gera (10.1016/j.asej.2021.09.003_b0090) 2002; 36 Jafari (10.1016/j.asej.2021.09.003_b0030) 2016 Damberg (10.1016/j.asej.2021.09.003_b0045) 1997 Perederieieva (10.1016/j.asej.2021.09.003_b0025) 2015; 54 Karakitsiou (10.1016/j.asej.2021.09.003_b0050) 2004; 4 Gentile (10.1016/j.asej.2021.09.003_b0095) 2016; 92 |
| References_xml | – volume: 92 start-page: 120 year: 2016 end-page: 147 ident: b0095 article-title: Solving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms publication-title: Transport Res Part B Methodol – volume: 54 start-page: 90 year: 2015 end-page: 107 ident: b0025 article-title: A framework for and empirical study of algorithms for traffic assignment publication-title: Comput Oper Res – volume: 44 start-page: 73 year: 2010 end-page: 89 ident: b0070 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transport Res Part B Methodolog – volume: 130 start-page: 49 year: 2004 end-page: 55 ident: b0075 article-title: Convergence of Traffic Assignments: How Much is Enough? publication-title: J Transp Eng – volume: 47 start-page: 280 year: May 2013 end-page: 293 ident: b0100 article-title: The Stiff Is Moving—Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment publication-title: Transport Sci – volume: 37 start-page: 863 year: 2003 end-page: 878 ident: b0105 article-title: A conjugate gradient projection algorithm for the traffic assignment problem publication-title: Math Comput Modell – volume: 1443 year: 1994 ident: b0035 article-title: A Faster Path-based Algorithm for Traffic Assignment publication-title: Transp Res Rec – volume: 42 start-page: 327 year: 1988 end-page: 345 ident: b0040 article-title: Parallel optimization for traffic assignment publication-title: Math Program – volume: 53 start-page: 566 year: 2019 end-page: 584 ident: b0125 article-title: A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment publication-title: Transportation Science – volume: 14 start-page: 765 year: 2009 end-page: 775 ident: b0110 article-title: Constrained newton methods for transport network equilibrium analysis publication-title: Tsinghua Sci Technol – start-page: 325 year: 1952 end-page: 362 ident: b0005 article-title: Road Paper. Some Theoretical Aspects of Road Traffic Research publication-title: Proceedings of the Institute of Civil Engineers – year: 2016 ident: b0030 article-title: Static traffic assignment: a decentralized approach publication-title: Proceedings of the 95nd Annual Meeting of Transportation Research Board – reference: Transportation Networks for Research Core Team. Transportation Networks for Research. https://github.com/bstabler/TransportationNetworks. Accessed 2021-04-29. – volume: 40 start-page: 917 year: 2006 end-page: 936 ident: b0010 article-title: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration publication-title: Transport Res Part B Methodolog – volume: 2672 start-page: 36 year: 2018 end-page: 44 ident: b0115 article-title: A Greedy Path-Based Algorithm for Traffic Assignment publication-title: Transp Res Rec – volume: 16 start-page: 550 year: 2020 end-page: 573 ident: b0060 article-title: A parallel computing framework for solving user equilibrium problem on computer clusters publication-title: Transportmetrica A: Transport Science – volume: 2498 start-page: 46 year: 2015 end-page: 55 ident: b0120 article-title: Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance publication-title: Transp Res Rec – volume: 175 start-page: 1577 year: 2006 end-page: 1587 ident: b0015 article-title: Issues in the implementation of the DSD algorithm for the traffic assignment problem publication-title: Eur J Oper Res – volume: 36 start-page: 398 year: 2002 end-page: 417 ident: b0090 article-title: Origin-Based Algorithm for the Traffic Assignment Problem publication-title: Transport Sci – volume: 14 start-page: 42 year: 1980 end-page: 54 ident: b0085 article-title: “Traffic Equilibrium and Variational Inequalities publication-title: Transport Sci – volume: 4 start-page: 99 year: 2004 end-page: 118 ident: b0050 article-title: Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems publication-title: Oper Res Int Journal – volume: 13 start-page: 295 year: 1979 end-page: 304 ident: b0080 article-title: The existence, uniqueness and stability of traffic equilibria publication-title: Transport Res Part B Methodolog – start-page: 172 year: 1997 end-page: 193 ident: b0045 article-title: Distributed Disaggregate Simplicial Decomposition — A Parallel Algorithm for Traffic Assignment publication-title: Network Optimization, Lecture Notes in Economics and Mathematical Systems – year: 2011 ident: b0020 article-title: Modelling Transport – volume: 105 start-page: 270 year: 2017 end-page: 296 ident: b0065 article-title: A decomposition approach to the static traffic assignment problem publication-title: Transport Res Part B: Methodolog – reference: V. Buchhold, P. Sanders, and D. Wagner, “Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies,” ACM Journal of Experimental Algorithmics, Vol. 24, No. 2, 2019. – volume: 14 start-page: 42 issue: 1 year: 1980 ident: 10.1016/j.asej.2021.09.003_b0085 article-title: “Traffic Equilibrium and Variational Inequalities publication-title: Transport Sci doi: 10.1287/trsc.14.1.42 – volume: 2672 start-page: 36 issue: 48 year: 2018 ident: 10.1016/j.asej.2021.09.003_b0115 article-title: A Greedy Path-Based Algorithm for Traffic Assignment publication-title: Transp Res Rec doi: 10.1177/0361198118774236 – volume: 53 start-page: 566 issue: 2 year: 2019 ident: 10.1016/j.asej.2021.09.003_b0125 article-title: A New Algorithm for Achieving Proportionality in User Equilibrium Traffic Assignment publication-title: Transportation Science doi: 10.1287/trsc.2018.0845 – year: 2011 ident: 10.1016/j.asej.2021.09.003_b0020 – volume: 130 start-page: 49 issue: 1 year: 2004 ident: 10.1016/j.asej.2021.09.003_b0075 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) – volume: 13 start-page: 295 issue: 4 year: 1979 ident: 10.1016/j.asej.2021.09.003_b0080 article-title: The existence, uniqueness and stability of traffic equilibria publication-title: Transport Res Part B Methodolog doi: 10.1016/0191-2615(79)90022-5 – start-page: 325 year: 1952 ident: 10.1016/j.asej.2021.09.003_b0005 article-title: Road Paper. Some Theoretical Aspects of Road Traffic Research – volume: 175 start-page: 1577 issue: 3 year: 2006 ident: 10.1016/j.asej.2021.09.003_b0015 article-title: Issues in the implementation of the DSD algorithm for the traffic assignment problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.02.029 – volume: 105 start-page: 270 year: 2017 ident: 10.1016/j.asej.2021.09.003_b0065 article-title: A decomposition approach to the static traffic assignment problem publication-title: Transport Res Part B: Methodolog doi: 10.1016/j.trb.2017.09.011 – volume: 92 start-page: 120 year: 2016 ident: 10.1016/j.asej.2021.09.003_b0095 article-title: Solving a Dynamic User Equilibrium model based on splitting rates with Gradient Projection algorithms publication-title: Transport Res Part B Methodol doi: 10.1016/j.trb.2016.02.005 – ident: 10.1016/j.asej.2021.09.003_b0055 doi: 10.1145/3362693 – volume: 47 start-page: 280 issue: 2 year: 2013 ident: 10.1016/j.asej.2021.09.003_b0100 article-title: The Stiff Is Moving—Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment publication-title: Transport Sci doi: 10.1287/trsc.1120.0409 – volume: 2498 start-page: 46 issue: 1 year: 2015 ident: 10.1016/j.asej.2021.09.003_b0120 article-title: Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance publication-title: Transp Res Rec doi: 10.3141/2498-06 – year: 2016 ident: 10.1016/j.asej.2021.09.003_b0030 article-title: Static traffic assignment: a decentralized approach – start-page: 172 year: 1997 ident: 10.1016/j.asej.2021.09.003_b0045 article-title: Distributed Disaggregate Simplicial Decomposition — A Parallel Algorithm for Traffic Assignment doi: 10.1007/978-3-642-59179-2_9 – volume: 1443 year: 1994 ident: 10.1016/j.asej.2021.09.003_b0035 article-title: A Faster Path-based Algorithm for Traffic Assignment publication-title: Transp Res Rec – volume: 54 start-page: 90 year: 2015 ident: 10.1016/j.asej.2021.09.003_b0025 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: 37 start-page: 863 issue: 7–8 year: 2003 ident: 10.1016/j.asej.2021.09.003_b0105 article-title: A conjugate gradient projection algorithm for the traffic assignment problem publication-title: Math Comput Modell doi: 10.1016/S0895-7177(03)00090-6 – volume: 14 start-page: 765 issue: 6 year: 2009 ident: 10.1016/j.asej.2021.09.003_b0110 article-title: Constrained newton methods for transport network equilibrium analysis publication-title: Tsinghua Sci Technol doi: 10.1016/S1007-0214(09)70147-6 – volume: 44 start-page: 73 issue: 1 year: 2010 ident: 10.1016/j.asej.2021.09.003_b0070 article-title: A class of bush-based algorithms for the traffic assignment problem publication-title: Transport Res Part B Methodolog doi: 10.1016/j.trb.2009.06.005 – volume: 36 start-page: 398 issue: 4 year: 2002 ident: 10.1016/j.asej.2021.09.003_b0090 article-title: Origin-Based Algorithm for the Traffic Assignment Problem publication-title: Transport Sci doi: 10.1287/trsc.36.4.398.549 – ident: 10.1016/j.asej.2021.09.003_b0130 – volume: 4 start-page: 99 issue: 2 year: 2004 ident: 10.1016/j.asej.2021.09.003_b0050 article-title: Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems publication-title: Oper Res Int Journal doi: 10.1007/BF02943605 – volume: 40 start-page: 917 issue: 10 year: 2006 ident: 10.1016/j.asej.2021.09.003_b0010 article-title: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration publication-title: Transport Res Part B Methodolog doi: 10.1016/j.trb.2006.02.008 – volume: 16 start-page: 550 issue: 3 year: 2020 ident: 10.1016/j.asej.2021.09.003_b0060 article-title: A parallel computing framework for solving user equilibrium problem on computer clusters publication-title: Transportmetrica A: Transport Science doi: 10.1080/23249935.2020.1720041 – volume: 42 start-page: 327 year: 1988 ident: 10.1016/j.asej.2021.09.003_b0040 article-title: Parallel optimization for traffic assignment publication-title: Math Program doi: 10.1007/BF01589409 |
| SSID | ssib044728585 |
| Score | 2.272316 |
| Snippet | A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This... |
| SourceID | doaj crossref elsevier |
| SourceType | Open Website Enrichment Source Index Database Publisher |
| StartPage | 101576 |
| SubjectTerms | Algorithm parallelization B algorithm Shared memory environment Static traffic assignment User equilibrium |
| Title | Parallelization of the B static traffic assignment algorithm |
| URI | https://dx.doi.org/10.1016/j.asej.2021.09.003 https://doaj.org/article/59274c718af141849c24eec39b9120d0 |
| Volume | 13 |
| WOSCitedRecordID | wos000829965500009&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: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources issn: 2090-4479 databaseCode: M~E dateStart: 20100101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://road.issn.org omitProxy: false ssIdentifier: ssib044728585 providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcCCQIAoL3lgQxGxc3FiiYWiVgxQdQCpW-T4UVKVFoXAyG_nnEfVqSwskRLZsfWdk_Mn331HyDWkKnU2ZoHQhgeQ2jhQkNvAGKkSmzgOtlbXf0rG43Q6lZONUl8-JqyRB26Au40l8iaNf1DlGCAdkRq7Wx3JXDIempqth4ncIFO4kgAS7g-8fGW5UIYB3ss2Y6YJ7kIPMUdyyFktctpVzGq9Ui3ev-GcNhzO6IDstztFet_M8JDs2OURuZuo0lc_WbTpk3TlKG7h6ID6zKBC06pUXhSC4p64mNUn_VQtZquyqN7ej8nraPjy8Bi0BRACDSysAh4p_P5zxnUYIXJ-7gBgNbMgDKCj1wiM0M5ALlKH1MTEibMp6FREzFkenZDecrW0p4QqaQRzwgmFjDDWLo-ikOecG-Ws0AB9wjoAMt2qg_siFYusCwObZx60zIOWhdJrivbJzbrPR6ONsbX1wOO6bul1resHaO2stXb2l7X7JO6skrVbhMb146uKLYOf_cfg52SP--SHOgLtgvSq8stekl39XRWf5VW9APH6_DP8BVb53YM |
| linkProvider | Directory of Open Access Journals |
| 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=Parallelization+of+the+B+static+traffic+assignment+algorithm&rft.jtitle=Ain+Shams+Engineering+Journal&rft.au=Potuzak%2C+Tomas&rft.au=Kolovsky%2C+Frantisek&rft.date=2022-03-01&rft.pub=Elsevier+B.V&rft.issn=2090-4479&rft.volume=13&rft.issue=2&rft_id=info:doi/10.1016%2Fj.asej.2021.09.003&rft.externalDocID=S2090447921003403 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2090-4479&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2090-4479&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2090-4479&client=summon |